/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/4_plus_thr/me1.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:26:02,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:26:02,821 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:26:02,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:26:02,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:26:02,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:26:02,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:26:02,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:26:02,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:26:02,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:26:02,852 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:26:02,853 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:26:02,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:26:02,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:26:02,854 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:26:02,854 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:26:02,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:26:02,854 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:26:02,854 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:26:02,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:26:02,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:26:02,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:26:02,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:26:02,854 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:26:02,854 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:26:03,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:26:03,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:26:03,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:26:03,074 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:26:03,074 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:26:03,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/me1.c.bpl [2025-04-26 16:26:03,075 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/me1.c.bpl' [2025-04-26 16:26:03,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:26:03,089 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:26:03,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:26:03,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:26:03,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:26:03,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/1) ... [2025-04-26 16:26:03,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/1) ... [2025-04-26 16:26:03,124 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:26:03,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:26:03,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:26:03,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:26:03,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:26:03,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/1) ... [2025-04-26 16:26:03,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/1) ... [2025-04-26 16:26:03,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/1) ... [2025-04-26 16:26:03,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/1) ... [2025-04-26 16:26:03,136 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/1) ... [2025-04-26 16:26:03,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/1) ... [2025-04-26 16:26:03,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/1) ... [2025-04-26 16:26:03,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/1) ... [2025-04-26 16:26:03,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/1) ... [2025-04-26 16:26:03,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:26:03,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:26:03,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:26:03,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:26:03,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/1) ... [2025-04-26 16:26:03,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,172 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:26:03,177 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:26:03,199 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:26:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:26:03,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:26:03,200 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:26:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:26:03,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:26:03,200 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:26:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:26:03,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:26:03,200 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:26:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:26:03,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:26:03,200 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:26:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:26:03,200 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:26:03,201 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:26:03,238 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:26:03,239 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:26:03,302 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:26:03,302 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:26:03,309 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:26:03,309 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:26:03,309 INFO L201 PluginConnector]: Adding new model me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:26:03 BoogieIcfgContainer [2025-04-26 16:26:03,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:26:03,310 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:26:03,310 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:26:03,314 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:26:03,315 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:26:03,315 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:03" (1/2) ... [2025-04-26 16:26:03,316 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aa2a6db and model type me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:26:03, skipping insertion in model container [2025-04-26 16:26:03,316 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:26:03,317 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:26:03" (2/2) ... [2025-04-26 16:26:03,317 INFO L376 chiAutomizerObserver]: Analyzing ICFG me1.c.bpl [2025-04-26 16:26:03,376 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:26:03,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 104 flow [2025-04-26 16:26:03,437 INFO L116 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-04-26 16:26:03,438 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:26:03,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 4/30 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 67 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-04-26 16:26:03,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 104 flow [2025-04-26 16:26:03,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 84 flow [2025-04-26 16:26:03,445 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 39 places, 30 transitions, 84 flow [2025-04-26 16:26:03,453 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:26:03,453 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:26:03,453 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:26:03,454 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:26:03,454 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:26:03,455 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:26:03,455 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:26:03,455 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:26:03,456 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:26:03,627 INFO L131 ngComponentsAnalysis]: Automaton has 265 accepting balls. 776 [2025-04-26 16:26:03,627 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:03,627 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:03,630 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:26:03,630 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:03,631 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:26:03,631 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 938 states, but on-demand construction may add more states [2025-04-26 16:26:03,646 INFO L131 ngComponentsAnalysis]: Automaton has 265 accepting balls. 776 [2025-04-26 16:26:03,646 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:03,646 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:03,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:26:03,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:03,651 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:26:03,651 INFO L754 eck$LassoCheckResult]: Loop: "[75] L27-->L29: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[77] L29-->L27: 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:26:03,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash 3165, now seen corresponding path program 1 times [2025-04-26 16:26:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641103723] [2025-04-26 16:26:03,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2025-04-26 16:26:03,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875831898] [2025-04-26 16:26:03,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,735 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,738 INFO L85 PathProgramCache]: Analyzing trace with hash 3043967, now seen corresponding path program 1 times [2025-04-26 16:26:03,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528454511] [2025-04-26 16:26:03,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:03,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:03,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:03,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:03,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,788 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:03,789 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:03,789 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:03,789 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:03,789 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:03,789 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,789 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:03,789 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:03,790 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:26:03,790 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:03,790 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:03,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:03,834 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:03,834 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:03,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,838 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:26:03,840 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:26:03,841 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:03,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:03,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:26:03,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,862 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:26:03,864 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:26:03,866 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:03,866 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:03,934 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:03,938 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:26:03,938 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:03,938 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:03,938 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:03,938 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:03,938 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:03,938 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,938 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:03,939 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:03,939 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:26:03,939 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:03,939 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:03,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:03,964 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:03,967 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:03,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,970 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:26:03,976 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:26:03,977 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:26:03,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:03,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:03,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:03,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:03,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:03,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:03,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:03,998 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:04,003 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:04,003 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:04,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:04,006 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:26:04,008 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:26:04,009 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:04,012 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:26:04,013 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:04,013 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:04,014 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 16:26:04,018 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:26:04,021 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:04,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:04,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:04,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:04,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:04,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:04,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:04,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:04,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:04,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:04,088 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:04,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:04,111 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:26:04,151 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:26:04,158 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 938 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:26:04,383 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 938 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 3278 states and 13498 transitions. Complement of second has 7 states. [2025-04-26 16:26:04,385 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:26:04,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:26:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 16:26:04,395 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:26:04,396 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:04,396 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:26:04,396 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:04,396 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:26:04,396 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:04,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3278 states and 13498 transitions. [2025-04-26 16:26:04,456 INFO L131 ngComponentsAnalysis]: Automaton has 455 accepting balls. 1190 [2025-04-26 16:26:04,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3278 states to 2441 states and 10158 transitions. [2025-04-26 16:26:04,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1548 [2025-04-26 16:26:04,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2010 [2025-04-26 16:26:04,512 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2441 states and 10158 transitions. [2025-04-26 16:26:04,514 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:04,514 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2441 states and 10158 transitions. [2025-04-26 16:26:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states and 10158 transitions. [2025-04-26 16:26:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 1536. [2025-04-26 16:26:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1536 states have (on average 4.323567708333333) internal successors, (in total 6641), 1535 states have internal predecessors, (6641), 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:26:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 6641 transitions. [2025-04-26 16:26:04,626 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1536 states and 6641 transitions. [2025-04-26 16:26:04,626 INFO L438 stractBuchiCegarLoop]: Abstraction has 1536 states and 6641 transitions. [2025-04-26 16:26:04,626 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:26:04,626 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1536 states and 6641 transitions. [2025-04-26 16:26:04,640 INFO L131 ngComponentsAnalysis]: Automaton has 323 accepting balls. 892 [2025-04-26 16:26:04,641 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:04,641 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:04,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:26:04,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:04,642 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: 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]" "[102] L15-->L47: 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:26:04,642 INFO L754 eck$LassoCheckResult]: Loop: "[85] L47-->L49: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[87] L49-->L47: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:26:04,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash 3044736, now seen corresponding path program 1 times [2025-04-26 16:26:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:04,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737189045] [2025-04-26 16:26:04,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:04,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:04,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:04,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:04,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:04,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:04,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:04,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:04,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:04,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:04,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:04,651 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2025-04-26 16:26:04,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:04,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17975410] [2025-04-26 16:26:04,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:04,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:04,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:04,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:04,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:04,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:04,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:04,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:04,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:04,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:04,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1368973278, now seen corresponding path program 1 times [2025-04-26 16:26:04,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:04,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999765674] [2025-04-26 16:26:04,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:04,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:04,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:04,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:04,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:04,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:04,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:04,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:04,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:04,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:04,719 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:04,720 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:04,720 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:04,720 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:04,720 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:04,720 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,720 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:04,720 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:04,720 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:26:04,720 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:04,720 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:04,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:04,740 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:04,741 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:04,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:04,744 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:26:04,745 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:26:04,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:04,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:04,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:04,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:04,766 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:26:04,766 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:26:04,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:04,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:04,834 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:04,838 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:26:04,838 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:04,838 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:04,838 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:04,838 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:04,838 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:04,838 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,839 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:04,839 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:04,839 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:26:04,839 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:04,839 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:04,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:04,859 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:04,859 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:04,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:04,862 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:26:04,863 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:26:04,864 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:26:04,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:04,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:04,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:04,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:04,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:04,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:04,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:04,877 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:04,881 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:04,882 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:04,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:04,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:04,884 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:26:04,886 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:26:04,886 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:04,889 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:26:04,890 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:26:04,890 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:04,890 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:04,890 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:26:04,896 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:26:04,897 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:04,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:04,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:04,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:04,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:04,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:04,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:04,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:04,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:04,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:04,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:04,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:04,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:04,943 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:26:04,943 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:26:04,944 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1536 states and 6641 transitions. cyclomatic complexity: 5522 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:26:05,081 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1536 states and 6641 transitions. cyclomatic complexity: 5522. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 5464 states and 24533 transitions. Complement of second has 7 states. [2025-04-26 16:26:05,082 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:26:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:26:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-04-26 16:26:05,083 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:26:05,083 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:05,083 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:26:05,083 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:05,083 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:26:05,083 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:05,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5464 states and 24533 transitions. [2025-04-26 16:26:05,200 INFO L131 ngComponentsAnalysis]: Automaton has 434 accepting balls. 1128 [2025-04-26 16:26:05,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5464 states to 4103 states and 18515 transitions. [2025-04-26 16:26:05,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1977 [2025-04-26 16:26:05,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2621 [2025-04-26 16:26:05,256 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4103 states and 18515 transitions. [2025-04-26 16:26:05,256 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:05,256 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4103 states and 18515 transitions. [2025-04-26 16:26:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states and 18515 transitions. [2025-04-26 16:26:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 2923. [2025-04-26 16:26:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2923 states have (on average 4.707492302429011) internal successors, (in total 13760), 2922 states have internal predecessors, (13760), 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:26:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 13760 transitions. [2025-04-26 16:26:05,362 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2923 states and 13760 transitions. [2025-04-26 16:26:05,363 INFO L438 stractBuchiCegarLoop]: Abstraction has 2923 states and 13760 transitions. [2025-04-26 16:26:05,363 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:26:05,363 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2923 states and 13760 transitions. [2025-04-26 16:26:05,409 INFO L131 ngComponentsAnalysis]: Automaton has 350 accepting balls. 936 [2025-04-26 16:26:05,409 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:05,409 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:05,409 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:26:05,410 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:05,410 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: 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]" "[74] L27-->L31: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[79] $Ultimate##0-->L38-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:26:05,410 INFO L754 eck$LassoCheckResult]: Loop: "[81] L38-1-->L40: Formula: (< v_y1_1 v_x1_5) InVars {y1=v_y1_1, x1=v_x1_5} OutVars{y1=v_y1_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[83] L40-->L38-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 16:26:05,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:05,410 INFO L85 PathProgramCache]: Analyzing trace with hash 94386027, now seen corresponding path program 1 times [2025-04-26 16:26:05,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:05,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471449643] [2025-04-26 16:26:05,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:05,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:05,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:05,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:05,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:05,455 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:26:05,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:26:05,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471449643] [2025-04-26 16:26:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471449643] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:26:05,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:26:05,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:26:05,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765408941] [2025-04-26 16:26:05,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:26:05,460 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:26:05,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:05,460 INFO L85 PathProgramCache]: Analyzing trace with hash 3555, now seen corresponding path program 1 times [2025-04-26 16:26:05,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:05,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647701438] [2025-04-26 16:26:05,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:05,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:05,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:05,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:05,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:05,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:05,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:05,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:05,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:05,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:05,488 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:05,489 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:05,489 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:05,489 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:05,489 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:05,489 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,489 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:05,489 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:05,489 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:05,489 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:05,489 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:05,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:05,509 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:05,509 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:05,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:05,513 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:26:05,515 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:26:05,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:05,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:05,534 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:26:05,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:05,536 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:26:05,537 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:26:05,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:05,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:05,612 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:05,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:05,618 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:05,618 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:05,618 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:05,618 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:05,618 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:05,618 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,618 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:05,618 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:05,618 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:05,618 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:05,618 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:05,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:05,638 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:05,638 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:05,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:05,642 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:26:05,643 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:26:05,645 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:26:05,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:05,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:05,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:05,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:05,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:05,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:05,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:05,659 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:05,661 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:26:05,661 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:26:05,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:05,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:05,664 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:26:05,665 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:26:05,666 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:05,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:05,669 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:05,669 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:05,669 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, x1) = -1*y1 + 1*x1 Supporting invariants [] [2025-04-26 16:26:05,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:05,675 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:05,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:05,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:05,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:05,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:05,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:05,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:05,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:05,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:05,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:05,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:05,703 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:05,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:05,716 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:26:05,717 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:26:05,717 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2923 states and 13760 transitions. cyclomatic complexity: 11498 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:26:05,901 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2923 states and 13760 transitions. cyclomatic complexity: 11498. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 9957 states and 47092 transitions. Complement of second has 7 states. [2025-04-26 16:26:05,902 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:26:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:26:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-04-26 16:26:05,903 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:26:05,903 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:05,903 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:26:05,903 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:05,903 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:26:05,903 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:05,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9957 states and 47092 transitions. [2025-04-26 16:26:06,040 INFO L131 ngComponentsAnalysis]: Automaton has 549 accepting balls. 1400 [2025-04-26 16:26:06,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9957 states to 7592 states and 35648 transitions. [2025-04-26 16:26:06,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3023 [2025-04-26 16:26:06,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3796 [2025-04-26 16:26:06,241 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7592 states and 35648 transitions. [2025-04-26 16:26:06,241 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:06,241 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7592 states and 35648 transitions. [2025-04-26 16:26:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7592 states and 35648 transitions. [2025-04-26 16:26:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7592 to 4940. [2025-04-26 16:26:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4940 states, 4940 states have (on average 4.979959514170041) internal successors, (in total 24601), 4939 states have internal predecessors, (24601), 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:26:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4940 states to 4940 states and 24601 transitions. [2025-04-26 16:26:06,394 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4940 states and 24601 transitions. [2025-04-26 16:26:06,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:26:06,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:26:06,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:26:06,397 INFO L87 Difference]: Start difference. First operand 4940 states and 24601 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 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:26:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:26:06,484 INFO L93 Difference]: Finished difference Result 1542 states and 6767 transitions. [2025-04-26 16:26:06,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1542 states and 6767 transitions. [2025-04-26 16:26:06,505 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 268 [2025-04-26 16:26:06,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1542 states to 1454 states and 6443 transitions. [2025-04-26 16:26:06,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 712 [2025-04-26 16:26:06,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 712 [2025-04-26 16:26:06,525 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1454 states and 6443 transitions. [2025-04-26 16:26:06,525 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:06,525 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1454 states and 6443 transitions. [2025-04-26 16:26:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states and 6443 transitions. [2025-04-26 16:26:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2025-04-26 16:26:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1454 states have (on average 4.431224209078405) internal successors, (in total 6443), 1453 states have internal predecessors, (6443), 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:26:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 6443 transitions. [2025-04-26 16:26:06,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1454 states and 6443 transitions. [2025-04-26 16:26:06,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:26:06,592 INFO L438 stractBuchiCegarLoop]: Abstraction has 1454 states and 6443 transitions. [2025-04-26 16:26:06,592 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:26:06,592 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1454 states and 6443 transitions. [2025-04-26 16:26:06,605 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 268 [2025-04-26 16:26:06,605 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:06,605 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:06,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:26:06,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:06,609 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: 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]" "[102] L15-->L47: 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]" "[84] L47-->L51: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[105] L16-->$Ultimate##0: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[89] $Ultimate##0-->L58-1: Formula: (< 0 v_g_4) InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" [2025-04-26 16:26:06,613 INFO L754 eck$LassoCheckResult]: Loop: "[91] L58-1-->L60: Formula: (< v_y2_1 v_x2_5) InVars {y2=v_y2_1, x2=v_x2_5} OutVars{y2=v_y2_1, x2=v_x2_5} AuxVars[] AssignedVars[]" "[93] L60-->L58-1: Formula: (= v_x2_7 (+ v_x2_6 1)) InVars {x2=v_x2_7} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[x2]" [2025-04-26 16:26:06,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash 511501028, now seen corresponding path program 1 times [2025-04-26 16:26:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:06,613 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262520263] [2025-04-26 16:26:06,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:06,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:06,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:26:06,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:26:06,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:06,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:06,647 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:26:06,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:26:06,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262520263] [2025-04-26 16:26:06,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262520263] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:26:06,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:26:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:26:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034889253] [2025-04-26 16:26:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:26:06,648 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:26:06,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:06,648 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 1 times [2025-04-26 16:26:06,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:06,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274471345] [2025-04-26 16:26:06,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:06,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:06,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:06,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:06,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:06,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:06,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:06,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:06,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:06,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:06,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:06,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:06,681 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:06,681 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:06,681 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:06,681 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:06,681 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:06,681 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:06,681 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:06,681 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:06,681 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:26:06,681 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:06,681 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:06,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:06,699 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:06,699 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:06,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:06,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:06,710 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:26:06,712 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:26:06,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:06,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:06,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:06,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:06,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:06,742 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:26:06,754 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:26:06,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:06,755 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:06,847 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:06,851 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:26:06,851 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:06,851 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:06,851 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:06,851 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:06,851 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:06,851 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:06,851 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:06,851 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:06,851 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:26:06,851 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:06,851 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:06,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:06,867 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:06,867 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:06,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:06,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:06,869 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:26:06,871 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:26:06,872 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:26:06,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:06,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:06,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:06,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:06,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:06,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:06,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:06,886 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:06,891 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:06,891 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:06,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:06,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:06,894 INFO L229 MonitoredProcess]: Starting monitored process 17 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:26:06,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:26:06,896 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:06,899 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:26:06,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:06,900 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:06,900 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:06,900 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = -1*y2 + 1*x2 Supporting invariants [] [2025-04-26 16:26:06,906 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:26:06,907 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:06,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:06,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:26:06,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:26:06,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:06,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:06,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:06,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:06,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:06,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:06,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:06,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:06,946 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:06,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:06,962 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:26:06,962 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:26:06,962 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1454 states and 6443 transitions. cyclomatic complexity: 5279 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:26:07,061 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1454 states and 6443 transitions. cyclomatic complexity: 5279. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 4290 states and 18372 transitions. Complement of second has 7 states. [2025-04-26 16:26:07,061 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:26:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:26:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-04-26 16:26:07,063 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:26:07,063 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:07,063 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:26:07,063 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:07,063 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:26:07,063 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:07,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4290 states and 18372 transitions. [2025-04-26 16:26:07,095 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 268 [2025-04-26 16:26:07,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4290 states to 2512 states and 10573 transitions. [2025-04-26 16:26:07,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 917 [2025-04-26 16:26:07,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1048 [2025-04-26 16:26:07,116 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2512 states and 10573 transitions. [2025-04-26 16:26:07,116 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:07,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2512 states and 10573 transitions. [2025-04-26 16:26:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states and 10573 transitions. [2025-04-26 16:26:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1695. [2025-04-26 16:26:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1695 states have (on average 4.411209439528023) internal successors, (in total 7477), 1694 states have internal predecessors, (7477), 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:26:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 7477 transitions. [2025-04-26 16:26:07,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1695 states and 7477 transitions. [2025-04-26 16:26:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:26:07,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:26:07,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:26:07,151 INFO L87 Difference]: Start difference. First operand 1695 states and 7477 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 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:26:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:26:07,177 INFO L93 Difference]: Finished difference Result 373 states and 1341 transitions. [2025-04-26 16:26:07,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 1341 transitions. [2025-04-26 16:26:07,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:26:07,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 0 states and 0 transitions. [2025-04-26 16:26:07,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:26:07,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:26:07,179 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:26:07,179 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:26:07,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:07,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:07,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:26:07,181 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:07,181 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:26:07,181 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:26:07,181 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:26:07,182 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:26:07,188 INFO L201 PluginConnector]: Adding new model me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:26:07 BoogieIcfgContainer [2025-04-26 16:26:07,188 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:26:07,189 INFO L158 Benchmark]: Toolchain (without parser) took 4099.67ms. Allocated memory was 155.2MB in the beginning and 637.5MB in the end (delta: 482.3MB). Free memory was 84.6MB in the beginning and 505.7MB in the end (delta: -421.1MB). Peak memory consumption was 60.6MB. Max. memory is 8.0GB. [2025-04-26 16:26:07,189 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:26:07,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.99ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 82.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:26:07,189 INFO L158 Benchmark]: Boogie Preprocessor took 19.40ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 81.6MB in the end (delta: 896.1kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:26:07,189 INFO L158 Benchmark]: RCFGBuilder took 161.92ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 72.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:26:07,190 INFO L158 Benchmark]: BuchiAutomizer took 3878.01ms. Allocated memory was 155.2MB in the beginning and 637.5MB in the end (delta: 482.3MB). Free memory was 72.3MB in the beginning and 505.7MB in the end (delta: -433.4MB). Peak memory consumption was 48.0MB. Max. memory is 8.0GB. [2025-04-26 16:26:07,190 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.17ms. Allocated memory is still 155.2MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.99ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 82.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.40ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 81.6MB in the end (delta: 896.1kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 161.92ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 72.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3878.01ms. Allocated memory was 155.2MB in the beginning and 637.5MB in the end (delta: 482.3MB). Free memory was 72.3MB in the beginning and 505.7MB in the end (delta: -433.4MB). Peak memory consumption was 48.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.5s AutomataMinimizationTime, 5 MinimizatonAttempts, 5554 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 355 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 213 IncrementalHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 182 mSDtfsCounter, 213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 45ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y1 + x1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:26:07,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...