/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 --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:49:35,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:49:35,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:49:35,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:49:35,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:49:35,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:49:35,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:49:35,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:49:35,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:49:35,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:49:35,151 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:49:35,152 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:49:35,152 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:49:35,152 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:49:35,152 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:49:35,152 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:49:35,152 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:49:35,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:49:35,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:49:35,152 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:49:35,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:49:35,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:49:35,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:49:35,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:49:35,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:49:35,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:49:35,153 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:49:35,153 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:49:35,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:49:35,153 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:49:35,153 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:49:35,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:49:35,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:49:35,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:49:35,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:49:35,154 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:49:35,154 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:49:35,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:49:35,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:49:35,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:49:35,380 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:49:35,381 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:49:35,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_5.c.bpl [2025-02-17 22:49:35,382 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_5.c.bpl' [2025-02-17 22:49:35,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:49:35,394 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:49:35,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:35,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:49:35,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:49:35,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/1) ... [2025-02-17 22:49:35,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/1) ... [2025-02-17 22:49:35,410 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:49:35,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:35,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:49:35,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:49:35,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:49:35,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/1) ... [2025-02-17 22:49:35,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/1) ... [2025-02-17 22:49:35,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/1) ... [2025-02-17 22:49:35,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/1) ... [2025-02-17 22:49:35,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/1) ... [2025-02-17 22:49:35,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/1) ... [2025-02-17 22:49:35,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/1) ... [2025-02-17 22:49:35,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/1) ... [2025-02-17 22:49:35,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/1) ... [2025-02-17 22:49:35,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:49:35,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:49:35,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:49:35,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:49:35,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/1) ... [2025-02-17 22:49:35,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:35,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:35,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:35,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:49:35,487 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:49:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:49:35,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:49:35,487 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:49:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:49:35,488 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:49:35,488 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:49:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:49:35,488 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:49:35,488 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:49:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:49:35,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:49:35,488 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-02-17 22:49:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-17 22:49:35,488 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-17 22:49:35,488 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-02-17 22:49:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-17 22:49:35,488 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-17 22:49:35,489 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:49:35,523 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:49:35,525 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:49:35,593 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:49:35,594 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:49:35,604 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:49:35,604 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:49:35,605 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:35 BoogieIcfgContainer [2025-02-17 22:49:35,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:49:35,606 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:49:35,606 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:49:35,610 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:49:35,610 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:35,610 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:35" (1/2) ... [2025-02-17 22:49:35,611 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19963079 and model type indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:49:35, skipping insertion in model container [2025-02-17 22:49:35,611 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:35,611 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:35" (2/2) ... [2025-02-17 22:49:35,613 INFO L363 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_5.c.bpl [2025-02-17 22:49:35,674 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-02-17 22:49:35,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 42 transitions, 119 flow [2025-02-17 22:49:35,743 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-02-17 22:49:35,745 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-17 22:49:35,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 5/32 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-02-17 22:49:35,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 42 transitions, 119 flow [2025-02-17 22:49:35,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 32 transitions, 94 flow [2025-02-17 22:49:35,756 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:49:36,752 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:49:36,752 INFO L101 AmpleReduction]: Number of pruned transitions: 1300, Number of non-trivial ample sets: 4599 [2025-02-17 22:49:36,752 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 4298 [2025-02-17 22:49:36,764 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:49:36,764 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:49:36,764 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:49:36,764 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:49:36,764 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:49:36,764 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:49:36,764 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:49:36,765 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:49:36,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2101 states, 2100 states have (on average 4.269047619047619) internal successors, (8965), 2100 states have internal predecessors, (8965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:36,864 INFO L131 ngComponentsAnalysis]: Automaton has 375 accepting balls. 1935 [2025-02-17 22:49:36,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:36,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:36,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:49:36,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:36,871 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:49:36,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2101 states, 2100 states have (on average 4.269047619047619) internal successors, (8965), 2100 states have internal predecessors, (8965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:36,925 INFO L131 ngComponentsAnalysis]: Automaton has 375 accepting balls. 1935 [2025-02-17 22:49:36,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:36,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:36,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:49:36,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:36,931 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:49:36,932 INFO L754 eck$LassoCheckResult]: Loop: "[80] L27-->L29: 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[]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-02-17 22:49:36,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash 133, now seen corresponding path program 1 times [2025-02-17 22:49:36,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:36,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603383049] [2025-02-17 22:49:36,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:36,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:36,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:36,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:36,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:36,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:36,990 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:36,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:36,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:36,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:36,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:37,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:37,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:37,013 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-02-17 22:49:37,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:37,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223787249] [2025-02-17 22:49:37,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:37,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:37,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:37,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:37,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:37,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:37,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:37,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:37,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:37,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:37,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:37,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:37,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash 130375, now seen corresponding path program 1 times [2025-02-17 22:49:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:37,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433513079] [2025-02-17 22:49:37,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:37,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:37,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:37,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:37,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:37,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:37,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:37,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:37,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:37,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:37,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:37,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:37,074 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:37,075 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:37,075 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:37,075 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:37,075 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:37,075 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:37,075 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:37,075 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:37,075 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:37,075 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:37,075 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:37,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:37,141 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:37,142 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:37,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:37,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:37,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:37,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:49:37,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:37,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:37,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:37,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:37,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:37,198 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:37,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-17 22:49:37,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:37,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:37,273 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:37,278 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-02-17 22:49:37,279 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:37,279 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:37,279 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:37,279 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:37,279 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:37,279 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:37,279 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:37,279 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:37,279 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:37,279 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:37,279 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:37,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:37,304 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:37,307 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:37,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:37,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:37,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:37,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-17 22:49:37,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:49:37,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:37,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:37,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:37,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:37,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:37,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:37,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:37,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:37,347 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:37,348 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:37,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:37,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:37,353 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:37,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-17 22:49:37,355 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:37,355 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:37,356 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:37,356 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:49:37,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:37,367 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:37,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:37,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:37,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:37,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:37,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:37,404 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:37,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:37,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:37,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:37,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:37,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:37,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:37,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:37,461 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-02-17 22:49:37,469 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 2101 states, 2100 states have (on average 4.269047619047619) internal successors, (8965), 2100 states have internal predecessors, (8965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:37,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 2101 states, 2100 states have (on average 4.269047619047619) internal successors, (8965), 2100 states have internal predecessors, (8965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5860 states and 27279 transitions. Complement of second has 6 states. [2025-02-17 22:49:37,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:37,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-02-17 22:49:37,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 1 letters. Loop has 2 letters. [2025-02-17 22:49:37,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:37,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:37,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:37,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-17 22:49:37,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:37,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5860 states and 27279 transitions. [2025-02-17 22:49:37,858 INFO L131 ngComponentsAnalysis]: Automaton has 377 accepting balls. 1679 [2025-02-17 22:49:37,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:49:37,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5860 states to 4344 states and 20574 transitions. [2025-02-17 22:49:37,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1961 [2025-02-17 22:49:37,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3134 [2025-02-17 22:49:37,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4344 states and 20574 transitions. [2025-02-17 22:49:37,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:37,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4344 states and 20574 transitions. [2025-02-17 22:49:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4344 states and 20574 transitions. [2025-02-17 22:49:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4344 to 3174. [2025-02-17 22:49:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3174 states, 3174 states have (on average 4.863894139886578) internal successors, (15438), 3173 states have internal predecessors, (15438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 15438 transitions. [2025-02-17 22:49:38,152 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3174 states and 15438 transitions. [2025-02-17 22:49:38,152 INFO L432 stractBuchiCegarLoop]: Abstraction has 3174 states and 15438 transitions. [2025-02-17 22:49:38,153 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:49:38,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3174 states and 15438 transitions. [2025-02-17 22:49:38,171 INFO L131 ngComponentsAnalysis]: Automaton has 377 accepting balls. 1679 [2025-02-17 22:49:38,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:38,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:38,172 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:49:38,172 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:38,172 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[79] L27-->thread1FINAL: 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[]" "[81] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[105] L12-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-02-17 22:49:38,172 INFO L754 eck$LassoCheckResult]: Loop: "[84] L36-->L38: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[86] L38-->L36: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:38,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:38,173 INFO L85 PathProgramCache]: Analyzing trace with hash 4040738, now seen corresponding path program 1 times [2025-02-17 22:49:38,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:38,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427587638] [2025-02-17 22:49:38,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:38,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:38,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:38,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:38,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:38,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:38,177 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:38,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:38,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:38,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:38,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:38,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:38,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash 3651, now seen corresponding path program 1 times [2025-02-17 22:49:38,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:38,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960881657] [2025-02-17 22:49:38,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:38,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:38,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:38,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:38,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:38,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:38,188 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:38,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:38,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:38,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:38,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:38,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:38,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:38,192 INFO L85 PathProgramCache]: Analyzing trace with hash -411815388, now seen corresponding path program 1 times [2025-02-17 22:49:38,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:38,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045959762] [2025-02-17 22:49:38,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:38,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:38,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:38,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:38,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:38,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:38,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:38,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:38,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:38,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:38,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:38,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:38,261 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:38,261 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:38,261 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:38,261 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:38,261 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:38,261 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:38,262 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:38,262 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:38,262 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:38,262 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:38,262 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:38,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:38,283 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:38,283 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:38,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:38,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:38,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:38,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-17 22:49:38,289 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:38,289 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:38,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:49:38,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:38,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:38,310 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:38,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-17 22:49:38,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:38,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:38,390 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:38,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:38,395 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:38,396 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:38,396 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:38,396 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:38,396 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:38,396 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:38,396 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:38,396 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:38,396 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:38,396 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:38,396 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:38,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:38,417 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:38,418 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:38,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:38,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:38,420 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:38,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-17 22:49:38,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:49:38,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:38,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:38,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:38,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:38,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:38,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:38,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:38,441 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:38,445 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:38,445 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:38,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:38,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:38,447 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:38,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-17 22:49:38,450 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:38,450 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:38,450 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:38,451 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-02-17 22:49:38,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:49:38,458 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:38,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:38,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:38,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:38,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:38,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:38,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:38,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:38,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:38,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:38,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:38,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:38,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:38,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:38,508 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-02-17 22:49:38,509 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3174 states and 15438 transitions. cyclomatic complexity: 12746 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:38,733 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-02-17 22:49:38,751 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3174 states and 15438 transitions. cyclomatic complexity: 12746. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9584 states and 48680 transitions. Complement of second has 6 states. [2025-02-17 22:49:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-02-17 22:49:38,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:38,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:38,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:38,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:38,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:49:38,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:38,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9584 states and 48680 transitions. [2025-02-17 22:49:38,883 INFO L131 ngComponentsAnalysis]: Automaton has 370 accepting balls. 1390 [2025-02-17 22:49:38,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9584 states to 6945 states and 35982 transitions. [2025-02-17 22:49:38,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2487 [2025-02-17 22:49:39,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3701 [2025-02-17 22:49:39,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6945 states and 35982 transitions. [2025-02-17 22:49:39,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:39,013 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6945 states and 35982 transitions. [2025-02-17 22:49:39,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6945 states and 35982 transitions. [2025-02-17 22:49:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6945 to 5731. [2025-02-17 22:49:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5731 states, 5731 states have (on average 5.378991450008725) internal successors, (30827), 5730 states have internal predecessors, (30827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5731 states to 5731 states and 30827 transitions. [2025-02-17 22:49:39,217 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5731 states and 30827 transitions. [2025-02-17 22:49:39,217 INFO L432 stractBuchiCegarLoop]: Abstraction has 5731 states and 30827 transitions. [2025-02-17 22:49:39,217 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:39,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5731 states and 30827 transitions. [2025-02-17 22:49:39,257 INFO L131 ngComponentsAnalysis]: Automaton has 370 accepting balls. 1390 [2025-02-17 22:49:39,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:39,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:39,258 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:49:39,258 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:39,258 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] L27-->L29: 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[]" "[105] L12-->L36: 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]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[84] L36-->L38: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[108] L13-->L45: 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-02-17 22:49:39,258 INFO L754 eck$LassoCheckResult]: Loop: "[88] L45-->L47: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[90] L47-->L45: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-02-17 22:49:39,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:39,259 INFO L85 PathProgramCache]: Analyzing trace with hash -410198964, now seen corresponding path program 1 times [2025-02-17 22:49:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:39,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378846214] [2025-02-17 22:49:39,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:39,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:39,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:39,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:39,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:39,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:39,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:39,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:39,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:39,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:39,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:39,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:39,273 INFO L85 PathProgramCache]: Analyzing trace with hash 3779, now seen corresponding path program 1 times [2025-02-17 22:49:39,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:39,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481453696] [2025-02-17 22:49:39,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:39,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:39,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:39,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:39,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:39,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:39,279 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:39,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:39,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:39,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:39,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:39,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:39,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash 935789646, now seen corresponding path program 1 times [2025-02-17 22:49:39,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:39,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361058797] [2025-02-17 22:49:39,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:39,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:39,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:39,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:39,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:39,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:39,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:39,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:39,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:39,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:39,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:39,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:39,343 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:39,343 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:39,343 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:39,343 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:39,343 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:39,343 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:39,343 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:39,343 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:39,343 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:39,344 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:39,344 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:39,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:39,360 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:39,360 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:39,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:39,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:39,362 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:39,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-17 22:49:39,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:39,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:39,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:49:39,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:39,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:39,386 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:39,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-17 22:49:39,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:39,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:39,457 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:39,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:39,462 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:39,462 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:39,462 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:39,462 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:39,462 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:39,462 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:39,462 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:39,463 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:39,463 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:39,463 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:39,463 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:39,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:39,482 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:39,482 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:39,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:39,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:39,485 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:39,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-17 22:49:39,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:49:39,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:39,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:39,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:39,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:39,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:39,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:39,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:39,503 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:39,506 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:39,506 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:39,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:39,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:39,508 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:39,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-17 22:49:39,511 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:39,511 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:39,511 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:39,511 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:49:39,517 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-02-17 22:49:39,518 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:39,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:39,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:39,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:39,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:39,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:39,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:39,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:39,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:39,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:39,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:39,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:39,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:39,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:39,561 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-02-17 22:49:39,561 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5731 states and 30827 transitions. cyclomatic complexity: 25765 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:39,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5731 states and 30827 transitions. cyclomatic complexity: 25765. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17622 states and 97231 transitions. Complement of second has 6 states. [2025-02-17 22:49:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-02-17 22:49:39,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:39,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:49:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:39,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-17 22:49:39,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:39,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17622 states and 97231 transitions. [2025-02-17 22:49:39,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:49:40,185 INFO L131 ngComponentsAnalysis]: Automaton has 322 accepting balls. 1022 [2025-02-17 22:49:40,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17622 states to 12000 states and 67286 transitions. [2025-02-17 22:49:40,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3441 [2025-02-17 22:49:40,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4503 [2025-02-17 22:49:40,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12000 states and 67286 transitions. [2025-02-17 22:49:40,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:40,455 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12000 states and 67286 transitions. [2025-02-17 22:49:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12000 states and 67286 transitions. [2025-02-17 22:49:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12000 to 10325. [2025-02-17 22:49:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10325 states, 10325 states have (on average 5.778498789346247) internal successors, (59663), 10324 states have internal predecessors, (59663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10325 states to 10325 states and 59663 transitions. [2025-02-17 22:49:40,899 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10325 states and 59663 transitions. [2025-02-17 22:49:40,899 INFO L432 stractBuchiCegarLoop]: Abstraction has 10325 states and 59663 transitions. [2025-02-17 22:49:40,900 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:40,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10325 states and 59663 transitions. [2025-02-17 22:49:40,979 INFO L131 ngComponentsAnalysis]: Automaton has 322 accepting balls. 1022 [2025-02-17 22:49:40,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:40,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:40,980 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:40,980 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:49:40,980 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] L27-->L29: 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[]" "[105] L12-->L36: 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]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[84] L36-->L38: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[108] L13-->L45: 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]" "[111] L14-->L54: 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-02-17 22:49:40,980 INFO L754 eck$LassoCheckResult]: Loop: "[92] L54-->L56: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[94] L56-->L57: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" "[95] L57-->L54: Formula: (= v_x5_1 (+ v_x5_2 1)) InVars {x5=v_x5_2} OutVars{x5=v_x5_1} AuxVars[] AssignedVars[x5]" [2025-02-17 22:49:40,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:40,981 INFO L85 PathProgramCache]: Analyzing trace with hash 168734115, now seen corresponding path program 1 times [2025-02-17 22:49:40,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:40,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600344062] [2025-02-17 22:49:40,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:40,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:40,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:40,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:40,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:40,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:40,988 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:40,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:40,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:40,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:40,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:40,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:40,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash 121212, now seen corresponding path program 1 times [2025-02-17 22:49:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:40,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930056870] [2025-02-17 22:49:40,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:40,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:40,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:40,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:41,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:41,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:41,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:41,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:41,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:41,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:41,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:41,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:41,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1646375066, now seen corresponding path program 1 times [2025-02-17 22:49:41,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:41,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501310816] [2025-02-17 22:49:41,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:41,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:41,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:41,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:41,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:41,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:41,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:41,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:41,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:41,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:41,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:41,040 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:41,040 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:41,040 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:41,040 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:41,040 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:41,040 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:41,040 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:41,040 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:41,041 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:41,041 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:41,041 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:41,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:41,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:41,073 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:41,073 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:41,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:41,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:41,075 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-02-17 22:49:41,077 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-02-17 22:49:41,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:41,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:41,096 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-02-17 22:49:41,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:41,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:41,098 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-02-17 22:49:41,100 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-02-17 22:49:41,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:41,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:41,125 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:49:41,126 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x5=0} Honda state: {x5=0} Generalized eigenvectors: [{x5=-1}, {x5=2}, {x5=0}] Lambdas: [3, 1, 1] Nus: [1, 0] [2025-02-17 22:49:41,130 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-02-17 22:49:41,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:41,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:41,133 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-02-17 22:49:41,133 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-02-17 22:49:41,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:41,134 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:41,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:41,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:41,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:41,152 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-02-17 22:49:41,153 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-02-17 22:49:41,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:41,154 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:41,221 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:41,226 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-02-17 22:49:41,226 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:41,226 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:41,226 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:41,226 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:41,226 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:41,226 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:41,226 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:41,226 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:41,226 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:41,226 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:41,226 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:41,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:41,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:41,254 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:41,254 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:41,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:41,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:41,256 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:41,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-17 22:49:41,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:49:41,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:41,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:41,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:41,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:41,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:41,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:41,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:41,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:49:41,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:41,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:41,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:41,279 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:41,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-17 22:49:41,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:49:41,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:41,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:41,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:41,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:41,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:41,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:41,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:41,294 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:41,297 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:41,297 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:41,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:41,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:41,299 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:41,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:49:41,301 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:41,301 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:41,301 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:41,301 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:49:41,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-17 22:49:41,307 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:41,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:41,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:41,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:41,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:41,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:41,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:41,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:41,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:41,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:41,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:41,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:41,337 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:41,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:41,368 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:49:41,368 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10325 states and 59663 transitions. cyclomatic complexity: 50281 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:41,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10325 states and 59663 transitions. cyclomatic complexity: 50281. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28616 states and 165659 transitions. Complement of second has 6 states. [2025-02-17 22:49:41,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-02-17 22:49:41,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 7 letters. Loop has 3 letters. [2025-02-17 22:49:41,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:41,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 10 letters. Loop has 3 letters. [2025-02-17 22:49:41,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:41,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 7 letters. Loop has 6 letters. [2025-02-17 22:49:41,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:41,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28616 states and 165659 transitions. [2025-02-17 22:49:42,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:42,433 INFO L131 ngComponentsAnalysis]: Automaton has 370 accepting balls. 740 [2025-02-17 22:49:42,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28616 states to 16260 states and 95451 transitions. [2025-02-17 22:49:42,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4196 [2025-02-17 22:49:42,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4664 [2025-02-17 22:49:42,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16260 states and 95451 transitions. [2025-02-17 22:49:42,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:42,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16260 states and 95451 transitions. [2025-02-17 22:49:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16260 states and 95451 transitions. [2025-02-17 22:49:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16260 to 15099. [2025-02-17 22:49:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15099 states, 15099 states have (on average 5.927081263659845) internal successors, (89493), 15098 states have internal predecessors, (89493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15099 states to 15099 states and 89493 transitions. [2025-02-17 22:49:43,315 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15099 states and 89493 transitions. [2025-02-17 22:49:43,315 INFO L432 stractBuchiCegarLoop]: Abstraction has 15099 states and 89493 transitions. [2025-02-17 22:49:43,315 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:43,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15099 states and 89493 transitions. [2025-02-17 22:49:43,527 INFO L131 ngComponentsAnalysis]: Automaton has 370 accepting balls. 740 [2025-02-17 22:49:43,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:43,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:43,534 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:43,534 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:43,535 INFO L752 eck$LassoCheckResult]: Stem: "[102] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] L27-->L29: 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[]" "[105] L12-->L36: 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]" "[82] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[84] L36-->L38: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[108] L13-->L45: 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]" "[111] L14-->L54: 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]" "[114] L15-->L64: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" [2025-02-17 22:49:43,535 INFO L754 eck$LassoCheckResult]: Loop: "[97] L64-->L66: Formula: (< v_x5_3 v_z_9) InVars {x5=v_x5_3, z=v_z_9} OutVars{x5=v_x5_3, z=v_z_9} AuxVars[] AssignedVars[]" "[99] L66-->L64: Formula: (= (+ v_x5_5 1) v_x5_4) InVars {x5=v_x5_5} OutVars{x5=v_x5_4} AuxVars[] AssignedVars[x5]" [2025-02-17 22:49:43,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:43,536 INFO L85 PathProgramCache]: Analyzing trace with hash 935790383, now seen corresponding path program 1 times [2025-02-17 22:49:43,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:43,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488944220] [2025-02-17 22:49:43,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:43,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:43,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:43,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:43,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:43,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:43,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:43,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:43,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:43,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:43,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:43,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:43,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:43,566 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-02-17 22:49:43,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:43,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103611189] [2025-02-17 22:49:43,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:43,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:43,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:43,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:43,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:43,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:43,571 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:43,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:43,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:43,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:43,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:43,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:43,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1646396305, now seen corresponding path program 1 times [2025-02-17 22:49:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:43,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433474978] [2025-02-17 22:49:43,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:43,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:43,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:43,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:43,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:43,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:43,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:43,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:49:43,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:49:43,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:43,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:43,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:43,656 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:43,657 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:43,657 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:43,657 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:43,657 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:43,657 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:43,657 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:43,657 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:43,657 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:43,657 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:43,657 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:43,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:43,681 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:43,681 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:43,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:43,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:43,687 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:43,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-17 22:49:43,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:43,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:43,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:49:43,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:43,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:43,726 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:43,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-17 22:49:43,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:43,729 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:43,816 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:43,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:43,820 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:43,823 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:43,823 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:43,824 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:43,824 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:43,824 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:43,824 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:43,824 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:43,824 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_5.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:43,824 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:43,824 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:43,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:43,854 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:43,855 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:43,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:43,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:43,862 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:43,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-17 22:49:43,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:49:43,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:43,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:43,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:43,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:43,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:43,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:43,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:43,890 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:43,892 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:43,892 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:43,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:43,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:43,896 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:43,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-17 22:49:43,901 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:43,901 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:43,901 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:43,901 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, z) = -1*x5 + 1*z Supporting invariants [] [2025-02-17 22:49:43,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-17 22:49:43,910 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:43,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:43,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:43,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:43,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:43,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:43,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:43,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:43,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:43,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:43,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:43,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:43,962 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:43,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:43,975 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-02-17 22:49:43,975 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15099 states and 89493 transitions. cyclomatic complexity: 75821 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:44,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-17 22:49:44,697 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15099 states and 89493 transitions. cyclomatic complexity: 75821. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51826 states and 310102 transitions. Complement of second has 6 states. [2025-02-17 22:49:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-02-17 22:49:44,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:49:44,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:44,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:49:44,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:44,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:49:44,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:44,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51826 states and 310102 transitions. [2025-02-17 22:49:45,904 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:45,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51826 states to 0 states and 0 transitions. [2025-02-17 22:49:45,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:45,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:45,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:45,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:45,905 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:45,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:45,905 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:45,905 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:49:45,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:45,905 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:45,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:45,911 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:45 BoogieIcfgContainer [2025-02-17 22:49:45,911 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:45,912 INFO L158 Benchmark]: Toolchain (without parser) took 10517.72ms. Allocated memory was 159.4MB in the beginning and 1.0GB in the end (delta: 876.6MB). Free memory was 84.6MB in the beginning and 622.9MB in the end (delta: -538.2MB). Peak memory consumption was 341.9MB. Max. memory is 8.0GB. [2025-02-17 22:49:45,912 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:45,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.93ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 83.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:45,912 INFO L158 Benchmark]: Boogie Preprocessor took 19.98ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 82.6MB in the end (delta: 596.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:45,913 INFO L158 Benchmark]: RCFGBuilder took 172.06ms. Allocated memory is still 159.4MB. Free memory was 82.5MB in the beginning and 73.4MB in the end (delta: 9.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:49:45,913 INFO L158 Benchmark]: BuchiAutomizer took 10305.86ms. Allocated memory was 159.4MB in the beginning and 1.0GB in the end (delta: 876.6MB). Free memory was 73.2MB in the beginning and 622.9MB in the end (delta: -549.6MB). Peak memory consumption was 329.4MB. Max. memory is 8.0GB. [2025-02-17 22:49:45,914 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.14ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.93ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 83.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.98ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 82.6MB in the end (delta: 596.0kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 172.06ms. Allocated memory is still 159.4MB. Free memory was 82.5MB in the beginning and 73.4MB in the end (delta: 9.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 10305.86ms. Allocated memory was 159.4MB in the beginning and 1.0GB in the end (delta: 876.6MB). Free memory was 73.2MB in the beginning and 622.9MB in the end (delta: -549.6MB). Peak memory consumption was 329.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (0 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 1.5s AutomataMinimizationTime, 4 MinimizatonAttempts, 5220 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 3.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 287 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 282 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 126 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp94 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 48ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 1.0s InitialAbstraction: Time to compute Ample Reduction [ms]: 1052, Trivial Ample Sets caused by loops: 4298, Number of non-trivial ample sets: 4599, Number of pruned transitions: 1300, Number of transitions in reduction automaton: 8965, Number of states in reduction automaton: 2101, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:49:45,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...