/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/3_thr/indep_loops_minus1_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:36,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:36,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:24:36,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:36,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:36,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:36,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:36,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:36,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:36,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:36,288 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:36,288 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:36,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:36,289 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:36,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:36,290 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:36,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:36,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:36,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:36,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:36,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:36,290 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:36,290 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:36,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:36,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:36,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:36,542 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:36,542 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:36,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/indep_loops_minus1_3.c.bpl [2025-04-26 16:24:36,544 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/indep_loops_minus1_3.c.bpl' [2025-04-26 16:24:36,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:36,561 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:36,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:36,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:36,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:36,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/1) ... [2025-04-26 16:24:36,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/1) ... [2025-04-26 16:24:36,598 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:36,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:36,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:36,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:36,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:36,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/1) ... [2025-04-26 16:24:36,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/1) ... [2025-04-26 16:24:36,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/1) ... [2025-04-26 16:24:36,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/1) ... [2025-04-26 16:24:36,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/1) ... [2025-04-26 16:24:36,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/1) ... [2025-04-26 16:24:36,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/1) ... [2025-04-26 16:24:36,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/1) ... [2025-04-26 16:24:36,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/1) ... [2025-04-26 16:24:36,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:36,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:36,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:36,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:36,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/1) ... [2025-04-26 16:24:36,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,642 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-04-26 16:24:36,646 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-04-26 16:24:36,668 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:36,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:36,669 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:36,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:36,669 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:24:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:24:36,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:24:36,670 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:36,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:36,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:36,670 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:24:36,708 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:36,710 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:36,781 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:36,781 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:36,791 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:36,791 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:36,791 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:36 BoogieIcfgContainer [2025-04-26 16:24:36,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:36,792 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:36,792 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:36,798 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:36,798 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:36,798 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:36" (1/2) ... [2025-04-26 16:24:36,800 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b46b914 and model type indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:36, skipping insertion in model container [2025-04-26 16:24:36,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:36,800 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:36" (2/2) ... [2025-04-26 16:24:36,801 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_3.c.bpl [2025-04-26 16:24:36,859 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:24:36,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 73 flow [2025-04-26 16:24:36,918 INFO L116 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-04-26 16:24:36,920 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:24:36,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 3/20 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-26 16:24:36,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 26 transitions, 73 flow [2025-04-26 16:24:36,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 20 transitions, 58 flow [2025-04-26 16:24:36,934 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 27 places, 20 transitions, 58 flow [2025-04-26 16:24:36,944 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:36,944 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:36,944 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:36,944 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:36,944 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:36,944 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:36,944 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:36,944 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:36,946 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:37,005 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 108 [2025-04-26 16:24:37,006 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:37,006 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:37,010 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:37,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:37,011 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:37,012 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 130 states, but on-demand construction may add more states [2025-04-26 16:24:37,018 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 108 [2025-04-26 16:24:37,018 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:37,018 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:37,018 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:37,018 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:37,022 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:37,023 INFO L754 eck$LassoCheckResult]: Loop: "[50] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[52] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:37,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash 95, now seen corresponding path program 1 times [2025-04-26 16:24:37,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:37,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942158794] [2025-04-26 16:24:37,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:37,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:37,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:37,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:37,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:37,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:37,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:37,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:37,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:37,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:37,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2025-04-26 16:24:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:37,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571387643] [2025-04-26 16:24:37,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:37,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:37,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:37,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:37,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:37,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:37,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:37,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:37,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:37,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:37,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:37,118 INFO L85 PathProgramCache]: Analyzing trace with hash 92897, now seen corresponding path program 1 times [2025-04-26 16:24:37,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:37,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080300723] [2025-04-26 16:24:37,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:37,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:37,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:37,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:37,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:37,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:37,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:37,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:37,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:37,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:37,178 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:37,178 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:37,178 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:37,179 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:37,179 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:37,179 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:37,179 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:37,179 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:37,179 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:37,179 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:37,179 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:37,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:37,234 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:37,235 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:37,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:37,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:37,238 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-04-26 16:24:37,240 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-04-26 16:24:37,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:37,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:37,261 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-04-26 16:24:37,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:37,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:37,264 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-04-26 16:24:37,265 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-04-26 16:24:37,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:37,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:37,342 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:37,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:37,347 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:37,347 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:37,347 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:37,347 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:37,348 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:37,348 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:37,348 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:37,348 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:37,348 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:37,348 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:37,348 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:37,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:37,380 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:37,383 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:37,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:37,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:37,386 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-04-26 16:24:37,388 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-04-26 16:24:37,390 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-04-26 16:24:37,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:37,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:37,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:37,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:37,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:37,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:37,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:37,411 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:37,417 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:37,418 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:37,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:37,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:37,420 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-04-26 16:24:37,422 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-04-26 16:24:37,423 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:37,426 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:37,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:37,427 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:37,427 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:37,428 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:24:37,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:24:37,437 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:37,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:37,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:37,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:37,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:37,466 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:37,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:37,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:37,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:37,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:37,478 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:37,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:37,521 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-26 16:24:37,560 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:37,563 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 130 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:37,718 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 130 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 430 states and 1388 transitions. Complement of second has 6 states. [2025-04-26 16:24:37,720 INFO L140 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-04-26 16:24:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-26 16:24:37,732 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:24:37,733 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:37,733 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:37,733 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:37,733 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:24:37,733 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:37,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 1388 transitions. [2025-04-26 16:24:37,745 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 104 [2025-04-26 16:24:37,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 282 states and 914 transitions. [2025-04-26 16:24:37,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2025-04-26 16:24:37,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2025-04-26 16:24:37,754 INFO L74 IsDeterministic]: Start isDeterministic. Operand 282 states and 914 transitions. [2025-04-26 16:24:37,755 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:37,755 INFO L218 hiAutomatonCegarLoop]: Abstraction has 282 states and 914 transitions. [2025-04-26 16:24:37,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 914 transitions. [2025-04-26 16:24:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 213. [2025-04-26 16:24:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 213 states have (on average 3.323943661971831) internal successors, (in total 708), 212 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 708 transitions. [2025-04-26 16:24:37,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 213 states and 708 transitions. [2025-04-26 16:24:37,782 INFO L438 stractBuchiCegarLoop]: Abstraction has 213 states and 708 transitions. [2025-04-26 16:24:37,782 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:37,782 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 213 states and 708 transitions. [2025-04-26 16:24:37,785 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 104 [2025-04-26 16:24:37,785 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:37,785 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:37,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:37,786 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:24:37,786 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L12-->L32: 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-04-26 16:24:37,786 INFO L754 eck$LassoCheckResult]: Loop: "[54] L32-->L34: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[56] L34-->L35: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[57] L35-->L32: Formula: (= v_x1_5 (+ v_x1_6 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:37,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:37,786 INFO L85 PathProgramCache]: Analyzing trace with hash 3012, now seen corresponding path program 1 times [2025-04-26 16:24:37,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:37,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82707176] [2025-04-26 16:24:37,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:37,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:37,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:37,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:37,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:37,790 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:37,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:37,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:37,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:37,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:37,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash 83478, now seen corresponding path program 1 times [2025-04-26 16:24:37,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:37,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378781575] [2025-04-26 16:24:37,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:37,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:37,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:37,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:37,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:37,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:37,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:37,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:37,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:37,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:37,797 INFO L85 PathProgramCache]: Analyzing trace with hash 89784179, now seen corresponding path program 1 times [2025-04-26 16:24:37,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:37,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209571641] [2025-04-26 16:24:37,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:37,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:37,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:37,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:37,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:37,801 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:37,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:37,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:37,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:37,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:37,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:37,820 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:37,821 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:37,821 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:37,821 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:37,821 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:37,821 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:37,821 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:37,821 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:37,821 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:37,821 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:37,821 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:37,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:37,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:37,857 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:37,858 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:37,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:37,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:37,859 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-04-26 16:24:37,861 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-04-26 16:24:37,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:37,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:37,877 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-04-26 16:24:37,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:37,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:37,879 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-04-26 16:24:37,880 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-04-26 16:24:37,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:37,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:37,904 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:24:37,904 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=0} Honda state: {x1=0} Generalized eigenvectors: [{x1=7}, {x1=2}, {x1=-8}] Lambdas: [1, 5, 1] Nus: [0, 1] [2025-04-26 16:24:37,910 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-04-26 16:24:37,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:37,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:37,912 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-04-26 16:24:37,913 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-04-26 16:24:37,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:37,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:37,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:37,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:37,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:37,936 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-04-26 16:24:37,937 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-04-26 16:24:37,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:37,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:38,001 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:38,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:24:38,006 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:38,006 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:38,006 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:38,006 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:38,006 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:38,006 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,006 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:38,006 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:38,006 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:38,006 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:38,006 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:38,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:38,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:38,035 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:38,035 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:38,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,037 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-04-26 16:24:38,039 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-04-26 16:24:38,041 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-04-26 16:24:38,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:38,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:38,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:38,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:38,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:38,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:38,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:38,053 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:38,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:38,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,061 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-04-26 16:24:38,062 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-04-26 16:24:38,064 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-04-26 16:24:38,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:38,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:38,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:38,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:38,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:38,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:38,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:38,076 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:38,079 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:38,079 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:38,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,081 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-04-26 16:24:38,082 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-04-26 16:24:38,083 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:38,090 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-04-26 16:24:38,090 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:38,090 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:38,090 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:24:38,096 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-04-26 16:24:38,098 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:38,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:38,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:38,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:38,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:38,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:38,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:38,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:38,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:38,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:38,131 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:38,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:38,178 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-26 16:24:38,179 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-04-26 16:24:38,179 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 213 states and 708 transitions. cyclomatic complexity: 541 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:38,252 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 213 states and 708 transitions. cyclomatic complexity: 541. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 594 states and 2025 transitions. Complement of second has 6 states. [2025-04-26 16:24:38,253 INFO L140 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-04-26 16:24:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-26 16:24:38,253 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:24:38,254 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:38,254 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:24:38,254 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:38,254 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:24:38,254 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:38,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 594 states and 2025 transitions. [2025-04-26 16:24:38,264 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 62 [2025-04-26 16:24:38,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 594 states to 341 states and 1169 transitions. [2025-04-26 16:24:38,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2025-04-26 16:24:38,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2025-04-26 16:24:38,269 INFO L74 IsDeterministic]: Start isDeterministic. Operand 341 states and 1169 transitions. [2025-04-26 16:24:38,269 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:38,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 341 states and 1169 transitions. [2025-04-26 16:24:38,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states and 1169 transitions. [2025-04-26 16:24:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 300. [2025-04-26 16:24:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 300 states have (on average 3.506666666666667) internal successors, (in total 1052), 299 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 1052 transitions. [2025-04-26 16:24:38,290 INFO L240 hiAutomatonCegarLoop]: Abstraction has 300 states and 1052 transitions. [2025-04-26 16:24:38,290 INFO L438 stractBuchiCegarLoop]: Abstraction has 300 states and 1052 transitions. [2025-04-26 16:24:38,290 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:38,290 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 1052 transitions. [2025-04-26 16:24:38,292 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 62 [2025-04-26 16:24:38,292 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:38,292 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:38,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:38,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:38,293 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L12-->L32: 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]" "[70] L13-->L42: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:24:38,293 INFO L754 eck$LassoCheckResult]: Loop: "[59] L42-->L44: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[61] L44-->L42: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:24:38,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:38,293 INFO L85 PathProgramCache]: Analyzing trace with hash 93442, now seen corresponding path program 1 times [2025-04-26 16:24:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:38,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787489617] [2025-04-26 16:24:38,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:38,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:38,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:38,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:38,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:38,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:38,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:38,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:38,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:38,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2025-04-26 16:24:38,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:38,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078625379] [2025-04-26 16:24:38,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:38,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:38,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:38,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:38,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:38,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:38,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:38,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:38,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:38,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:38,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash 89799652, now seen corresponding path program 1 times [2025-04-26 16:24:38,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:38,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693316398] [2025-04-26 16:24:38,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:38,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:38,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:38,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:38,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:38,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:38,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:38,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:38,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:38,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:38,335 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:38,335 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:38,335 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:38,335 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:38,335 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:38,335 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,335 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:38,335 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:38,335 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:38,335 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:38,335 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:38,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:38,351 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:38,351 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:38,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,354 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-04-26 16:24:38,355 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-04-26 16:24:38,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:38,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:38,376 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-04-26 16:24:38,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,379 INFO L229 MonitoredProcess]: Starting monitored process 14 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-04-26 16:24:38,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:24:38,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:38,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:38,445 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:38,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:24:38,450 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:38,450 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:38,450 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:38,450 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:38,450 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:38,450 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,450 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:38,450 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:38,450 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:38,450 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:38,450 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:38,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:38,469 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:38,469 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:38,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,472 INFO L229 MonitoredProcess]: Starting monitored process 15 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-04-26 16:24:38,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:24:38,474 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-04-26 16:24:38,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:38,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:38,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:38,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:38,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:38,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:38,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:38,487 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:38,489 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:38,489 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:38,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:38,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:38,490 INFO L229 MonitoredProcess]: Starting monitored process 16 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-04-26 16:24:38,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:24:38,493 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:38,496 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:38,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:24:38,497 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:38,497 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:38,498 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:24:38,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:24:38,504 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:38,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:38,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:38,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:38,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:38,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:38,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:38,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:38,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:38,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:38,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:38,536 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:38,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:38,556 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-26 16:24:38,557 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:38,557 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 300 states and 1052 transitions. cyclomatic complexity: 812 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:38,621 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 300 states and 1052 transitions. cyclomatic complexity: 812. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 796 states and 2761 transitions. Complement of second has 6 states. [2025-04-26 16:24:38,621 INFO L140 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-04-26 16:24:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2025-04-26 16:24:38,623 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:38,623 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:38,624 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:38,624 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:38,624 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:24:38,624 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:38,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 796 states and 2761 transitions. [2025-04-26 16:24:38,638 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:38,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 796 states to 0 states and 0 transitions. [2025-04-26 16:24:38,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:38,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:38,638 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:38,638 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:38,638 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:38,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:38,639 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:38,639 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:38,639 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:38,639 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:38,639 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:38,646 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:38 BoogieIcfgContainer [2025-04-26 16:24:38,646 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:38,647 INFO L158 Benchmark]: Toolchain (without parser) took 2086.05ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 93.9MB in the beginning and 38.3MB in the end (delta: 55.6MB). Peak memory consumption was 45.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:38,647 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 167.8MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:38,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.30ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 92.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:38,648 INFO L158 Benchmark]: Boogie Preprocessor took 15.04ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 91.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:38,648 INFO L158 Benchmark]: RCFGBuilder took 176.21ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 82.3MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:38,648 INFO L158 Benchmark]: BuchiAutomizer took 1854.14ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 82.1MB in the beginning and 38.3MB in the end (delta: 43.9MB). Peak memory consumption was 32.8MB. Max. memory is 8.0GB. [2025-04-26 16:24:38,649 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.25ms. Allocated memory is still 167.8MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.30ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 92.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 15.04ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 91.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 176.21ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 82.3MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1854.14ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 82.1MB in the beginning and 38.3MB in the end (delta: 43.9MB). Peak memory consumption was 32.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 110 StatesRemovedByMinimization, 2 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, 93 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 43 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 43ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:38,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...