/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/pp5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:26:21,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:26:21,643 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:21,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:26:21,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:26:21,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:26:21,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:26:21,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:26:21,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:26:21,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:26:21,671 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:26:21,671 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:26:21,671 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:26:21,671 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:26:21,671 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:26:21,671 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:26:21,671 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:26:21,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:26:21,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:26:21,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:26:21,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:26:21,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:26:21,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:26:21,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:26:21,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:26:21,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:26:21,672 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:26:21,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:26:21,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:26:21,672 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:26:21,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:26:21,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:26:21,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:26:21,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:26:21,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:26:21,673 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:26:21,673 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:26:21,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:26:21,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:26:21,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:26:21,896 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:26:21,897 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:26:21,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/pp5.c.bpl [2025-04-26 16:26:21,898 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/pp5.c.bpl' [2025-04-26 16:26:21,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:26:21,919 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:26:21,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:26:21,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:26:21,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:26:21,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/1) ... [2025-04-26 16:26:21,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/1) ... [2025-04-26 16:26:21,954 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:26:21,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:26:21,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:26:21,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:26:21,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:26:21,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/1) ... [2025-04-26 16:26:21,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/1) ... [2025-04-26 16:26:21,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/1) ... [2025-04-26 16:26:21,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/1) ... [2025-04-26 16:26:21,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/1) ... [2025-04-26 16:26:21,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/1) ... [2025-04-26 16:26:21,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/1) ... [2025-04-26 16:26:21,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/1) ... [2025-04-26 16:26:21,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/1) ... [2025-04-26 16:26:21,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:26:21,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:26:21,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:26:21,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:26:21,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/1) ... [2025-04-26 16:26:21,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:22,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:22,012 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:22,016 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:22,038 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:26:22,038 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:26:22,038 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:26:22,038 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:26:22,038 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:26:22,038 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:26:22,038 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:26:22,038 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:26:22,039 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:26:22,039 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:26:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:26:22,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:26:22,039 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:26:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:26:22,039 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:26:22,039 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:26:22,039 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:26:22,039 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:26:22,040 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:22,083 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:26:22,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:26:22,174 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:26:22,174 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:26:22,182 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:26:22,182 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:26:22,183 INFO L201 PluginConnector]: Adding new model pp5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:26:22 BoogieIcfgContainer [2025-04-26 16:26:22,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:26:22,184 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:26:22,184 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:26:22,189 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:26:22,189 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:26:22,189 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:21" (1/2) ... [2025-04-26 16:26:22,191 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29cf3eaa and model type pp5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:26:22, skipping insertion in model container [2025-04-26 16:26:22,191 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:26:22,191 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:26:22" (2/2) ... [2025-04-26 16:26:22,192 INFO L376 chiAutomizerObserver]: Analyzing ICFG pp5.c.bpl [2025-04-26 16:26:22,253 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:26:22,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 139 flow [2025-04-26 16:26:22,310 INFO L116 PetriNetUnfolderBase]: 5/42 cut-off events. [2025-04-26 16:26:22,315 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:26:22,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 42 events. 5/42 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 107 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-04-26 16:26:22,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 139 flow [2025-04-26 16:26:22,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 42 transitions, 114 flow [2025-04-26 16:26:22,325 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 53 places, 42 transitions, 114 flow [2025-04-26 16:26:22,336 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:26:22,336 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:26:22,336 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:26:22,336 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:26:22,336 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:26:22,336 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:26:22,336 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:26:22,336 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:26:22,337 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:26:23,378 INFO L131 ngComponentsAnalysis]: Automaton has 1221 accepting balls. 10401 [2025-04-26 16:26:23,379 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:23,381 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:23,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:26:23,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:26:23,388 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:26:23,388 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 10887 states, but on-demand construction may add more states [2025-04-26 16:26:23,671 INFO L131 ngComponentsAnalysis]: Automaton has 1221 accepting balls. 10401 [2025-04-26 16:26:23,671 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:23,671 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:23,672 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:26:23,672 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:26:23,678 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-04-26 16:26:23,679 INFO L754 eck$LassoCheckResult]: Loop: "[100] L32-->L34: 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[]" "[102] L34-->L35: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[104] L35-->L32: Formula: (= (+ v_c_2 1) v_c_1) InVars {c=v_c_2} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" [2025-04-26 16:26:23,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash 3823, now seen corresponding path program 1 times [2025-04-26 16:26:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:23,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254146682] [2025-04-26 16:26:23,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:23,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:23,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:23,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:23,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:23,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:23,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:23,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:23,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:23,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:23,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:23,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:23,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash 129157, now seen corresponding path program 1 times [2025-04-26 16:26:23,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:23,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243759162] [2025-04-26 16:26:23,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:23,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:23,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:23,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:23,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:23,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:23,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:23,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:23,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:23,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:23,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:23,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:23,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:23,806 INFO L85 PathProgramCache]: Analyzing trace with hash 113990359, now seen corresponding path program 1 times [2025-04-26 16:26:23,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:23,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577542043] [2025-04-26 16:26:23,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:23,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:23,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:23,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:23,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:23,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:23,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:23,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:23,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:23,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:23,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:23,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:23,891 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:23,892 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:23,892 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:23,892 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:23,892 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:23,892 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:23,892 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:23,892 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:23,892 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:26:23,892 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:23,892 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:23,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:23,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:23,998 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:23,998 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:24,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:24,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:24,003 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:24,004 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:24,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:24,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:24,033 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:24,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:24,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:24,036 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:24,036 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:24,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:24,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:24,131 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:24,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:26:24,136 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:24,136 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:24,136 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:24,136 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:24,136 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:24,136 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:24,136 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:24,136 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:24,138 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:26:24,138 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:24,138 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:24,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:24,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:24,184 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:24,187 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:24,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:24,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:24,191 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:24,194 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:24,195 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:24,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:24,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:24,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:24,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:24,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:24,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:24,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:24,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:24,221 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:24,221 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:24,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:24,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:24,224 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:24,226 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:24,228 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:24,232 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:24,233 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:24,234 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:24,234 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z1) = -1*x1 + 1*z1 Supporting invariants [] [2025-04-26 16:26:24,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:24,246 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:24,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:24,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:24,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:24,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:24,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:24,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:24,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:24,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:24,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:24,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:24,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:24,292 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:24,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:24,342 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:24,376 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:26:24,378 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 10887 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:25,017 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 10887 states, but on-demand construction may add more states. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 26438 states and 138518 transitions. Complement of second has 6 states. [2025-04-26 16:26:25,020 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:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-04-26 16:26:25,035 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:26:25,036 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:25,036 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:26:25,036 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:25,036 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 101 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:26:25,037 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:25,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26438 states and 138518 transitions. [2025-04-26 16:26:25,716 INFO L131 ngComponentsAnalysis]: Automaton has 1540 accepting balls. 10038 [2025-04-26 16:26:26,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26438 states to 19123 states and 102066 transitions. [2025-04-26 16:26:26,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10279 [2025-04-26 16:26:26,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13228 [2025-04-26 16:26:26,351 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19123 states and 102066 transitions. [2025-04-26 16:26:26,351 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:26,351 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19123 states and 102066 transitions. [2025-04-26 16:26:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19123 states and 102066 transitions. [2025-04-26 16:26:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19123 to 16175. [2025-04-26 16:26:27,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16175 states, 16175 states have (on average 5.314126738794436) internal successors, (in total 85956), 16174 states have internal predecessors, (85956), 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:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16175 states to 16175 states and 85956 transitions. [2025-04-26 16:26:27,137 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16175 states and 85956 transitions. [2025-04-26 16:26:27,137 INFO L438 stractBuchiCegarLoop]: Abstraction has 16175 states and 85956 transitions. [2025-04-26 16:26:27,137 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:26:27,137 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16175 states and 85956 transitions. [2025-04-26 16:26:27,296 INFO L131 ngComponentsAnalysis]: Automaton has 1540 accepting balls. 10038 [2025-04-26 16:26:27,296 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:27,296 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:27,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:26:27,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:26:27,298 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[137] L17-1-->L43: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" [2025-04-26 16:26:27,299 INFO L754 eck$LassoCheckResult]: Loop: "[106] L43-->L45: 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[]" "[108] L45-->L46: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[110] L46-->L43: Formula: (= (+ v_c_4 1) v_c_3) InVars {c=v_c_4} OutVars{c=v_c_3} AuxVars[] AssignedVars[c]" [2025-04-26 16:26:27,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:27,299 INFO L85 PathProgramCache]: Analyzing trace with hash 118650, now seen corresponding path program 1 times [2025-04-26 16:26:27,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:27,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645740085] [2025-04-26 16:26:27,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:27,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:27,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:27,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:27,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:27,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:27,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:27,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:27,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:27,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:27,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:27,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:27,313 INFO L85 PathProgramCache]: Analyzing trace with hash 135115, now seen corresponding path program 1 times [2025-04-26 16:26:27,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:27,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175252755] [2025-04-26 16:26:27,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:27,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:27,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:27,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:27,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:27,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:27,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:27,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:27,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:27,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:27,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:27,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:27,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:27,326 INFO L85 PathProgramCache]: Analyzing trace with hash -760159822, now seen corresponding path program 1 times [2025-04-26 16:26:27,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:27,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893498163] [2025-04-26 16:26:27,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:27,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:27,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:27,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:27,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:27,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:27,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:27,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:27,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:27,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:27,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:27,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:27,359 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:27,359 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:27,359 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:27,359 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:27,359 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:27,359 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:27,359 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:27,359 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:27,359 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:26:27,359 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:27,359 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:27,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:27,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:27,387 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:27,387 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:27,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:27,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:27,389 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:27,391 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:27,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:27,392 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:27,411 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:27,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:27,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:27,413 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:27,414 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:27,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:27,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:27,453 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:26:27,453 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 16:26:27,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:27,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:27,462 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:27,463 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:27,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:27,465 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:27,481 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:27,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:27,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:27,483 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:27,484 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:27,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:27,489 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:27,553 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:27,556 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:27,557 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:27,557 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:27,557 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:27,557 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:27,557 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:27,557 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:27,557 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:27,557 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:27,557 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:26:27,557 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:27,557 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:27,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:27,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:27,593 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:27,593 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:27,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:27,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:27,595 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:27,596 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:27,598 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:27,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:27,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:27,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:27,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:27,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:27,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:27,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:27,611 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:26:27,616 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:27,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:27,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:27,622 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:27,778 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:27,785 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:27,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:27,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:27,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:27,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:27,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:27,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:27,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:27,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:27,803 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:26:27,803 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:26:27,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:27,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:27,807 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:27,808 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:27,809 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:27,813 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:27,813 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:27,813 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:27,813 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:26:27,819 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:27,820 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:27,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:27,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:27,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:27,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:27,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:27,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:27,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:27,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:27,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:27,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:27,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:27,909 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:27,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:27,944 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:27,945 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:26:27,945 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16175 states and 85956 transitions. cyclomatic complexity: 71581 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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:28,391 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16175 states and 85956 transitions. cyclomatic complexity: 71581. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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 41646 states and 231059 transitions. Complement of second has 6 states. [2025-04-26 16:26:28,391 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:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-04-26 16:26:28,392 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:26:28,392 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:28,392 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:26:28,392 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:28,392 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:26:28,393 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:28,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41646 states and 231059 transitions. [2025-04-26 16:26:29,376 INFO L131 ngComponentsAnalysis]: Automaton has 1887 accepting balls. 9237 [2025-04-26 16:26:29,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41646 states to 29889 states and 167567 transitions. [2025-04-26 16:26:29,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11341 [2025-04-26 16:26:29,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14514 [2025-04-26 16:26:29,821 INFO L74 IsDeterministic]: Start isDeterministic. Operand 29889 states and 167567 transitions. [2025-04-26 16:26:29,821 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:29,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29889 states and 167567 transitions. [2025-04-26 16:26:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29889 states and 167567 transitions. [2025-04-26 16:26:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29889 to 26716. [2025-04-26 16:26:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26716 states, 26716 states have (on average 5.641226231471777) internal successors, (in total 150711), 26715 states have internal predecessors, (150711), 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:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26716 states to 26716 states and 150711 transitions. [2025-04-26 16:26:31,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26716 states and 150711 transitions. [2025-04-26 16:26:31,182 INFO L438 stractBuchiCegarLoop]: Abstraction has 26716 states and 150711 transitions. [2025-04-26 16:26:31,182 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:26:31,182 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26716 states and 150711 transitions. [2025-04-26 16:26:31,380 INFO L131 ngComponentsAnalysis]: Automaton has 1887 accepting balls. 9237 [2025-04-26 16:26:31,380 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:31,380 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:31,381 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:26:31,381 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:26:31,382 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[137] L17-1-->L43: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[140] L18-->L54: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1]" [2025-04-26 16:26:31,382 INFO L754 eck$LassoCheckResult]: Loop: "[112] L54-->L56: Formula: (< v_y1_1 v_z1_3) InVars {y1=v_y1_1, z1=v_z1_3} OutVars{y1=v_y1_1, z1=v_z1_3} AuxVars[] AssignedVars[]" "[114] L56-->L57: Formula: (= v_y1_2 (+ v_y1_3 1)) InVars {y1=v_y1_3} OutVars{y1=v_y1_2} AuxVars[] AssignedVars[y1]" "[116] L57-->L54: Formula: (= v_c_5 (+ v_c_6 1)) InVars {c=v_c_6} OutVars{c=v_c_5} AuxVars[] AssignedVars[c]" [2025-04-26 16:26:31,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash 3678290, now seen corresponding path program 1 times [2025-04-26 16:26:31,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:31,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820719845] [2025-04-26 16:26:31,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:31,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:31,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:31,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:31,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:31,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:31,387 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:31,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:31,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:31,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:31,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:31,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:31,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash 141073, now seen corresponding path program 1 times [2025-04-26 16:26:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:31,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443726421] [2025-04-26 16:26:31,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:31,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:31,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:31,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:31,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:31,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:31,394 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:31,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:31,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:31,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:31,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:31,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:31,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:31,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2089101024, now seen corresponding path program 1 times [2025-04-26 16:26:31,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:31,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400755494] [2025-04-26 16:26:31,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:31,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:26:31,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:26:31,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:31,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:31,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:31,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:26:31,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:26:31,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:31,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:31,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:31,426 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:31,426 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:31,426 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:31,426 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:31,426 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:31,426 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:31,426 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:31,426 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:31,427 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:31,427 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:31,427 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:31,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:31,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:31,452 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:31,453 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:31,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:31,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:31,455 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:31,456 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:31,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:31,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:31,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:26:31,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:31,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:31,477 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:31,478 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:31,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:31,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:31,514 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:26:31,515 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 16:26:31,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:26:31,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:31,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:31,523 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:31,525 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:31,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:31,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:31,543 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:31,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:31,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:31,545 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:31,546 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:31,548 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:31,548 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:31,616 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:31,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:31,620 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:31,620 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:31,620 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:31,621 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:31,621 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:31,622 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:31,622 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:31,622 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:31,622 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:31,622 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:31,622 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:31,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:31,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:31,650 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:31,650 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:31,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:31,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:31,652 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:31,654 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:31,655 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:31,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:31,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:31,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:31,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:31,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:31,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:31,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:31,669 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:26:31,674 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:31,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:31,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:31,676 INFO L229 MonitoredProcess]: Starting monitored process 18 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:31,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:26:31,768 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:31,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:31,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:31,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:31,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:31,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:31,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:31,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:31,793 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:31,797 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:31,797 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:31,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:31,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:31,803 INFO L229 MonitoredProcess]: Starting monitored process 19 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:31,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:26:31,809 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:31,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:31,817 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:31,817 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:31,817 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, z1) = -1*y1 + 1*z1 Supporting invariants [] [2025-04-26 16:26:31,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:31,830 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:31,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:31,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:31,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:31,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:31,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:31,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:31,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:31,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:31,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:31,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:31,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:31,906 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:31,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:31,955 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:31,956 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:26:31,957 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26716 states and 150711 transitions. cyclomatic complexity: 126674 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 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:32,876 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26716 states and 150711 transitions. cyclomatic complexity: 126674. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 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 75779 states and 441727 transitions. Complement of second has 6 states. [2025-04-26 16:26:32,877 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:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 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:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-04-26 16:26:32,878 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:26:32,878 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:32,878 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:26:32,878 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:32,878 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:26:32,878 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:32,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75779 states and 441727 transitions. [2025-04-26 16:26:34,377 INFO L131 ngComponentsAnalysis]: Automaton has 2030 accepting balls. 7644 [2025-04-26 16:26:35,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75779 states to 49046 states and 287893 transitions. [2025-04-26 16:26:35,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13445 [2025-04-26 16:26:35,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16342 [2025-04-26 16:26:35,259 INFO L74 IsDeterministic]: Start isDeterministic. Operand 49046 states and 287893 transitions. [2025-04-26 16:26:35,260 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:35,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49046 states and 287893 transitions. [2025-04-26 16:26:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49046 states and 287893 transitions. [2025-04-26 16:26:36,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49046 to 44526. [2025-04-26 16:26:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44526 states, 44526 states have (on average 5.917486412433185) internal successors, (in total 263482), 44525 states have internal predecessors, (263482), 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:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44526 states to 44526 states and 263482 transitions. [2025-04-26 16:26:37,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44526 states and 263482 transitions. [2025-04-26 16:26:37,527 INFO L438 stractBuchiCegarLoop]: Abstraction has 44526 states and 263482 transitions. [2025-04-26 16:26:37,527 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:26:37,527 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44526 states and 263482 transitions. [2025-04-26 16:26:37,952 INFO L131 ngComponentsAnalysis]: Automaton has 2030 accepting balls. 7644 [2025-04-26 16:26:37,952 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:37,952 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:37,953 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:26:37,953 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:26:37,954 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[137] L17-1-->L43: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[140] L18-->L54: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1]" "[143] L19-->L65: Formula: (and (= v_thread4Thread1of1ForFork4_thidvar2_2 4) (= v_thread4Thread1of1ForFork4_thidvar0_2 4) (= v_thread4Thread1of1ForFork4_thidvar1_2 4) (= v_thread4Thread1of1ForFork4_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork4_thidvar0=v_thread4Thread1of1ForFork4_thidvar0_2, thread4Thread1of1ForFork4_thidvar1=v_thread4Thread1of1ForFork4_thidvar1_2, thread4Thread1of1ForFork4_thidvar2=v_thread4Thread1of1ForFork4_thidvar2_2, thread4Thread1of1ForFork4_thidvar3=v_thread4Thread1of1ForFork4_thidvar3_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork4_thidvar0, thread4Thread1of1ForFork4_thidvar1, thread4Thread1of1ForFork4_thidvar2, thread4Thread1of1ForFork4_thidvar3]" [2025-04-26 16:26:37,954 INFO L754 eck$LassoCheckResult]: Loop: "[118] L65-->L67: Formula: (< v_y2_1 v_z1_5) InVars {y2=v_y2_1, z1=v_z1_5} OutVars{y2=v_y2_1, z1=v_z1_5} AuxVars[] AssignedVars[]" "[120] L67-->L68: Formula: (= v_y2_2 (+ v_y2_3 1)) InVars {y2=v_y2_3} OutVars{y2=v_y2_2} AuxVars[] AssignedVars[y2]" "[122] L68-->L65: Formula: (= v_c_7 (+ v_c_8 1)) InVars {c=v_c_8} OutVars{c=v_c_7} AuxVars[] AssignedVars[c]" [2025-04-26 16:26:37,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash 114027133, now seen corresponding path program 1 times [2025-04-26 16:26:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:37,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790335972] [2025-04-26 16:26:37,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:37,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:37,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:37,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:37,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:37,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:37,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:37,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:37,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:37,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:37,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:37,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:37,963 INFO L85 PathProgramCache]: Analyzing trace with hash 147031, now seen corresponding path program 1 times [2025-04-26 16:26:37,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:37,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816171692] [2025-04-26 16:26:37,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:37,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:37,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:37,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:37,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:37,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:37,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:37,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:37,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:37,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:37,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:37,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:37,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash -336694693, now seen corresponding path program 1 times [2025-04-26 16:26:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:37,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322105481] [2025-04-26 16:26:37,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:37,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:26:37,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:26:37,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:37,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:37,973 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:37,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:26:37,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:26:37,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:37,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:37,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:38,006 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:38,006 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:38,006 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:38,006 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:38,006 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:38,006 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:38,006 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:38,006 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:38,006 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:26:38,006 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:38,006 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:38,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:38,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:38,038 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:38,039 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:38,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:38,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:38,041 INFO L229 MonitoredProcess]: Starting monitored process 20 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:38,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:26:38,043 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:38,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:38,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:26:38,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:38,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:38,061 INFO L229 MonitoredProcess]: Starting monitored process 21 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:38,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:26:38,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:38,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:38,125 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:38,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:26:38,129 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:38,129 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:38,129 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:38,129 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:38,129 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:38,129 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:38,129 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:38,129 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:38,129 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:26:38,129 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:38,130 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:38,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:38,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:38,161 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:38,162 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:38,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:38,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:38,164 INFO L229 MonitoredProcess]: Starting monitored process 22 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:38,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:26:38,166 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:38,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:38,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:38,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:38,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:38,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:38,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:38,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:38,178 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:38,180 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:26:38,180 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:26:38,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:38,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:38,182 INFO L229 MonitoredProcess]: Starting monitored process 23 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:38,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:26:38,184 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:38,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:26:38,187 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:38,187 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:38,187 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, y2) = 1*z1 - 1*y2 Supporting invariants [] [2025-04-26 16:26:38,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:26:38,192 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:38,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:38,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:38,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:38,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:38,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:38,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:38,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:38,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:38,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:38,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:38,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:38,226 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:38,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:38,247 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:38,247 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:26:38,247 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44526 states and 263482 transitions. cyclomatic complexity: 222701 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 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:40,053 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44526 states and 263482 transitions. cyclomatic complexity: 222701. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 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 127111 states and 770424 transitions. Complement of second has 6 states. [2025-04-26 16:26:40,053 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:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 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:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-04-26 16:26:40,054 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 117 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:26:40,054 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:40,054 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 117 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:26:40,055 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:40,055 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 117 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:26:40,055 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:40,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127111 states and 770424 transitions. [2025-04-26 16:26:42,722 INFO L131 ngComponentsAnalysis]: Automaton has 1555 accepting balls. 4665 [2025-04-26 16:26:43,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127111 states to 66898 states and 407916 transitions. [2025-04-26 16:26:43,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14464 [2025-04-26 16:26:43,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16881 [2025-04-26 16:26:43,768 INFO L74 IsDeterministic]: Start isDeterministic. Operand 66898 states and 407916 transitions. [2025-04-26 16:26:43,768 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:43,769 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66898 states and 407916 transitions. [2025-04-26 16:26:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66898 states and 407916 transitions. [2025-04-26 16:26:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66898 to 61404. [2025-04-26 16:26:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61404 states, 61404 states have (on average 6.1574001693700735) internal successors, (in total 378089), 61403 states have internal predecessors, (378089), 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:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61404 states to 61404 states and 378089 transitions. [2025-04-26 16:26:46,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61404 states and 378089 transitions. [2025-04-26 16:26:46,019 INFO L438 stractBuchiCegarLoop]: Abstraction has 61404 states and 378089 transitions. [2025-04-26 16:26:46,019 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:26:46,019 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61404 states and 378089 transitions. [2025-04-26 16:26:46,777 INFO L131 ngComponentsAnalysis]: Automaton has 1555 accepting balls. 4665 [2025-04-26 16:26:46,778 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:46,778 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:46,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:26:46,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:26:46,779 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[137] L17-1-->L43: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[140] L18-->L54: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1]" "[143] L19-->L65: Formula: (and (= v_thread4Thread1of1ForFork4_thidvar2_2 4) (= v_thread4Thread1of1ForFork4_thidvar0_2 4) (= v_thread4Thread1of1ForFork4_thidvar1_2 4) (= v_thread4Thread1of1ForFork4_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork4_thidvar0=v_thread4Thread1of1ForFork4_thidvar0_2, thread4Thread1of1ForFork4_thidvar1=v_thread4Thread1of1ForFork4_thidvar1_2, thread4Thread1of1ForFork4_thidvar2=v_thread4Thread1of1ForFork4_thidvar2_2, thread4Thread1of1ForFork4_thidvar3=v_thread4Thread1of1ForFork4_thidvar3_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork4_thidvar0, thread4Thread1of1ForFork4_thidvar1, thread4Thread1of1ForFork4_thidvar2, thread4Thread1of1ForFork4_thidvar3]" "[131] L20-->L76: Formula: (and (= 5 v_thread5Thread1of1ForFork0_thidvar4_2) (= 5 v_thread5Thread1of1ForFork0_thidvar3_2) (= 5 v_thread5Thread1of1ForFork0_thidvar2_2) (= 5 v_thread5Thread1of1ForFork0_thidvar1_2) (= 5 v_thread5Thread1of1ForFork0_thidvar0_2)) InVars {} OutVars{thread5Thread1of1ForFork0_thidvar4=v_thread5Thread1of1ForFork0_thidvar4_2, thread5Thread1of1ForFork0_thidvar3=v_thread5Thread1of1ForFork0_thidvar3_2, thread5Thread1of1ForFork0_thidvar2=v_thread5Thread1of1ForFork0_thidvar2_2, thread5Thread1of1ForFork0_thidvar1=v_thread5Thread1of1ForFork0_thidvar1_2, thread5Thread1of1ForFork0_thidvar0=v_thread5Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_thidvar4, thread5Thread1of1ForFork0_thidvar3, thread5Thread1of1ForFork0_thidvar2, thread5Thread1of1ForFork0_thidvar1, thread5Thread1of1ForFork0_thidvar0]" [2025-04-26 16:26:46,779 INFO L754 eck$LassoCheckResult]: Loop: "[124] L76-->L78: Formula: (< v_x3_1 v_z1_7) InVars {x3=v_x3_1, z1=v_z1_7} OutVars{x3=v_x3_1, z1=v_z1_7} AuxVars[] AssignedVars[]" "[126] L78-->L79: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[128] L79-->L76: Formula: (= (+ v_c_10 1) v_c_9) InVars {c=v_c_10} OutVars{c=v_c_9} AuxVars[] AssignedVars[c]" [2025-04-26 16:26:46,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash -760126042, now seen corresponding path program 1 times [2025-04-26 16:26:46,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:46,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567497894] [2025-04-26 16:26:46,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:46,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:46,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:46,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:46,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:46,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:46,783 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:46,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:46,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:46,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:46,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:46,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:46,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:46,796 INFO L85 PathProgramCache]: Analyzing trace with hash 152989, now seen corresponding path program 1 times [2025-04-26 16:26:46,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:46,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391683947] [2025-04-26 16:26:46,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:46,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:46,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:46,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:46,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:46,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:46,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:46,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:46,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:46,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:46,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:46,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:46,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:46,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1847209512, now seen corresponding path program 1 times [2025-04-26 16:26:46,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:46,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565844106] [2025-04-26 16:26:46,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:46,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:46,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:26:46,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:26:46,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:46,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:46,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:46,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:26:46,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:26:46,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:46,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:46,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:46,823 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:46,824 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:46,824 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:46,824 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:46,824 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:46,824 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:46,824 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:46,824 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:46,824 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:26:46,824 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:46,824 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:46,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:46,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:46,850 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:46,850 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:46,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:46,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:46,852 INFO L229 MonitoredProcess]: Starting monitored process 24 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:46,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:26:46,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:46,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:46,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:46,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:46,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:46,875 INFO L229 MonitoredProcess]: Starting monitored process 25 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:46,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:26:46,882 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:46,882 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:46,948 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:46,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:46,952 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:46,952 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:46,952 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:46,952 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:46,952 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:46,952 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:46,952 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:46,952 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:46,953 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:26:46,953 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:46,953 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:46,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:46,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:46,979 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:46,980 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:46,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:46,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:46,981 INFO L229 MonitoredProcess]: Starting monitored process 26 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:46,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:26:46,985 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:46,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:46,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:46,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:46,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:46,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:46,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:46,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:47,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:47,004 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:26:47,004 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:26:47,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:47,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:47,007 INFO L229 MonitoredProcess]: Starting monitored process 27 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:47,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:26:47,008 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:47,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:47,012 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:47,012 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:47,012 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x3) = 1*z1 - 1*x3 Supporting invariants [] [2025-04-26 16:26:47,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:26:47,018 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:47,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:47,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:47,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:47,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:47,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:47,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:47,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:47,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:26:47,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:26:47,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:47,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:47,046 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:47,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:47,072 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:47,072 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:26:47,073 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61404 states and 378089 transitions. cyclomatic complexity: 320999 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 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:49,401 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61404 states and 378089 transitions. cyclomatic complexity: 320999. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 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 164099 states and 1037657 transitions. Complement of second has 6 states. [2025-04-26 16:26:49,401 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:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 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:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-04-26 16:26:49,402 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 119 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:26:49,402 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:49,402 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 119 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:26:49,402 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:49,402 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 119 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 16:26:49,402 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:49,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164099 states and 1037657 transitions. [2025-04-26 16:26:52,745 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:26:52,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164099 states to 0 states and 0 transitions. [2025-04-26 16:26:52,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:26:52,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:26:52,746 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:26:52,746 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:26:52,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:52,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:52,746 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:52,746 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:26:52,746 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:26:52,746 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:26:52,746 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:26:52,752 INFO L201 PluginConnector]: Adding new model pp5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:26:52 BoogieIcfgContainer [2025-04-26 16:26:52,752 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:26:52,753 INFO L158 Benchmark]: Toolchain (without parser) took 30834.81ms. Allocated memory was 159.4MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 83.9MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2025-04-26 16:26:52,753 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.86ms. Allocated memory is still 159.4MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:26:52,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.14ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:26:52,753 INFO L158 Benchmark]: Boogie Preprocessor took 29.28ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:26:52,753 INFO L158 Benchmark]: RCFGBuilder took 197.75ms. Allocated memory is still 159.4MB. Free memory was 80.9MB in the beginning and 71.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:26:52,754 INFO L158 Benchmark]: BuchiAutomizer took 30567.76ms. Allocated memory was 159.4MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 71.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2025-04-26 16:26:52,754 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.86ms. Allocated memory is still 159.4MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.14ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.28ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 197.75ms. Allocated memory is still 159.4MB. Free memory was 80.9MB in the beginning and 71.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 30567.76ms. Allocated memory was 159.4MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 71.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 30.4s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.2s. Büchi inclusion checks took 6.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 6.7s AutomataMinimizationTime, 4 MinimizatonAttempts, 16135 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 11.9s Buchi closure took 0.2s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 587 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 271 mSDtfsCounter, 295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp70 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: 2 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (0 trivial, 5 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 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z1 and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:26:52,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...