/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/barrier-4t.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:49:06,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:49:06,428 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:06,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:49:06,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:49:06,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:49:06,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:49:06,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:49:06,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:49:06,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:49:06,455 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:49:06,455 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:49:06,455 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:49:06,455 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:49:06,455 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:49:06,455 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:49:06,455 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:49:06,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:49:06,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:49:06,456 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:49:06,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:49:06,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:49:06,457 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:49:06,457 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:06,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:49:06,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:49:06,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:49:06,686 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:49:06,687 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:49:06,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/barrier-4t.c.bpl [2025-02-17 22:49:06,688 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/barrier-4t.c.bpl' [2025-02-17 22:49:06,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:49:06,704 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:49:06,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:06,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:49:06,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:49:06,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/1) ... [2025-02-17 22:49:06,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/1) ... [2025-02-17 22:49:06,721 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:49:06,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:06,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:49:06,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:49:06,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:49:06,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/1) ... [2025-02-17 22:49:06,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/1) ... [2025-02-17 22:49:06,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/1) ... [2025-02-17 22:49:06,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/1) ... [2025-02-17 22:49:06,731 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/1) ... [2025-02-17 22:49:06,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/1) ... [2025-02-17 22:49:06,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/1) ... [2025-02-17 22:49:06,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/1) ... [2025-02-17 22:49:06,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/1) ... [2025-02-17 22:49:06,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:49:06,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:49:06,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:49:06,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:49:06,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/1) ... [2025-02-17 22:49:06,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:06,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:06,767 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:06,771 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:06,786 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:49:06,786 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:49:06,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:49:06,786 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:49:06,786 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:49:06,786 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:49:06,787 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:49:06,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:49:06,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:49:06,787 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:49:06,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:49:06,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:49:06,787 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-02-17 22:49:06,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-17 22:49:06,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-17 22:49:06,788 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:06,823 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:49:06,824 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:49:06,934 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:49:06,934 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:49:06,948 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:49:06,948 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:49:06,950 INFO L201 PluginConnector]: Adding new model barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:06 BoogieIcfgContainer [2025-02-17 22:49:06,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:49:06,950 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:49:06,950 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:49:06,957 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:49:06,957 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:06,958 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:06" (1/2) ... [2025-02-17 22:49:06,959 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10859603 and model type barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:49:06, skipping insertion in model container [2025-02-17 22:49:06,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:06,960 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:06" (2/2) ... [2025-02-17 22:49:06,961 INFO L363 chiAutomizerObserver]: Analyzing ICFG barrier-4t.c.bpl [2025-02-17 22:49:07,032 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-17 22:49:07,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 136 flow [2025-02-17 22:49:07,084 INFO L124 PetriNetUnfolderBase]: 8/46 cut-off events. [2025-02-17 22:49:07,085 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-17 22:49:07,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 8/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 114 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-02-17 22:49:07,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 54 transitions, 136 flow [2025-02-17 22:49:07,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 46 transitions, 116 flow [2025-02-17 22:49:07,095 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:49:08,743 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:49:08,743 INFO L101 AmpleReduction]: Number of pruned transitions: 6612, Number of non-trivial ample sets: 8232 [2025-02-17 22:49:08,743 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 6581 [2025-02-17 22:49:08,753 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:49:08,754 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:49:08,754 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:49:08,754 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:49:08,754 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:49:08,754 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:49:08,754 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:49:08,754 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:49:08,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5010 states, 5009 states have (on average 3.1157915751647036) internal successors, (15607), 5009 states have internal predecessors, (15607), 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:08,877 INFO L131 ngComponentsAnalysis]: Automaton has 859 accepting balls. 3316 [2025-02-17 22:49:08,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:08,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:08,884 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:08,884 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:08,885 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:49:08,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5010 states, 5009 states have (on average 3.1157915751647036) internal successors, (15607), 5009 states have internal predecessors, (15607), 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:08,967 INFO L131 ngComponentsAnalysis]: Automaton has 859 accepting balls. 3316 [2025-02-17 22:49:08,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:08,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:08,967 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:08,967 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:08,972 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:49:08,972 INFO L754 eck$LassoCheckResult]: Loop: "[121] L26-->L28: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[123] L28-->L26: 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:08,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:08,976 INFO L85 PathProgramCache]: Analyzing trace with hash 4591, now seen corresponding path program 1 times [2025-02-17 22:49:08,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:08,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415754325] [2025-02-17 22:49:08,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:08,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:09,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:09,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:09,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash 4835, now seen corresponding path program 1 times [2025-02-17 22:49:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:09,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475032353] [2025-02-17 22:49:09,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:09,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:09,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:09,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash 4415825, now seen corresponding path program 1 times [2025-02-17 22:49:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:09,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246694477] [2025-02-17 22:49:09,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:09,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:09,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:09,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:09,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:09,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:09,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:09,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:09,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:09,120 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:09,121 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:09,121 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:09,121 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:09,121 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:09,121 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,121 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:09,121 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:09,121 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:09,121 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:09,121 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:09,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:09,204 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:09,205 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:09,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,218 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:09,243 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:09,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:09,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:09,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:49:09,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,271 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:09,272 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:09,274 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:09,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:09,347 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:09,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-17 22:49:09,352 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:09,352 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:09,352 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:09,352 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:09,352 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:09,352 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,352 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:09,352 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:09,352 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:09,352 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:09,352 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:09,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:09,373 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:09,376 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:09,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,379 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:09,381 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:09,382 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:09,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:09,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:09,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:09,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:09,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:09,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:09,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:09,404 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:09,409 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:09,409 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:09,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:09,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:09,413 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:09,415 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:09,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:09,416 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:09,416 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:09,416 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:49:09,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-17 22:49:09,426 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:09,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:09,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:09,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:09,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:09,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:09,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:09,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:09,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:09,471 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:09,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:09,487 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:09,509 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:09,526 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 5010 states, 5009 states have (on average 3.1157915751647036) internal successors, (15607), 5009 states have internal predecessors, (15607), 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.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:09,979 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:10,009 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 5010 states, 5009 states have (on average 3.1157915751647036) internal successors, (15607), 5009 states have internal predecessors, (15607), 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.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 16234 states and 55184 transitions. Complement of second has 7 states. [2025-02-17 22:49:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-02-17 22:49:10,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 164 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:49:10,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:10,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 164 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:10,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:10,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 164 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:49:10,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:10,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16234 states and 55184 transitions. [2025-02-17 22:49:10,217 INFO L131 ngComponentsAnalysis]: Automaton has 1201 accepting balls. 3600 [2025-02-17 22:49:10,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16234 states to 13028 states and 45359 transitions. [2025-02-17 22:49:10,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5499 [2025-02-17 22:49:10,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7702 [2025-02-17 22:49:10,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13028 states and 45359 transitions. [2025-02-17 22:49:10,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:10,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13028 states and 45359 transitions. [2025-02-17 22:49:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13028 states and 45359 transitions. [2025-02-17 22:49:10,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13028 to 10827. [2025-02-17 22:49:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10827 states, 10827 states have (on average 3.540870047104461) internal successors, (38337), 10826 states have internal predecessors, (38337), 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:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10827 states to 10827 states and 38337 transitions. [2025-02-17 22:49:10,876 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10827 states and 38337 transitions. [2025-02-17 22:49:10,876 INFO L432 stractBuchiCegarLoop]: Abstraction has 10827 states and 38337 transitions. [2025-02-17 22:49:10,876 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:49:10,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10827 states and 38337 transitions. [2025-02-17 22:49:11,045 INFO L131 ngComponentsAnalysis]: Automaton has 1201 accepting balls. 3600 [2025-02-17 22:49:11,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:11,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:11,050 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:49:11,050 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:11,051 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: 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:11,051 INFO L754 eck$LassoCheckResult]: Loop: "[130] L41-->L43: Formula: (< v_x3_5 v_z_5) InVars {x3=v_x3_5, z=v_z_5} OutVars{x3=v_x3_5, z=v_z_5} AuxVars[] AssignedVars[]" "[132] L43-->L41: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-02-17 22:49:11,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:11,055 INFO L85 PathProgramCache]: Analyzing trace with hash 142482, now seen corresponding path program 1 times [2025-02-17 22:49:11,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:11,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693715868] [2025-02-17 22:49:11,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:11,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:11,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:11,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:11,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:11,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:11,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:11,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:11,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:11,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:11,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:11,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:11,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash 5123, now seen corresponding path program 1 times [2025-02-17 22:49:11,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:11,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481099617] [2025-02-17 22:49:11,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:11,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:11,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:11,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:11,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:11,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:11,081 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:11,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:11,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:11,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:11,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:11,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:11,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:11,088 INFO L85 PathProgramCache]: Analyzing trace with hash 136929364, now seen corresponding path program 1 times [2025-02-17 22:49:11,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:11,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079729022] [2025-02-17 22:49:11,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:11,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:11,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:11,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:11,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:11,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:11,092 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:11,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:11,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:11,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:11,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:11,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:11,114 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:11,114 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:11,114 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:11,114 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:11,114 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:11,114 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:11,114 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:11,114 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:11,114 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:11,114 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:11,114 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:11,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:11,129 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:11,129 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:11,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:11,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:11,132 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:11,133 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:11,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:11,134 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:11,150 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:11,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:11,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:11,152 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:11,154 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:11,155 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:11,155 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:11,222 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:11,226 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:11,226 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:11,226 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:11,226 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:11,226 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:11,226 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:11,227 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:11,227 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:11,227 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:11,227 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:11,227 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:11,227 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:11,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:11,256 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:11,256 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:11,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:11,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:11,259 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:11,260 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:11,261 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:11,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:11,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:11,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:11,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:11,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:11,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:11,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:11,277 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:11,279 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:11,280 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:11,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:11,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:11,282 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:11,283 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:11,284 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:11,284 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:11,284 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:11,284 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-02-17 22:49:11,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:11,291 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:11,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:11,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:11,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:11,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:11,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:11,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:11,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:11,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:11,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:11,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:11,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:11,325 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:11,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:11,339 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:11,339 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:11,340 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10827 states and 38337 transitions. cyclomatic complexity: 29498 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:11,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:11,850 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10827 states and 38337 transitions. cyclomatic complexity: 29498. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 38250 states and 143976 transitions. Complement of second has 7 states. [2025-02-17 22:49:11,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:11,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-02-17 22:49:11,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:11,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:11,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:11,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:11,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:49:11,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:11,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38250 states and 143976 transitions. [2025-02-17 22:49:12,381 INFO L131 ngComponentsAnalysis]: Automaton has 1282 accepting balls. 3122 [2025-02-17 22:49:12,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38250 states to 27077 states and 103926 transitions. [2025-02-17 22:49:12,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7735 [2025-02-17 22:49:12,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10604 [2025-02-17 22:49:12,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27077 states and 103926 transitions. [2025-02-17 22:49:12,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:12,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27077 states and 103926 transitions. [2025-02-17 22:49:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27077 states and 103926 transitions. [2025-02-17 22:49:13,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27077 to 24213. [2025-02-17 22:49:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24213 states, 24213 states have (on average 3.933919795151365) internal successors, (95252), 24212 states have internal predecessors, (95252), 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:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24213 states to 24213 states and 95252 transitions. [2025-02-17 22:49:13,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24213 states and 95252 transitions. [2025-02-17 22:49:13,737 INFO L432 stractBuchiCegarLoop]: Abstraction has 24213 states and 95252 transitions. [2025-02-17 22:49:13,737 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:13,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24213 states and 95252 transitions. [2025-02-17 22:49:14,052 INFO L131 ngComponentsAnalysis]: Automaton has 1282 accepting balls. 3122 [2025-02-17 22:49:14,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:14,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:14,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:49:14,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:14,053 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: 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]" "[164] L14-->L56: 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:14,053 INFO L754 eck$LassoCheckResult]: Loop: "[139] L56-->L58: Formula: (< v_x4_5 v_z_9) InVars {x4=v_x4_5, z=v_z_9} OutVars{x4=v_x4_5, z=v_z_9} AuxVars[] AssignedVars[]" "[141] L58-->L56: Formula: (= v_x4_6 (+ v_x4_7 1)) InVars {x4=v_x4_7} OutVars{x4=v_x4_6} AuxVars[] AssignedVars[x4]" [2025-02-17 22:49:14,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash 4417106, now seen corresponding path program 1 times [2025-02-17 22:49:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:14,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753049936] [2025-02-17 22:49:14,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:14,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:14,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:14,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:14,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:14,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:14,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:14,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:14,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,061 INFO L85 PathProgramCache]: Analyzing trace with hash 5411, now seen corresponding path program 1 times [2025-02-17 22:49:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:14,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876369524] [2025-02-17 22:49:14,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:14,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:14,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:14,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:14,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,066 INFO L85 PathProgramCache]: Analyzing trace with hash -50123980, now seen corresponding path program 1 times [2025-02-17 22:49:14,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:14,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515389857] [2025-02-17 22:49:14,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:14,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:14,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:14,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:14,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:14,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:14,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:14,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:14,091 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:14,092 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:14,092 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:14,092 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:14,092 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:14,092 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,092 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:14,092 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:14,092 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:14,092 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:14,092 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:14,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:14,108 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:14,108 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:14,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,110 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:14,112 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:14,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:14,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:14,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:14,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,131 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:14,131 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:14,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:14,134 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:14,199 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:14,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-17 22:49:14,204 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:14,204 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:14,204 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:14,204 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:14,204 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:14,204 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,204 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:14,204 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:14,204 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:14,204 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:14,204 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:14,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:14,222 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:14,223 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:14,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,226 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:14,227 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:14,229 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:14,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:14,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:14,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:14,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:14,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:14,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:14,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:14,243 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:14,248 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:14,248 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:14,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,251 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:14,252 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:14,253 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:14,253 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:14,253 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:14,253 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:49:14,259 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:14,260 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:14,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:14,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:14,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:14,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:14,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:14,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:14,284 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:14,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:14,294 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:14,295 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:14,295 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24213 states and 95252 transitions. cyclomatic complexity: 74816 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:14,792 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:15,284 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24213 states and 95252 transitions. cyclomatic complexity: 74816. 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 86796 states and 351988 transitions. Complement of second has 7 states. [2025-02-17 22:49:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:15,286 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:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2025-02-17 22:49:15,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 174 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:15,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:15,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 174 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:15,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:15,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 174 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:49:15,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:15,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86796 states and 351988 transitions. [2025-02-17 22:49:16,531 INFO L131 ngComponentsAnalysis]: Automaton has 996 accepting balls. 2120 [2025-02-17 22:49:17,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86796 states to 55950 states and 230618 transitions. [2025-02-17 22:49:17,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12192 [2025-02-17 22:49:17,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14703 [2025-02-17 22:49:17,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55950 states and 230618 transitions. [2025-02-17 22:49:17,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:17,629 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55950 states and 230618 transitions. [2025-02-17 22:49:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55950 states and 230618 transitions. [2025-02-17 22:49:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55950 to 51617. [2025-02-17 22:49:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51617 states, 51617 states have (on average 4.196815002809152) internal successors, (216627), 51616 states have internal predecessors, (216627), 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:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51617 states to 51617 states and 216627 transitions. [2025-02-17 22:49:19,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51617 states and 216627 transitions. [2025-02-17 22:49:19,333 INFO L432 stractBuchiCegarLoop]: Abstraction has 51617 states and 216627 transitions. [2025-02-17 22:49:19,337 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:19,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51617 states and 216627 transitions. [2025-02-17 22:49:19,853 INFO L131 ngComponentsAnalysis]: Automaton has 996 accepting balls. 2120 [2025-02-17 22:49:19,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:19,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:19,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:49:19,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:19,855 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: 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]" "[164] L14-->L56: 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]" "[167] L15-->L71: 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:19,855 INFO L754 eck$LassoCheckResult]: Loop: "[148] L71-->L73: Formula: (< v_x5_5 v_z_15) InVars {x5=v_x5_5, z=v_z_15} OutVars{x5=v_x5_5, z=v_z_15} AuxVars[] AssignedVars[]" "[150] L73-->L71: Formula: (= v_x5_6 (+ v_x5_7 1)) InVars {x5=v_x5_7} OutVars{x5=v_x5_6} AuxVars[] AssignedVars[x5]" [2025-02-17 22:49:19,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:19,856 INFO L85 PathProgramCache]: Analyzing trace with hash 136930453, now seen corresponding path program 1 times [2025-02-17 22:49:19,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:19,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682482299] [2025-02-17 22:49:19,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:19,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:19,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:19,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:19,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,861 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:19,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:19,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:19,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:19,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash 5699, now seen corresponding path program 1 times [2025-02-17 22:49:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:19,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129457731] [2025-02-17 22:49:19,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:19,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:19,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:19,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:19,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:19,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:19,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:19,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:19,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1553816105, now seen corresponding path program 1 times [2025-02-17 22:49:19,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:19,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989824787] [2025-02-17 22:49:19,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:19,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:19,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:19,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:19,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:19,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:19,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:19,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:19,894 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:19,894 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:19,895 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:19,895 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:19,895 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:19,895 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,895 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:19,895 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:19,895 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:19,895 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:19,895 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:19,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:19,911 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:19,911 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:19,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:19,913 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:19,914 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:19,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:19,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:19,931 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:19,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:19,934 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:19,934 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:19,936 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:19,936 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:20,003 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:20,008 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:20,008 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:20,008 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:20,008 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:20,008 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:20,008 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:20,008 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:20,008 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:20,008 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:20,008 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:20,009 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:20,009 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:20,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:20,032 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:20,032 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:20,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:20,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:20,035 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:20,036 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:20,038 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:20,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:20,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:20,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:20,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:20,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:20,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:20,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:20,051 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:20,054 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:20,054 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:20,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:20,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:20,056 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:20,057 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:20,058 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:20,058 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:20,058 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:20,058 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-02-17 22:49:20,064 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:20,065 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:20,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:20,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:20,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:20,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:20,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:20,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:20,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:20,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:20,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:20,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:20,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:20,091 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:20,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:20,101 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:20,102 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:20,102 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51617 states and 216627 transitions. cyclomatic complexity: 171871 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:20,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:22,086 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51617 states and 216627 transitions. cyclomatic complexity: 171871. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 168169 states and 714093 transitions. Complement of second has 7 states. [2025-02-17 22:49:22,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-02-17 22:49:22,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:22,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:22,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:49:22,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:22,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:49:22,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:22,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168169 states and 714093 transitions. [2025-02-17 22:49:24,943 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 128 [2025-02-17 22:49:24,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168169 states to 3210 states and 10383 transitions. [2025-02-17 22:49:24,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 925 [2025-02-17 22:49:24,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 925 [2025-02-17 22:49:24,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3210 states and 10383 transitions. [2025-02-17 22:49:24,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:24,963 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3210 states and 10383 transitions. [2025-02-17 22:49:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states and 10383 transitions. [2025-02-17 22:49:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 3209. [2025-02-17 22:49:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3209 states, 3209 states have (on average 3.2352757868494857) internal successors, (10382), 3208 states have internal predecessors, (10382), 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:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3209 states to 3209 states and 10382 transitions. [2025-02-17 22:49:25,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3209 states and 10382 transitions. [2025-02-17 22:49:25,007 INFO L432 stractBuchiCegarLoop]: Abstraction has 3209 states and 10382 transitions. [2025-02-17 22:49:25,007 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:25,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3209 states and 10382 transitions. [2025-02-17 22:49:25,020 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 128 [2025-02-17 22:49:25,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:25,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:25,020 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:49:25,020 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:25,021 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[120] L26-->L30: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[122] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[124] L31-->L32-1: Formula: (<= 4 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-02-17 22:49:25,021 INFO L754 eck$LassoCheckResult]: Loop: "[126] L32-1-->L34: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[128] L34-->L32-1: 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:25,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash 136889707, now seen corresponding path program 1 times [2025-02-17 22:49:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979777622] [2025-02-17 22:49:25,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:25,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:25,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:25,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:25,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:25,063 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:25,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:25,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979777622] [2025-02-17 22:49:25,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979777622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:25,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:25,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:49:25,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890696276] [2025-02-17 22:49:25,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:25,070 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:25,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:25,070 INFO L85 PathProgramCache]: Analyzing trace with hash 4995, now seen corresponding path program 1 times [2025-02-17 22:49:25,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:25,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635306345] [2025-02-17 22:49:25,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:25,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:25,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:25,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:25,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:25,074 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:25,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:25,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:25,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:25,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:25,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:25,089 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:25,089 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:25,089 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:25,089 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:25,089 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:25,089 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:25,089 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:25,089 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:25,089 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:25,089 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:25,089 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:25,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:25,104 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:25,104 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:25,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:25,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:25,106 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:25,108 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:25,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:25,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:25,124 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:25,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:25,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:25,126 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:25,128 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:25,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:25,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:25,191 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:25,195 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:25,195 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:25,195 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:25,195 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:25,195 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:25,195 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:25,195 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:25,195 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:25,195 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:25,195 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:25,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:25,196 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:25,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:25,213 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:25,213 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:25,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:25,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:25,215 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:25,216 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:25,217 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:25,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:25,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:25,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:25,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:25,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:25,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:25,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:25,230 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:25,232 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:25,232 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:25,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:25,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:25,234 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:25,240 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:25,240 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:25,240 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:25,240 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:49:25,240 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:25,245 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:25,246 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:25,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:25,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:25,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:25,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:25,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:25,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:25,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:25,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:25,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:25,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:25,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:25,271 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:25,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:25,280 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:25,281 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:25,281 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3209 states and 10382 transitions. cyclomatic complexity: 7618 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:25,400 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3209 states and 10382 transitions. cyclomatic complexity: 7618. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 6905 states and 23826 transitions. Complement of second has 7 states. [2025-02-17 22:49:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-02-17 22:49:25,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:25,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:25,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:49:25,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:25,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:49:25,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:25,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6905 states and 23826 transitions. [2025-02-17 22:49:25,459 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 128 [2025-02-17 22:49:25,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6905 states to 4262 states and 13911 transitions. [2025-02-17 22:49:25,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 964 [2025-02-17 22:49:25,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1141 [2025-02-17 22:49:25,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4262 states and 13911 transitions. [2025-02-17 22:49:25,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:25,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4262 states and 13911 transitions. [2025-02-17 22:49:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states and 13911 transitions. [2025-02-17 22:49:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 3305. [2025-02-17 22:49:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 3305 states have (on average 3.243267776096823) internal successors, (10719), 3304 states have internal predecessors, (10719), 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:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 10719 transitions. [2025-02-17 22:49:25,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3305 states and 10719 transitions. [2025-02-17 22:49:25,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:25,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:49:25,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:49:25,546 INFO L87 Difference]: Start difference. First operand 3305 states and 10719 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:25,594 INFO L93 Difference]: Finished difference Result 2119 states and 6661 transitions. [2025-02-17 22:49:25,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2119 states and 6661 transitions. [2025-02-17 22:49:25,605 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 108 [2025-02-17 22:49:25,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2119 states to 2109 states and 6615 transitions. [2025-02-17 22:49:25,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 600 [2025-02-17 22:49:25,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 600 [2025-02-17 22:49:25,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2109 states and 6615 transitions. [2025-02-17 22:49:25,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:25,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2109 states and 6615 transitions. [2025-02-17 22:49:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states and 6615 transitions. [2025-02-17 22:49:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2109. [2025-02-17 22:49:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2109 states, 2109 states have (on average 3.136557610241821) internal successors, (6615), 2108 states have internal predecessors, (6615), 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:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 6615 transitions. [2025-02-17 22:49:25,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2109 states and 6615 transitions. [2025-02-17 22:49:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-17 22:49:25,640 INFO L432 stractBuchiCegarLoop]: Abstraction has 2109 states and 6615 transitions. [2025-02-17 22:49:25,640 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:49:25,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2109 states and 6615 transitions. [2025-02-17 22:49:25,647 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 108 [2025-02-17 22:49:25,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:25,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:25,648 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:25,648 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:25,648 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: 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]" "[129] L41-->L45: Formula: (<= v_z_6 v_x3_8) InVars {x3=v_x3_8, z=v_z_6} OutVars{x3=v_x3_8, z=v_z_6} AuxVars[] AssignedVars[]" "[131] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[120] L26-->L30: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[122] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[133] L46-->L47-1: Formula: (<= 4 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-02-17 22:49:25,648 INFO L754 eck$LassoCheckResult]: Loop: "[135] L47-1-->L49: 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[]" "[137] L49-->L47-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-02-17 22:49:25,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:25,649 INFO L85 PathProgramCache]: Analyzing trace with hash -957082353, now seen corresponding path program 1 times [2025-02-17 22:49:25,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:25,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318043019] [2025-02-17 22:49:25,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:25,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:25,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:25,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:25,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:25,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:25,689 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:25,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:25,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318043019] [2025-02-17 22:49:25,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318043019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:25,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:25,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:49:25,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966200566] [2025-02-17 22:49:25,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:25,690 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:25,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash 5283, now seen corresponding path program 1 times [2025-02-17 22:49:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:25,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732788780] [2025-02-17 22:49:25,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:25,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:25,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:25,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:25,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:25,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:25,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:25,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:25,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:25,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:25,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:25,716 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:25,716 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:25,716 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:25,716 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:25,716 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:25,716 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:25,716 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:25,716 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:25,716 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:49:25,716 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:25,716 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:25,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:25,732 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:25,732 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:25,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:25,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:25,735 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:25,736 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:25,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:25,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:25,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-17 22:49:25,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:25,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:25,757 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:25,758 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:25,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:25,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:25,827 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:25,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:25,831 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:25,831 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:25,831 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:25,831 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:25,831 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:25,831 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:25,831 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:25,831 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:25,831 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:49:25,831 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:25,831 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:25,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:25,864 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:25,864 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:25,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:25,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:25,867 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:25,868 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:25,869 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:25,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:25,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:25,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:25,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:25,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:25,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:25,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:25,882 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:25,885 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:25,887 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:25,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:25,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:25,890 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:25,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-17 22:49:25,893 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:25,893 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:25,893 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:25,894 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:49:25,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:25,901 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:25,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:25,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:25,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:25,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:25,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:25,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:25,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:25,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:25,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:25,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:25,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:25,936 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:25,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:25,946 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:25,947 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:25,947 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2109 states and 6615 transitions. cyclomatic complexity: 4829 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:26,112 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2109 states and 6615 transitions. cyclomatic complexity: 4829. 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 4267 states and 14031 transitions. Complement of second has 7 states. [2025-02-17 22:49:26,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:26,113 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:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2025-02-17 22:49:26,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:49:26,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:26,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:49:26,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:26,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:49:26,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:26,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4267 states and 14031 transitions. [2025-02-17 22:49:26,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:26,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:26,137 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 102 [2025-02-17 22:49:26,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4267 states to 2724 states and 8383 transitions. [2025-02-17 22:49:26,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 643 [2025-02-17 22:49:26,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 766 [2025-02-17 22:49:26,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2724 states and 8383 transitions. [2025-02-17 22:49:26,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:26,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2724 states and 8383 transitions. [2025-02-17 22:49:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states and 8383 transitions. [2025-02-17 22:49:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 2182. [2025-02-17 22:49:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2182 states have (on average 3.130614115490376) internal successors, (6831), 2181 states have internal predecessors, (6831), 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:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 6831 transitions. [2025-02-17 22:49:26,175 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2182 states and 6831 transitions. [2025-02-17 22:49:26,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:26,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-17 22:49:26,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-17 22:49:26,175 INFO L87 Difference]: Start difference. First operand 2182 states and 6831 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:26,206 INFO L93 Difference]: Finished difference Result 863 states and 2530 transitions. [2025-02-17 22:49:26,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 863 states and 2530 transitions. [2025-02-17 22:49:26,210 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-02-17 22:49:26,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 863 states to 730 states and 2092 transitions. [2025-02-17 22:49:26,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2025-02-17 22:49:26,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2025-02-17 22:49:26,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 730 states and 2092 transitions. [2025-02-17 22:49:26,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:26,212 INFO L218 hiAutomatonCegarLoop]: Abstraction has 730 states and 2092 transitions. [2025-02-17 22:49:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states and 2092 transitions. [2025-02-17 22:49:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2025-02-17 22:49:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 730 states have (on average 2.8657534246575342) internal successors, (2092), 729 states have internal predecessors, (2092), 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:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 2092 transitions. [2025-02-17 22:49:26,219 INFO L240 hiAutomatonCegarLoop]: Abstraction has 730 states and 2092 transitions. [2025-02-17 22:49:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-17 22:49:26,220 INFO L432 stractBuchiCegarLoop]: Abstraction has 730 states and 2092 transitions. [2025-02-17 22:49:26,220 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:49:26,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 730 states and 2092 transitions. [2025-02-17 22:49:26,222 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-02-17 22:49:26,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:26,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:26,222 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:26,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:26,222 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: 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]" "[129] L41-->L45: Formula: (<= v_z_6 v_x3_8) InVars {x3=v_x3_8, z=v_z_6} OutVars{x3=v_x3_8, z=v_z_6} AuxVars[] AssignedVars[]" "[131] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[164] L14-->L56: 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]" "[120] L26-->L30: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[122] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[138] L56-->L60: Formula: (<= v_z_10 v_x4_8) InVars {x4=v_x4_8, z=v_z_10} OutVars{x4=v_x4_8, z=v_z_10} AuxVars[] AssignedVars[]" "[140] L60-->L61: Formula: (= v_x2_7 (+ v_x2_8 1)) InVars {x2=v_x2_8} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[142] L61-->L62-1: Formula: (<= 4 v_x2_9) InVars {x2=v_x2_9} OutVars{x2=v_x2_9} AuxVars[] AssignedVars[]" [2025-02-17 22:49:26,222 INFO L754 eck$LassoCheckResult]: Loop: "[144] L62-1-->L64: Formula: (< v_x5_1 v_z_11) InVars {x5=v_x5_1, z=v_z_11} OutVars{x5=v_x5_1, z=v_z_11} AuxVars[] AssignedVars[]" "[146] L64-->L62-1: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-02-17 22:49:26,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1189822374, now seen corresponding path program 1 times [2025-02-17 22:49:26,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:26,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936754634] [2025-02-17 22:49:26,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:26,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:26,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:49:26,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:49:26,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:26,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:26,266 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:26,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:26,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936754634] [2025-02-17 22:49:26,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936754634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:26,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:26,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-17 22:49:26,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22727783] [2025-02-17 22:49:26,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:26,267 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:26,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:26,267 INFO L85 PathProgramCache]: Analyzing trace with hash 5571, now seen corresponding path program 1 times [2025-02-17 22:49:26,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:26,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967128129] [2025-02-17 22:49:26,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:26,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:26,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:26,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:26,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:26,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:26,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:26,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:26,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:26,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:26,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:26,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:26,290 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:26,290 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:26,290 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:26,290 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:26,290 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:26,290 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:26,290 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:26,290 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:26,290 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration7_Loop [2025-02-17 22:49:26,290 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:26,290 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:26,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:26,303 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:26,303 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:26,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:26,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:26,310 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:26,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-17 22:49:26,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:26,312 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:26,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:26,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:26,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:26,329 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:26,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-17 22:49:26,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:26,331 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:26,389 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:26,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-17 22:49:26,394 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:26,394 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:26,394 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:26,394 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:26,394 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:26,394 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:26,394 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:26,394 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:26,394 INFO L132 ssoRankerPreferences]: Filename of dumped script: barrier-4t.c.bpl_petrified1_Iteration7_Loop [2025-02-17 22:49:26,394 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:26,394 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:26,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:26,405 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:26,406 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:26,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:26,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:26,408 INFO L229 MonitoredProcess]: Starting monitored process 28 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:26,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-17 22:49:26,409 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:26,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:26,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:26,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:26,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:26,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:26,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:26,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:26,421 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:26,423 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:26,423 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:26,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:26,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:26,425 INFO L229 MonitoredProcess]: Starting monitored process 29 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:26,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-17 22:49:26,426 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:26,426 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:26,426 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:26,426 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, z) = -1*x5 + 1*z Supporting invariants [] [2025-02-17 22:49:26,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-17 22:49:26,431 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:26,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:26,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:49:26,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:49:26,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:26,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:26,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:26,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:26,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:26,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:26,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:26,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:26,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:26,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:26,477 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:26,478 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:26,478 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 730 states and 2092 transitions. cyclomatic complexity: 1466 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:26,510 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 730 states and 2092 transitions. cyclomatic complexity: 1466. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 1153 states and 3446 transitions. Complement of second has 6 states. [2025-02-17 22:49:26,511 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:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-17 22:49:26,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-17 22:49:26,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:26,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 13 letters. Loop has 2 letters. [2025-02-17 22:49:26,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:26,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-17 22:49:26,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:26,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1153 states and 3446 transitions. [2025-02-17 22:49:26,518 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:26,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1153 states to 0 states and 0 transitions. [2025-02-17 22:49:26,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:26,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:26,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:26,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:26,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:26,518 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:26,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:26,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-17 22:49:26,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-17 22:49:26,519 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:26,519 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-02-17 22:49:26,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-02-17 22:49:26,519 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:26,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-02-17 22:49:26,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:26,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:26,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:26,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:26,519 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:26,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:26,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-17 22:49:26,519 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:26,519 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-17 22:49:26,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:26,519 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:26,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:26,525 INFO L201 PluginConnector]: Adding new model barrier-4t.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:26 BoogieIcfgContainer [2025-02-17 22:49:26,525 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:26,525 INFO L158 Benchmark]: Toolchain (without parser) took 19821.34ms. Allocated memory was 163.6MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 90.9MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-02-17 22:49:26,525 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:26,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.64ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 89.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:26,526 INFO L158 Benchmark]: Boogie Preprocessor took 15.47ms. Allocated memory is still 163.6MB. Free memory was 89.5MB in the beginning and 88.8MB in the end (delta: 683.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:26,526 INFO L158 Benchmark]: RCFGBuilder took 209.80ms. Allocated memory is still 163.6MB. Free memory was 88.8MB in the beginning and 78.0MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:49:26,526 INFO L158 Benchmark]: BuchiAutomizer took 19574.41ms. Allocated memory was 163.6MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 78.0MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-02-17 22:49:26,527 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.16ms. Allocated memory is still 163.6MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.64ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 89.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 15.47ms. Allocated memory is still 163.6MB. Free memory was 89.5MB in the beginning and 88.8MB in the end (delta: 683.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 209.80ms. Allocated memory is still 163.6MB. Free memory was 88.8MB in the beginning and 78.0MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 19574.41ms. Allocated memory was 163.6MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 78.0MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.4GB. 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 10 terminating modules (3 trivial, 7 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.4s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.4s. Büchi inclusion checks took 4.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 3.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 10898 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 6.5s Buchi closure took 0.2s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 600 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 593 mSDsluCounter, 715 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 353 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 593 IncrementalHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 362 mSDtfsCounter, 593 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 39ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 1.6s InitialAbstraction: Time to compute Ample Reduction [ms]: 1691, Trivial Ample Sets caused by loops: 6581, Number of non-trivial ample sets: 8232, Number of pruned transitions: 6612, Number of transitions in reduction automaton: 15607, Number of states in reduction automaton: 5010, 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:26,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-02-17 22:49:26,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...