/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/m7.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:25:59,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:26:00,028 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:00,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:26:00,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:26:00,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:26:00,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:26:00,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:26:00,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:26:00,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:26:00,057 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:26:00,057 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:26:00,057 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:26:00,057 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:26:00,058 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:26:00,058 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:26:00,058 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:26:00,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:26:00,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:26:00,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:26:00,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:26:00,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:26:00,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:26:00,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:26:00,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:26:00,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:26:00,059 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:26:00,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:26:00,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:26:00,059 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:26:00,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:26:00,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:26:00,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:26:00,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:26:00,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:26:00,059 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:26:00,060 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:26:00,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:26:00,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:26:00,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:26:00,278 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:26:00,278 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:26:00,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/m7.c.bpl [2025-04-26 16:26:00,281 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/m7.c.bpl' [2025-04-26 16:26:00,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:26:00,297 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:26:00,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:26:00,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:26:00,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:26:00,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/1) ... [2025-04-26 16:26:00,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/1) ... [2025-04-26 16:26:00,332 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:26:00,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:26:00,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:26:00,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:26:00,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:26:00,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/1) ... [2025-04-26 16:26:00,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/1) ... [2025-04-26 16:26:00,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/1) ... [2025-04-26 16:26:00,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/1) ... [2025-04-26 16:26:00,345 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/1) ... [2025-04-26 16:26:00,345 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/1) ... [2025-04-26 16:26:00,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/1) ... [2025-04-26 16:26:00,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/1) ... [2025-04-26 16:26:00,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/1) ... [2025-04-26 16:26:00,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:26:00,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:26:00,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:26:00,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:26:00,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/1) ... [2025-04-26 16:26:00,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:00,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:00,386 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:00,391 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:00,410 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:26:00,411 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:26:00,411 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:26:00,411 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:26:00,411 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:26:00,411 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:26:00,411 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:26:00,411 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:26:00,411 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:26:00,411 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:26:00,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:26:00,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:26:00,411 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:26:00,411 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:26:00,411 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:26:00,413 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:00,450 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:26:00,452 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:26:00,535 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:26:00,535 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:26:00,542 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:26:00,542 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:26:00,543 INFO L201 PluginConnector]: Adding new model m7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:26:00 BoogieIcfgContainer [2025-04-26 16:26:00,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:26:00,543 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:26:00,543 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:26:00,547 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:26:00,548 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:26:00,548 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:26:00" (1/2) ... [2025-04-26 16:26:00,550 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5435bff and model type m7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:26:00, skipping insertion in model container [2025-04-26 16:26:00,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:26:00,550 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:26:00" (2/2) ... [2025-04-26 16:26:00,552 INFO L376 chiAutomizerObserver]: Analyzing ICFG m7.c.bpl [2025-04-26 16:26:00,609 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:26:00,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 100 flow [2025-04-26 16:26:00,665 INFO L116 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-04-26 16:26:00,668 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:26:00,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 4/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 16:26:00,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 100 flow [2025-04-26 16:26:00,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 28 transitions, 80 flow [2025-04-26 16:26:00,678 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 28 transitions, 80 flow [2025-04-26 16:26:00,688 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:26:00,688 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:26:00,689 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:26:00,689 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:26:00,689 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:26:00,689 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:26:00,689 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:26:00,689 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:26:00,690 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:26:00,830 INFO L131 ngComponentsAnalysis]: Automaton has 176 accepting balls. 546 [2025-04-26 16:26:00,831 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:00,831 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:00,834 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:26:00,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:00,834 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:26:00,834 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 633 states, but on-demand construction may add more states [2025-04-26 16:26:00,853 INFO L131 ngComponentsAnalysis]: Automaton has 176 accepting balls. 546 [2025-04-26 16:26:00,853 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:00,853 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:00,853 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:26:00,853 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:00,857 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L13: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[89] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:26:00,857 INFO L754 eck$LassoCheckResult]: Loop: "[70] L26-->L28: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[72] L28-->L26: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:26:00,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2972, now seen corresponding path program 1 times [2025-04-26 16:26:00,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:00,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630036226] [2025-04-26 16:26:00,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:00,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:00,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:00,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:00,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:00,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:00,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:00,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:00,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:00,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:00,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:00,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2025-04-26 16:26:00,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:00,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108722527] [2025-04-26 16:26:00,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:00,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:00,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:00,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:00,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:00,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:00,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:00,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:00,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:00,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:00,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:00,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:00,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2858334, now seen corresponding path program 1 times [2025-04-26 16:26:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:00,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850267870] [2025-04-26 16:26:00,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:00,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:00,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:00,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:00,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:00,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:00,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:00,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:00,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:00,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:00,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:01,027 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:01,028 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:01,028 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:01,029 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:01,029 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:01,029 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:01,029 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:01,029 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:01,029 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:26:01,029 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:01,029 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:01,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:01,069 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:01,070 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:01,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:01,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:01,074 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:01,075 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:01,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:01,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:01,098 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:01,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:01,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:01,100 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:01,101 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:01,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:01,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:01,175 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:01,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:01,180 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:01,180 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:01,180 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:01,180 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:01,180 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:01,180 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:01,180 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:01,180 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:01,180 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:26:01,180 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:01,180 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:01,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:01,209 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:01,212 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:01,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:01,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:01,215 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:01,216 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:01,218 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:01,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:01,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:01,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:01,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:01,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:01,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:01,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:01,239 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:01,244 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:01,245 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:01,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:01,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:01,276 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:01,277 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:01,278 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:01,280 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:26:01,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:26:01,281 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:01,282 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:01,282 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:26:01,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:26:01,290 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:01,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:01,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:01,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:01,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:01,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:01,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:01,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:01,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:01,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:01,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:01,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:01,373 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:01,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:01,393 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:01,455 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:26:01,463 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 633 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:01,633 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 633 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2212 states and 9066 transitions. Complement of second has 7 states. [2025-04-26 16:26:01,637 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:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 16:26:01,649 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:26:01,650 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:01,650 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:26:01,650 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:01,650 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:26:01,650 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:01,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2212 states and 9066 transitions. [2025-04-26 16:26:01,694 INFO L131 ngComponentsAnalysis]: Automaton has 320 accepting balls. 872 [2025-04-26 16:26:01,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2212 states to 1648 states and 6830 transitions. [2025-04-26 16:26:01,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1041 [2025-04-26 16:26:01,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1355 [2025-04-26 16:26:01,738 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1648 states and 6830 transitions. [2025-04-26 16:26:01,739 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:01,739 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1648 states and 6830 transitions. [2025-04-26 16:26:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states and 6830 transitions. [2025-04-26 16:26:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1039. [2025-04-26 16:26:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1039 states have (on average 4.304138594802695) internal successors, (in total 4472), 1038 states have internal predecessors, (4472), 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:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 4472 transitions. [2025-04-26 16:26:01,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1039 states and 4472 transitions. [2025-04-26 16:26:01,833 INFO L438 stractBuchiCegarLoop]: Abstraction has 1039 states and 4472 transitions. [2025-04-26 16:26:01,833 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:26:01,833 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1039 states and 4472 transitions. [2025-04-26 16:26:01,840 INFO L131 ngComponentsAnalysis]: Automaton has 222 accepting balls. 642 [2025-04-26 16:26:01,840 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:01,840 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:01,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:26:01,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:01,841 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L13: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[89] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[92] L13-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[95] L14-->L46: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:26:01,841 INFO L754 eck$LassoCheckResult]: Loop: "[80] L46-->L48: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[82] L48-->L46: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:26:01,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:01,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2859039, now seen corresponding path program 1 times [2025-04-26 16:26:01,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:01,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213838014] [2025-04-26 16:26:01,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:01,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:01,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:01,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:01,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:01,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:01,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:01,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:01,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:01,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:01,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:01,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:01,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-04-26 16:26:01,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:01,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902582304] [2025-04-26 16:26:01,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:01,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:01,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:01,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:01,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:01,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:01,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:01,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:01,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:01,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:01,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:01,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:01,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:01,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1547428255, now seen corresponding path program 1 times [2025-04-26 16:26:01,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:01,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560928806] [2025-04-26 16:26:01,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:01,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:01,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:01,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:01,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:01,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:01,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:01,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:26:01,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:26:01,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:01,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:01,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:01,896 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:01,896 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:01,896 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:01,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:01,896 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:01,896 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:01,896 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:01,896 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:01,896 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:26:01,896 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:01,897 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:01,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:01,917 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:01,918 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:01,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:01,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:01,921 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:01,922 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:01,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:01,924 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:01,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:26:01,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:01,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:01,944 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:01,944 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:01,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:01,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:02,016 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:02,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:26:02,021 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:02,021 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:02,021 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:02,021 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:02,021 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:02,021 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,021 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:02,021 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:02,021 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:26:02,021 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:02,021 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:02,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:02,041 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:02,041 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:02,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,043 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:02,045 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:02,046 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:02,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:02,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:02,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:02,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:02,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:02,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:02,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:02,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:02,061 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:02,061 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:02,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,064 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:02,064 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:02,065 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:02,068 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:02,068 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:02,068 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:02,068 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x2) = 1*w - 1*x2 Supporting invariants [] [2025-04-26 16:26:02,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:26:02,075 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:02,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:02,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:26:02,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:26:02,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:02,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:02,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:02,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:02,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:02,105 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:02,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:02,118 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:02,118 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:26:02,119 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1039 states and 4472 transitions. cyclomatic complexity: 3713 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:02,223 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1039 states and 4472 transitions. cyclomatic complexity: 3713. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3144 states and 14622 transitions. Complement of second has 6 states. [2025-04-26 16:26:02,223 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:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-04-26 16:26:02,224 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:26:02,224 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:02,224 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:26:02,224 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:02,224 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:26:02,224 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:02,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3144 states and 14622 transitions. [2025-04-26 16:26:02,263 INFO L131 ngComponentsAnalysis]: Automaton has 207 accepting balls. 512 [2025-04-26 16:26:02,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3144 states to 2288 states and 10609 transitions. [2025-04-26 16:26:02,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 877 [2025-04-26 16:26:02,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1365 [2025-04-26 16:26:02,302 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2288 states and 10609 transitions. [2025-04-26 16:26:02,302 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:02,302 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2288 states and 10609 transitions. [2025-04-26 16:26:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states and 10609 transitions. [2025-04-26 16:26:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 1800. [2025-04-26 16:26:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1800 states have (on average 4.822222222222222) internal successors, (in total 8680), 1799 states have internal predecessors, (8680), 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:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 8680 transitions. [2025-04-26 16:26:02,407 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1800 states and 8680 transitions. [2025-04-26 16:26:02,407 INFO L438 stractBuchiCegarLoop]: Abstraction has 1800 states and 8680 transitions. [2025-04-26 16:26:02,407 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:26:02,407 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1800 states and 8680 transitions. [2025-04-26 16:26:02,421 INFO L131 ngComponentsAnalysis]: Automaton has 207 accepting balls. 512 [2025-04-26 16:26:02,421 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:02,421 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:02,421 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:26:02,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:02,422 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L13: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[89] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[69] L26-->L30: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[92] L13-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[74] $Ultimate##0-->L37-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:26:02,422 INFO L754 eck$LassoCheckResult]: Loop: "[76] L37-1-->L39: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[78] L39-->L37-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 16:26:02,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:02,422 INFO L85 PathProgramCache]: Analyzing trace with hash 88608087, now seen corresponding path program 1 times [2025-04-26 16:26:02,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:02,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697555610] [2025-04-26 16:26:02,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:02,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:02,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:02,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:26:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:26:02,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697555610] [2025-04-26 16:26:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697555610] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:26:02,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:26:02,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:26:02,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105201347] [2025-04-26 16:26:02,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:26:02,460 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:26:02,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 16:26:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:02,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955412291] [2025-04-26 16:26:02,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:02,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:02,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:02,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:02,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:02,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:02,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:02,482 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:02,482 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:02,482 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:02,482 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:02,482 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:02,482 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,482 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:02,482 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:02,482 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:02,482 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:02,482 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:02,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:02,501 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:02,501 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:02,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,504 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:02,505 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:02,506 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:02,506 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:02,522 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:02,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,524 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:02,525 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:02,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:02,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:02,602 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:02,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:26:02,608 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:02,608 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:02,608 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:02,608 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:02,608 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:02,608 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,608 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:02,608 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:02,608 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:26:02,608 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:02,608 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:02,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:02,627 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:02,627 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:02,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,630 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:02,631 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:02,633 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:02,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:02,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:02,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:02,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:02,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:02,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:02,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:02,647 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:02,649 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:26:02,649 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:26:02,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:02,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:02,651 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:02,653 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:02,654 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:02,657 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:26:02,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:26:02,658 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:02,658 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:02,658 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x1) = -1*y + 1*x1 Supporting invariants [] [2025-04-26 16:26:02,664 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:02,665 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:02,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:02,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:02,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:02,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:02,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:02,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:02,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:02,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:02,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:02,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:02,697 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:02,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:02,712 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:02,712 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:26:02,712 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1800 states and 8680 transitions. cyclomatic complexity: 7262 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:02,860 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1800 states and 8680 transitions. cyclomatic complexity: 7262. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 6183 states and 29741 transitions. Complement of second has 7 states. [2025-04-26 16:26:02,861 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:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-04-26 16:26:02,862 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:26:02,862 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:02,862 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:26:02,862 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:02,862 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:26:02,862 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:02,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6183 states and 29741 transitions. [2025-04-26 16:26:02,936 INFO L131 ngComponentsAnalysis]: Automaton has 340 accepting balls. 778 [2025-04-26 16:26:03,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6183 states to 4514 states and 21595 transitions. [2025-04-26 16:26:03,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1616 [2025-04-26 16:26:03,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1978 [2025-04-26 16:26:03,040 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4514 states and 21595 transitions. [2025-04-26 16:26:03,040 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:03,040 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4514 states and 21595 transitions. [2025-04-26 16:26:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4514 states and 21595 transitions. [2025-04-26 16:26:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4514 to 2967. [2025-04-26 16:26:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2967 states, 2967 states have (on average 5.050219076508258) internal successors, (in total 14984), 2966 states have internal predecessors, (14984), 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:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 14984 transitions. [2025-04-26 16:26:03,155 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2967 states and 14984 transitions. [2025-04-26 16:26:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:26:03,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:26:03,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:26:03,159 INFO L87 Difference]: Start difference. First operand 2967 states and 14984 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:03,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:26:03,185 INFO L93 Difference]: Finished difference Result 853 states and 3746 transitions. [2025-04-26 16:26:03,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 853 states and 3746 transitions. [2025-04-26 16:26:03,194 INFO L131 ngComponentsAnalysis]: Automaton has 77 accepting balls. 154 [2025-04-26 16:26:03,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 853 states to 775 states and 3468 transitions. [2025-04-26 16:26:03,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2025-04-26 16:26:03,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2025-04-26 16:26:03,202 INFO L74 IsDeterministic]: Start isDeterministic. Operand 775 states and 3468 transitions. [2025-04-26 16:26:03,203 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:26:03,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 775 states and 3468 transitions. [2025-04-26 16:26:03,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states and 3468 transitions. [2025-04-26 16:26:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2025-04-26 16:26:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 775 states have (on average 4.474838709677419) internal successors, (in total 3468), 774 states have internal predecessors, (3468), 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:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3468 transitions. [2025-04-26 16:26:03,222 INFO L240 hiAutomatonCegarLoop]: Abstraction has 775 states and 3468 transitions. [2025-04-26 16:26:03,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:26:03,223 INFO L438 stractBuchiCegarLoop]: Abstraction has 775 states and 3468 transitions. [2025-04-26 16:26:03,223 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:26:03,223 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 775 states and 3468 transitions. [2025-04-26 16:26:03,228 INFO L131 ngComponentsAnalysis]: Automaton has 77 accepting balls. 154 [2025-04-26 16:26:03,228 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:26:03,228 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:26:03,228 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:26:03,228 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:26:03,229 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L13: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[89] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[92] L13-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[95] L14-->L46: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[98] L15-->L55: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:26:03,229 INFO L754 eck$LassoCheckResult]: Loop: "[84] L55-->L57: Formula: (< v_x3_1 v_w_3) InVars {w=v_w_3, x3=v_x3_1} OutVars{w=v_w_3, x3=v_x3_1} AuxVars[] AssignedVars[]" "[86] L57-->L55: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:26:03,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash 88630307, now seen corresponding path program 1 times [2025-04-26 16:26:03,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,229 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898093047] [2025-04-26 16:26:03,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:03,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:03,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,233 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:03,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:03,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,237 INFO L85 PathProgramCache]: Analyzing trace with hash 3651, now seen corresponding path program 1 times [2025-04-26 16:26:03,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701743234] [2025-04-26 16:26:03,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,242 INFO L85 PathProgramCache]: Analyzing trace with hash -725618203, now seen corresponding path program 1 times [2025-04-26 16:26:03,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:26:03,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653107128] [2025-04-26 16:26:03,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:26:03,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:26:03,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:26:03,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:26:03,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:26:03,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:26:03,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:26:03,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:26:03,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:26:03,271 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:03,271 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:03,271 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:03,271 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:03,271 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:26:03,271 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,271 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:03,271 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:03,271 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:26:03,271 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:03,271 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:03,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:03,288 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:03,288 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:26:03,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,290 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:03,291 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:03,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:26:03,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:03,309 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:03,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,311 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:03,313 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:03,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:26:03,314 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:26:03,380 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:26:03,385 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:03,385 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:26:03,385 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:26:03,385 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:26:03,385 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:26:03,385 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:26:03,385 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,385 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:26:03,385 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:26:03,385 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:26:03,385 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:26:03,385 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:26:03,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:26:03,405 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:26:03,406 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:26:03,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,410 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:03,411 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:03,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:26:03,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:26:03,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:26:03,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:26:03,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:26:03,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:26:03,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:26:03,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:26:03,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:26:03,427 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:26:03,427 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:26:03,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:26:03,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:26:03,429 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:03,430 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:03,431 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:26:03,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:26:03,434 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:26:03,434 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:26:03,434 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x3) = 1*w - 1*x3 Supporting invariants [] [2025-04-26 16:26:03,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:26:03,440 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:26:03,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:26:03,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:26:03,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:26:03,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:03,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:26:03,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:03,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:26:03,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:26:03,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:26:03,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:26:03,477 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:26:03,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:26:03,489 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:03,490 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:26:03,490 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 775 states and 3468 transitions. cyclomatic complexity: 2846 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:03,572 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 775 states and 3468 transitions. cyclomatic complexity: 2846. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2385 states and 10754 transitions. Complement of second has 6 states. [2025-04-26 16:26:03,573 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:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:26:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-04-26 16:26:03,574 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:26:03,574 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:03,574 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:26:03,574 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:03,574 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:26:03,574 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:26:03,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2385 states and 10754 transitions. [2025-04-26 16:26:03,594 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:26:03,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2385 states to 0 states and 0 transitions. [2025-04-26 16:26:03,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:26:03,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:26:03,594 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:26:03,594 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:26:03,594 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:03,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:03,594 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:26:03,594 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:26:03,595 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:26:03,595 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:26:03,595 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:26:03,601 INFO L201 PluginConnector]: Adding new model m7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:26:03 BoogieIcfgContainer [2025-04-26 16:26:03,601 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:26:03,602 INFO L158 Benchmark]: Toolchain (without parser) took 3304.29ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 82.2MB in the beginning and 133.6MB in the end (delta: -51.4MB). Peak memory consumption was 43.8MB. Max. memory is 8.0GB. [2025-04-26 16:26:03,602 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.86ms. Allocated memory is still 155.2MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:26:03,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.36ms. Allocated memory is still 155.2MB. Free memory was 82.2MB in the beginning and 80.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:26:03,602 INFO L158 Benchmark]: Boogie Preprocessor took 27.50ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 79.2MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:26:03,602 INFO L158 Benchmark]: RCFGBuilder took 180.83ms. Allocated memory is still 155.2MB. Free memory was 79.2MB in the beginning and 70.3MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:26:03,604 INFO L158 Benchmark]: BuchiAutomizer took 3057.78ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 70.1MB in the beginning and 133.6MB in the end (delta: -63.5MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. [2025-04-26 16:26:03,607 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 155.2MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.36ms. Allocated memory is still 155.2MB. Free memory was 82.2MB in the beginning and 80.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.50ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 79.2MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 180.83ms. Allocated memory is still 155.2MB. Free memory was 79.2MB in the beginning and 70.3MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3057.78ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 70.1MB in the beginning and 133.6MB in the end (delta: -63.5MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 2644 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 153 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 69ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function w + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + w and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:26:03,618 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...