/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/c-barrier-2t.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:45:25,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:45:25,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:45:25,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:45:25,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:45:25,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:45:25,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:45:25,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:45:25,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:45:25,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:45:25,794 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:45:25,795 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:45:25,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:45:25,795 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:45:25,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:45:25,796 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:45:25,796 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:45:25,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:45:25,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:45:25,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:45:25,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:45:25,796 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:45:25,796 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-02-17 22:45:26,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:45:26,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:45:26,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:45:26,035 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:45:26,035 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:45:26,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/c-barrier-2t.c.bpl [2025-02-17 22:45:26,036 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/c-barrier-2t.c.bpl' [2025-02-17 22:45:26,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:45:26,051 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:45:26,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:26,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:45:26,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:45:26,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/1) ... [2025-02-17 22:45:26,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/1) ... [2025-02-17 22:45:26,066 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:45:26,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:26,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:45:26,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:45:26,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:45:26,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/1) ... [2025-02-17 22:45:26,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/1) ... [2025-02-17 22:45:26,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/1) ... [2025-02-17 22:45:26,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/1) ... [2025-02-17 22:45:26,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/1) ... [2025-02-17 22:45:26,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/1) ... [2025-02-17 22:45:26,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/1) ... [2025-02-17 22:45:26,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/1) ... [2025-02-17 22:45:26,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/1) ... [2025-02-17 22:45:26,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:45:26,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:45:26,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:45:26,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:45:26,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/1) ... [2025-02-17 22:45:26,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:26,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:26,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:26,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:45:26,124 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:45:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:45:26,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:45:26,124 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:45:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:45:26,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:45:26,124 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:45:26,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:45:26,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:45:26,126 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:45:26,161 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:45:26,163 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:45:26,258 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:45:26,258 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:45:26,267 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:45:26,267 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:45:26,268 INFO L201 PluginConnector]: Adding new model c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:26 BoogieIcfgContainer [2025-02-17 22:45:26,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:45:26,269 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:45:26,269 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:45:26,272 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:45:26,274 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:26,274 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:26" (1/2) ... [2025-02-17 22:45:26,275 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bb367fd and model type c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:45:26, skipping insertion in model container [2025-02-17 22:45:26,275 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:26,275 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:26" (2/2) ... [2025-02-17 22:45:26,276 INFO L363 chiAutomizerObserver]: Analyzing ICFG c-barrier-2t.c.bpl [2025-02-17 22:45:26,330 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:45:26,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 78 flow [2025-02-17 22:45:26,381 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-02-17 22:45:26,385 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:45:26,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 4/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-02-17 22:45:26,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 78 flow [2025-02-17 22:45:26,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 68 flow [2025-02-17 22:45:26,404 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:45:26,405 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:45:26,405 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:45:26,405 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:45:26,405 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:45:26,405 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:45:26,405 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:45:26,405 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:45:26,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-02-17 22:45:26,440 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 96 [2025-02-17 22:45:26,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:26,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:26,443 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:26,444 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:26,444 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:45:26,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 123 states, but on-demand construction may add more states [2025-02-17 22:45:26,449 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 96 [2025-02-17 22:45:26,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:26,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:26,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:26,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:26,453 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[94] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:45:26,453 INFO L754 eck$LassoCheckResult]: Loop: "[71] L22-->L24: Formula: (< (+ v_x4_1 v_x1_1) v_z_2) InVars {x4=v_x4_1, x1=v_x1_1, z=v_z_2} OutVars{x4=v_x4_1, x1=v_x1_1, z=v_z_2} AuxVars[] AssignedVars[]" "[73] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[75] L25-->L22: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-02-17 22:45:26,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:26,457 INFO L85 PathProgramCache]: Analyzing trace with hash 3101, now seen corresponding path program 1 times [2025-02-17 22:45:26,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:26,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183168500] [2025-02-17 22:45:26,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:26,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:26,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:26,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:26,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:26,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:26,515 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:26,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:26,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:26,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:26,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:26,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:26,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash 100360, now seen corresponding path program 1 times [2025-02-17 22:45:26,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:26,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756608668] [2025-02-17 22:45:26,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:26,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:26,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:26,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:26,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:26,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:26,536 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:26,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:26,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:26,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:26,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:26,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:26,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash 92452460, now seen corresponding path program 1 times [2025-02-17 22:45:26,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:26,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882538888] [2025-02-17 22:45:26,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:26,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:26,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:26,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:26,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:26,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:26,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:26,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:26,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:26,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:26,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:26,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:26,621 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:26,621 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:26,621 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:26,621 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:26,621 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:26,622 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:26,622 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:26,622 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:26,622 INFO L132 ssoRankerPreferences]: Filename of dumped script: c-barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:26,622 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:26,622 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:26,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:26,696 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:26,696 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:26,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:26,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:26,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:26,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:45:26,718 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:26,718 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:26,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:26,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:26,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:26,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:26,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-17 22:45:26,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:26,750 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:26,838 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:26,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-17 22:45:26,843 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:26,843 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:26,843 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:26,843 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:26,843 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:26,843 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:26,843 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:26,843 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:26,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: c-barrier-2t.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:26,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:26,843 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:26,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:26,884 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:26,887 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:26,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:26,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:26,890 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:26,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-17 22:45:26,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:26,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:26,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:26,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:26,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:26,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:26,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:26,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:26,918 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:26,923 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:26,923 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:26,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:26,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:26,926 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:26,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-17 22:45:26,927 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:26,927 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:26,928 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:26,928 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z, x1) = -1*x4 + 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:45:26,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:26,935 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:26,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:26,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:26,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:26,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:26,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:26,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:26,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:26,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:26,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:26,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:26,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:26,979 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:26,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:26,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:45:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:27,059 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:45:27,072 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 123 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:27,220 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 123 states, but on-demand construction may add more states. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 380 states and 841 transitions. Complement of second has 7 states. [2025-02-17 22:45:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-02-17 22:45:27,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 95 transitions. Stem has 2 letters. Loop has 3 letters. [2025-02-17 22:45:27,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:27,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 95 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:45:27,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:27,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 95 transitions. Stem has 2 letters. Loop has 6 letters. [2025-02-17 22:45:27,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:27,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 380 states and 841 transitions. [2025-02-17 22:45:27,242 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 60 [2025-02-17 22:45:27,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 380 states to 238 states and 544 transitions. [2025-02-17 22:45:27,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-02-17 22:45:27,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2025-02-17 22:45:27,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 238 states and 544 transitions. [2025-02-17 22:45:27,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:27,248 INFO L218 hiAutomatonCegarLoop]: Abstraction has 238 states and 544 transitions. [2025-02-17 22:45:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states and 544 transitions. [2025-02-17 22:45:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 207. [2025-02-17 22:45:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 207 states have (on average 2.2946859903381642) internal successors, (475), 206 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 475 transitions. [2025-02-17 22:45:27,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 207 states and 475 transitions. [2025-02-17 22:45:27,291 INFO L432 stractBuchiCegarLoop]: Abstraction has 207 states and 475 transitions. [2025-02-17 22:45:27,291 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:45:27,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 207 states and 475 transitions. [2025-02-17 22:45:27,294 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 60 [2025-02-17 22:45:27,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:27,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:27,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:45:27,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:27,297 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[94] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[97] L13-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-02-17 22:45:27,298 INFO L754 eck$LassoCheckResult]: Loop: "[82] L39-->L41: Formula: (< (+ v_x5_5 v_x3_5) v_z_6) InVars {x5=v_x5_5, x3=v_x3_5, z=v_z_6} OutVars{x5=v_x5_5, x3=v_x3_5, z=v_z_6} AuxVars[] AssignedVars[]" "[84] L41-->L42: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" "[86] L42-->L39: Formula: (= v_x5_6 (+ v_x5_7 1)) InVars {x5=v_x5_7} OutVars{x5=v_x5_6} AuxVars[] AssignedVars[x5]" [2025-02-17 22:45:27,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash 96228, now seen corresponding path program 1 times [2025-02-17 22:45:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:27,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467422480] [2025-02-17 22:45:27,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:27,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:27,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:27,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:27,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:27,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:27,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:27,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash 111283, now seen corresponding path program 1 times [2025-02-17 22:45:27,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:27,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533756346] [2025-02-17 22:45:27,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:27,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:27,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:27,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:27,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:27,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:27,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:27,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:27,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:27,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1428157456, now seen corresponding path program 1 times [2025-02-17 22:45:27,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:27,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491666867] [2025-02-17 22:45:27,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:27,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:27,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:27,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:27,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:27,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:27,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:27,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:27,342 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:27,342 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:27,342 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:27,342 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:27,342 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:27,342 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,342 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:27,342 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:27,342 INFO L132 ssoRankerPreferences]: Filename of dumped script: c-barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:27,342 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:27,342 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:27,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:27,365 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:27,365 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:27,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:27,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:27,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-17 22:45:27,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:27,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:27,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:45:27,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:27,439 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:27,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-17 22:45:27,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:27,440 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:27,521 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:27,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:45:27,526 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:27,527 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:27,527 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:27,527 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:27,527 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:27,527 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,527 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:27,527 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:27,527 INFO L132 ssoRankerPreferences]: Filename of dumped script: c-barrier-2t.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:27,527 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:27,527 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:27,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:27,559 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:27,559 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:27,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:27,562 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:27,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-17 22:45:27,564 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:27,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:27,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:27,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:27,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:27,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:27,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:27,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:27,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:27,582 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:27,582 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:27,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:27,584 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:27,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-17 22:45:27,586 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:27,586 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:27,586 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:27,586 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, x3, z) = -1*x5 - 1*x3 + 1*z Supporting invariants [] [2025-02-17 22:45:27,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:45:27,593 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:27,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:27,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:27,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:27,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:27,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:27,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:27,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:27,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:27,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:27,619 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:27,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:27,652 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:45:27,652 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 207 states and 475 transitions. cyclomatic complexity: 303 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:27,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 207 states and 475 transitions. cyclomatic complexity: 303. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 615 states and 1462 transitions. Complement of second has 7 states. [2025-02-17 22:45:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-02-17 22:45:27,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 98 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-17 22:45:27,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:27,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 98 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-17 22:45:27,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:27,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 98 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-17 22:45:27,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:27,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 615 states and 1462 transitions. [2025-02-17 22:45:27,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-17 22:45:27,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 615 states to 12 states and 14 transitions. [2025-02-17 22:45:27,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-02-17 22:45:27,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-02-17 22:45:27,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2025-02-17 22:45:27,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:27,751 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-02-17 22:45:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2025-02-17 22:45:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-17 22:45:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-02-17 22:45:27,752 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-02-17 22:45:27,752 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-02-17 22:45:27,752 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:45:27,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2025-02-17 22:45:27,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-02-17 22:45:27,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:27,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:27,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:27,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:45:27,753 INFO L752 eck$LassoCheckResult]: Stem: "[66] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[94] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[70] L22-->L27: Formula: (<= v_z_3 (+ v_x4_4 v_x1_4)) InVars {x4=v_x4_4, x1=v_x1_4, z=v_z_3} OutVars{x4=v_x4_4, x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[72] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[74] L28-->L29-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-02-17 22:45:27,753 INFO L754 eck$LassoCheckResult]: Loop: "[77] L29-1-->L31: Formula: (< (+ v_x5_2 v_x3_2) v_z_4) InVars {x5=v_x5_2, x3=v_x3_2, z=v_z_4} OutVars{x5=v_x5_2, x3=v_x3_2, z=v_z_4} AuxVars[] AssignedVars[]" "[79] L31-->L32: Formula: (= (+ v_x3_4 1) v_x3_3) InVars {x3=v_x3_4} OutVars{x3=v_x3_3} AuxVars[] AssignedVars[x3]" "[80] L32-->L29-1: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-02-17 22:45:27,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:27,754 INFO L85 PathProgramCache]: Analyzing trace with hash 92451467, now seen corresponding path program 1 times [2025-02-17 22:45:27,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:27,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742237045] [2025-02-17 22:45:27,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:27,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:27,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:27,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:27,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:27,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:45:27,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742237045] [2025-02-17 22:45:27,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742237045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:45:27,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:45:27,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:45:27,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523876762] [2025-02-17 22:45:27,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:45:27,798 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:45:27,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash 106317, now seen corresponding path program 1 times [2025-02-17 22:45:27,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:27,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559854202] [2025-02-17 22:45:27,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:27,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:27,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:27,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:27,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:27,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:27,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:27,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:27,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:27,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:27,819 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:27,819 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:27,819 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:27,819 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:27,819 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:27,819 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,819 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:27,819 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:27,819 INFO L132 ssoRankerPreferences]: Filename of dumped script: c-barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:45:27,819 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:27,819 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:27,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:27,841 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:27,842 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:27,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:27,850 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:27,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-17 22:45:27,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:27,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:27,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:45:27,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:27,876 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:27,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-17 22:45:27,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:27,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:27,975 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:27,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-17 22:45:27,979 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:27,979 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:27,979 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:27,979 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:27,979 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:27,980 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:27,980 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:27,980 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:27,980 INFO L132 ssoRankerPreferences]: Filename of dumped script: c-barrier-2t.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:45:27,980 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:27,980 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:27,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:28,012 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:28,012 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:28,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,014 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:28,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-17 22:45:28,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:28,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:28,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:28,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:28,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:28,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:28,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:28,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:28,030 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:28,033 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:28,033 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:28,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:28,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:28,035 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:28,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-17 22:45:28,038 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:28,038 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:28,038 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:28,038 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, x3, z) = -1*x5 - 1*x3 + 1*z Supporting invariants [] [2025-02-17 22:45:28,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:45:28,045 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:28,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:28,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:28,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:28,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:28,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:28,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:28,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:28,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:28,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:28,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:28,081 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:45:28,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:28,106 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:45:28,106 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:28,118 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 18 transitions. Complement of second has 6 states. [2025-02-17 22:45:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2025-02-17 22:45:28,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:45:28,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:28,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:45:28,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:28,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-17 22:45:28,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:28,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2025-02-17 22:45:28,120 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:28,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2025-02-17 22:45:28,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:45:28,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:45:28,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:45:28,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:45:28,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:28,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:45:28,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:45:28,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:45:28,122 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:45:28,124 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-02-17 22:45:28,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-02-17 22:45:28,124 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:28,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-02-17 22:45:28,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:45:28,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:45:28,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:45:28,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:45:28,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:28,124 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:28,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-17 22:45:28,126 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:28,126 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:45:28,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:45:28,126 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:28,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:45:28,131 INFO L201 PluginConnector]: Adding new model c-barrier-2t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:45:28 BoogieIcfgContainer [2025-02-17 22:45:28,131 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:45:28,133 INFO L158 Benchmark]: Toolchain (without parser) took 2081.19ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 83.3MB in the beginning and 48.6MB in the end (delta: 34.7MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2025-02-17 22:45:28,133 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:28,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.31ms. Allocated memory is still 155.2MB. Free memory was 83.3MB in the beginning and 82.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:28,133 INFO L158 Benchmark]: Boogie Preprocessor took 10.40ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 81.5MB in the end (delta: 553.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:28,134 INFO L158 Benchmark]: RCFGBuilder took 189.40ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 72.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:45:28,134 INFO L158 Benchmark]: BuchiAutomizer took 1862.42ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 72.1MB in the beginning and 48.6MB in the end (delta: 23.5MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. [2025-02-17 22:45:28,135 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.31ms. Allocated memory is still 155.2MB. Free memory was 83.3MB in the beginning and 82.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 10.40ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 81.5MB in the end (delta: 553.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 189.40ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 72.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1862.42ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 72.1MB in the beginning and 48.6MB in the end (delta: 23.5MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + -1 * x1 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 31 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 61 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf93 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:45:28,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:45:28,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:28,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...