./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-170.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:37,614 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:37,696 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9bb2be-9974-4198-ae67-e5857db51ec4/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:37,701 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:37,702 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:37,723 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:37,724 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:37,724 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:37,724 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:37,725 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:37,725 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:37,725 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:37,725 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:37,726 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:37,726 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:37,726 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:37,726 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:37,726 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:37,726 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:37,726 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:37,726 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:37,727 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:37,727 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:37,727 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:37,727 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:37,728 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:37,728 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:38,075 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:38,086 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:38,089 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:38,092 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:38,092 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:38,094 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9bb2be-9974-4198-ae67-e5857db51ec4/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-170.smt2
[2025-04-28 21:21:38,097 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:38,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:38,526 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f9bb2be-9974-4198-ae67-e5857db51ec4/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-170.smt2
[2025-04-28 21:21:38,529 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:38,531 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:38,532 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:38,532 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:38,533 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:38,536 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,574 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38 Unit
[2025-04-28 21:21:38,575 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:38,576 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:38,576 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:38,576 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:38,598 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,598 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,634 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,635 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,640 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,645 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,649 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,650 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,651 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,668 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:38,669 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:38,673 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:38,673 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:38,675 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (1/1) ...
[2025-04-28 21:21:38,680 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:38,697 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:38,714 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:38,718 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:38,732 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:38,733 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:38,733 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:38,733 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure CHC_COMP_FALSE given in one single declaration
[2025-04-28 21:21:38,733 INFO  L130     BoogieDeclarations]: Found specification of procedure CHC_COMP_FALSE
[2025-04-28 21:21:38,733 INFO  L138     BoogieDeclarations]: Found implementation of procedure CHC_COMP_FALSE
[2025-04-28 21:21:38,733 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__2 given in one single declaration
[2025-04-28 21:21:38,733 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__2
[2025-04-28 21:21:38,733 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__2
[2025-04-28 21:21:38,734 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__2_PRE given in one single declaration
[2025-04-28 21:21:38,734 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__2_PRE
[2025-04-28 21:21:38,734 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__2_PRE
[2025-04-28 21:21:38,734 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f^f_PRE given in one single declaration
[2025-04-28 21:21:38,734 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f^f_PRE
[2025-04-28 21:21:38,734 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f^f_PRE
[2025-04-28 21:21:38,734 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__1 given in one single declaration
[2025-04-28 21:21:38,734 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__1
[2025-04-28 21:21:38,734 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__1
[2025-04-28 21:21:38,734 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__1_PRE given in one single declaration
[2025-04-28 21:21:38,735 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__1_PRE
[2025-04-28 21:21:38,735 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__1_PRE
[2025-04-28 21:21:38,735 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f^f given in one single declaration
[2025-04-28 21:21:38,735 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f^f
[2025-04-28 21:21:38,735 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f^f
[2025-04-28 21:21:38,735 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:38,738 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:38,738 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:38,805 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:38,808 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:39,249 INFO  L?                        ?]: Removed 12 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:39,252 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:39,276 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:39,278 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-04-28 21:21:39,279 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:39 BoogieIcfgContainer
[2025-04-28 21:21:39,279 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:39,284 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:39,284 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:39,289 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:39,289 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:38" (1/3) ...
[2025-04-28 21:21:39,290 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24762250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:39, skipping insertion in model container
[2025-04-28 21:21:39,291 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:38" (2/3) ...
[2025-04-28 21:21:39,291 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24762250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:39, skipping insertion in model container
[2025-04-28 21:21:39,291 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:39" (3/3) ...
[2025-04-28 21:21:39,294 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:39,311 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:39,314 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 9 procedures, 83 locations, 221 edges, 9 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:39,375 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:39,392 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@ebe7174, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:39,392 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:39,396 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 83 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 53 states have internal predecessors, (53), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 25 states have call predecessors, (56), 56 states have call successors, (56)
[2025-04-28 21:21:39,422 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2025-04-28 21:21:39,422 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,423 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,423 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,429 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,429 INFO  L85        PathProgramCache]: Analyzing trace with hash 645170521, now seen corresponding path program 1 times
[2025-04-28 21:21:39,440 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,441 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892164664]
[2025-04-28 21:21:39,441 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,469 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-04-28 21:21:39,472 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-04-28 21:21:39,472 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,473 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:39,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,515 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892164664]
[2025-04-28 21:21:39,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892164664] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:39,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:39,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-04-28 21:21:39,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528202388]
[2025-04-28 21:21:39,525 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,530 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-04-28 21:21:39,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,568 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-04-28 21:21:39,568 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-04-28 21:21:39,571 INFO  L87              Difference]: Start difference. First operand  has 83 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 53 states have internal predecessors, (53), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 25 states have call predecessors, (56), 56 states have call successors, (56) Second operand  has 2 states, 2 states have (on average 2.0) internal successors, (4), 1 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-04-28 21:21:39,617 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,618 INFO  L93              Difference]: Finished difference Result 69 states and 127 transitions.
[2025-04-28 21:21:39,619 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-04-28 21:21:39,621 INFO  L79                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 2.0) internal successors, (4), 1 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 8
[2025-04-28 21:21:39,622 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,635 INFO  L225             Difference]: With dead ends: 69
[2025-04-28 21:21:39,636 INFO  L226             Difference]: Without dead ends: 69
[2025-04-28 21:21:39,639 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-04-28 21:21:39,644 INFO  L437           NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,645 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:39,664 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2025-04-28 21:21:39,706 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2025-04-28 21:21:39,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 69 states, 16 states have (on average 2.4375) internal successors, (39), 39 states have internal predecessors, (39), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 23 states have call predecessors, (44), 44 states have call successors, (44)
[2025-04-28 21:21:39,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 127 transitions.
[2025-04-28 21:21:39,718 INFO  L79                 Accepts]: Start accepts. Automaton has 69 states and 127 transitions. Word has length 8
[2025-04-28 21:21:39,719 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,719 INFO  L485      AbstractCegarLoop]: Abstraction has 69 states and 127 transitions.
[2025-04-28 21:21:39,719 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 2.0) internal successors, (4), 1 states have internal predecessors, (4), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-04-28 21:21:39,719 INFO  L278                IsEmpty]: Start isEmpty. Operand 69 states and 127 transitions.
[2025-04-28 21:21:39,726 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:39,726 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,726 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,726 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:39,726 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,727 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,727 INFO  L85        PathProgramCache]: Analyzing trace with hash -180096431, now seen corresponding path program 1 times
[2025-04-28 21:21:39,727 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,727 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400590506]
[2025-04-28 21:21:39,727 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,740 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:39,776 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:39,776 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,776 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:40,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,043 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400590506]
[2025-04-28 21:21:40,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400590506] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:40,043 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:40,043 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:40,043 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032471111]
[2025-04-28 21:21:40,043 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,044 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:40,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,045 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:40,045 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:40,047 INFO  L87              Difference]: Start difference. First operand 69 states and 127 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:40,192 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,193 INFO  L93              Difference]: Finished difference Result 73 states and 136 transitions.
[2025-04-28 21:21:40,193 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:40,194 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:40,194 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,196 INFO  L225             Difference]: With dead ends: 73
[2025-04-28 21:21:40,198 INFO  L226             Difference]: Without dead ends: 73
[2025-04-28 21:21:40,199 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:40,200 INFO  L437           NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,201 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 334 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:40,203 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2025-04-28 21:21:40,221 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71.
[2025-04-28 21:21:40,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 40 states have internal predecessors, (40), 44 states have call successors, (44), 8 states have call predecessors, (44), 9 states have return successors, (50), 24 states have call predecessors, (50), 44 states have call successors, (50)
[2025-04-28 21:21:40,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 134 transitions.
[2025-04-28 21:21:40,228 INFO  L79                 Accepts]: Start accepts. Automaton has 71 states and 134 transitions. Word has length 16
[2025-04-28 21:21:40,229 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,229 INFO  L485      AbstractCegarLoop]: Abstraction has 71 states and 134 transitions.
[2025-04-28 21:21:40,229 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:40,229 INFO  L278                IsEmpty]: Start isEmpty. Operand 71 states and 134 transitions.
[2025-04-28 21:21:40,234 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:40,234 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,234 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,234 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:40,234 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,235 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,235 INFO  L85        PathProgramCache]: Analyzing trace with hash -2128880310, now seen corresponding path program 1 times
[2025-04-28 21:21:40,235 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,235 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478841189]
[2025-04-28 21:21:40,235 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,242 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:40,252 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:40,253 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,253 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:40,352 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,352 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478841189]
[2025-04-28 21:21:40,352 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478841189] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:40,352 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:40,352 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:40,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754829598]
[2025-04-28 21:21:40,353 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,353 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:40,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,353 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:40,354 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:40,354 INFO  L87              Difference]: Start difference. First operand 71 states and 134 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:40,521 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,521 INFO  L93              Difference]: Finished difference Result 71 states and 132 transitions.
[2025-04-28 21:21:40,525 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:40,525 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:40,526 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,528 INFO  L225             Difference]: With dead ends: 71
[2025-04-28 21:21:40,528 INFO  L226             Difference]: Without dead ends: 70
[2025-04-28 21:21:40,528 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:40,529 INFO  L437           NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,529 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 314 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:40,530 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2025-04-28 21:21:40,545 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2025-04-28 21:21:40,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 70 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 39 states have internal predecessors, (39), 43 states have call successors, (43), 8 states have call predecessors, (43), 9 states have return successors, (48), 24 states have call predecessors, (48), 43 states have call successors, (48)
[2025-04-28 21:21:40,552 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 130 transitions.
[2025-04-28 21:21:40,552 INFO  L79                 Accepts]: Start accepts. Automaton has 70 states and 130 transitions. Word has length 16
[2025-04-28 21:21:40,552 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,552 INFO  L485      AbstractCegarLoop]: Abstraction has 70 states and 130 transitions.
[2025-04-28 21:21:40,552 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:40,552 INFO  L278                IsEmpty]: Start isEmpty. Operand 70 states and 130 transitions.
[2025-04-28 21:21:40,557 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:40,557 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,557 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,557 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:40,557 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,558 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,558 INFO  L85        PathProgramCache]: Analyzing trace with hash 119863399, now seen corresponding path program 1 times
[2025-04-28 21:21:40,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,558 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854476340]
[2025-04-28 21:21:40,559 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,572 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:40,588 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:40,590 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,591 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,730 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:40,731 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,731 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854476340]
[2025-04-28 21:21:40,732 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854476340] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:40,732 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:40,732 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:40,732 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052047587]
[2025-04-28 21:21:40,732 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,733 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:40,733 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,733 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:40,733 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:40,734 INFO  L87              Difference]: Start difference. First operand 70 states and 130 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:40,843 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,843 INFO  L93              Difference]: Finished difference Result 72 states and 131 transitions.
[2025-04-28 21:21:40,846 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:40,847 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:40,847 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,849 INFO  L225             Difference]: With dead ends: 72
[2025-04-28 21:21:40,849 INFO  L226             Difference]: Without dead ends: 72
[2025-04-28 21:21:40,849 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:40,850 INFO  L437           NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,853 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 334 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:40,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2025-04-28 21:21:40,871 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70.
[2025-04-28 21:21:40,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 70 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 39 states have internal predecessors, (39), 43 states have call successors, (43), 8 states have call predecessors, (43), 9 states have return successors, (47), 24 states have call predecessors, (47), 43 states have call successors, (47)
[2025-04-28 21:21:40,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions.
[2025-04-28 21:21:40,874 INFO  L79                 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 16
[2025-04-28 21:21:40,874 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,874 INFO  L485      AbstractCegarLoop]: Abstraction has 70 states and 129 transitions.
[2025-04-28 21:21:40,874 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:40,874 INFO  L278                IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions.
[2025-04-28 21:21:40,876 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:40,877 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,877 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,877 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:40,877 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,878 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,878 INFO  L85        PathProgramCache]: Analyzing trace with hash -1642691388, now seen corresponding path program 1 times
[2025-04-28 21:21:40,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,878 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069396296]
[2025-04-28 21:21:40,878 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,878 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,886 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:40,896 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:40,898 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,898 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:40,898 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:40,900 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:40,911 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:40,911 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,911 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:40,928 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:40,928 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:40,929 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:40,931 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:21:40,935 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2025-04-28 21:21:40,946 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:40,949 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:40 BoogieIcfgContainer
[2025-04-28 21:21:40,950 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:40,953 INFO  L158              Benchmark]: Toolchain (without parser) took 2420.23ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 156.9MB in the beginning and 113.3MB in the end (delta: 43.6MB). Peak memory consumption was 2.7MB. Max. memory is 33.6GB.
[2025-04-28 21:21:40,953 INFO  L158              Benchmark]: SmtParser took 0.37ms. Allocated memory is still 234.9MB. Free memory is still 173.4MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:40,954 INFO  L158              Benchmark]: ChcToBoogie took 43.20ms. Allocated memory is still 234.9MB. Free memory was 156.9MB in the beginning and 155.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:40,955 INFO  L158              Benchmark]: Boogie Preprocessor took 92.37ms. Allocated memory is still 234.9MB. Free memory was 155.6MB in the beginning and 152.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:40,956 INFO  L158              Benchmark]: RCFGBuilder took 610.26ms. Allocated memory is still 234.9MB. Free memory was 152.9MB in the beginning and 133.5MB in the end (delta: 19.3MB). Peak memory consumption was 33.6MB. Max. memory is 33.6GB.
[2025-04-28 21:21:40,956 INFO  L158              Benchmark]: TraceAbstraction took 1666.13ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 133.2MB in the beginning and 113.3MB in the end (delta: 19.9MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:40,958 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.37ms. Allocated memory is still 234.9MB. Free memory is still 173.4MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 43.20ms. Allocated memory is still 234.9MB. Free memory was 156.9MB in the beginning and 155.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 92.37ms. Allocated memory is still 234.9MB. Free memory was 155.6MB in the beginning and 152.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 610.26ms. Allocated memory is still 234.9MB. Free memory was 152.9MB in the beginning and 133.5MB in the end (delta: 19.3MB). Peak memory consumption was 33.6MB. Max. memory is 33.6GB.
 * TraceAbstraction took 1666.13ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 133.2MB in the beginning and 113.3MB in the end (delta: 19.9MB). There was no memory consumed. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Unknown line] : the set of constraint Horn clauses is unsatisfiable
    the set of constraint Horn clauses is unsatisfiable
We found a FailurePath: 
[L0]  CALL  call False();
[L0]  CALL  call CHC_COMP_FALSE();
[L0]        assume (((((hbv_CHC_COMP_FALSE_C_2 + 1 != 0 && !(1 < hbv_CHC_COMP_FALSE_B_4)) && !(2 <= hbv_CHC_COMP_FALSE_B_4)) && hbv_CHC_COMP_FALSE_E_1 == hbv_CHC_COMP_FALSE_B_4) && !(hbv_CHC_COMP_FALSE_E_1 < 1)) && hbv_CHC_COMP_FALSE_E_1 == hbv_CHC_COMP_FALSE_D_3 + 1) && !(2 + hbv_CHC_COMP_FALSE_C_2 <= 0);
      VAL   [hbv_CHC_COMP_FALSE_C_2=0, hbv_CHC_COMP_FALSE_D_3=0]
[L0]  CALL  call INV_REC_f__1(hbv_CHC_COMP_FALSE_D_3, hbv_CHC_COMP_FALSE_C_2);
      VAL   [hhv_INV_REC_f__1_A_0=0, hhv_INV_REC_f__1_B_1=0]
[L0]        assume (hhv_INV_REC_f__1_B_1 == hhv_INV_REC_f__1_A_0 && !(hhv_INV_REC_f__1_A_0 + 1 <= 0)) && !(1 <= hhv_INV_REC_f__1_A_0);
      VAL   [hhv_INV_REC_f__1_A_0=0, hhv_INV_REC_f__1_B_1=0]
[L0]  CALL  call INV_REC_f__1_PRE(hhv_INV_REC_f__1_A_0);
      VAL   [hhv_INV_REC_f__1_PRE_A_0=0]
[L0]        assume ((!(2 <= hbv_INV_REC_f__1_PRE_C_2) && hbv_INV_REC_f__1_PRE_C_2 == hbv_INV_REC_f__1_PRE_B_1) && hbv_INV_REC_f__1_PRE_B_1 == hhv_INV_REC_f__1_PRE_A_0 + 1) && !(hbv_INV_REC_f__1_PRE_B_1 < 1);
      VAL   [hhv_INV_REC_f__1_PRE_A_0=0]
[L0]  RET   call INV_REC_f__1_PRE(hhv_INV_REC_f__1_A_0);
      VAL   [hhv_INV_REC_f__1_A_0=0, hhv_INV_REC_f__1_B_1=0]
[L0]  RET   call INV_REC_f__1(hbv_CHC_COMP_FALSE_D_3, hbv_CHC_COMP_FALSE_C_2);
      VAL   [hbv_CHC_COMP_FALSE_C_2=0, hbv_CHC_COMP_FALSE_D_3=0]
[L0]  RET   call CHC_COMP_FALSE();
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 9 procedures, 83 locations, 221 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 1109 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 617 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 492 mSDtfsCounter, 87 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 78 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2025-04-28 21:21:40,977 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
unsat
