/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/b5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:09,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:09,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:24:09,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:09,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:09,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:09,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:09,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:09,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:09,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:09,468 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:09,468 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:09,468 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:09,468 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:09,468 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:09,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:09,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:09,470 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:09,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:09,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:09,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:09,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:09,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:09,470 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:09,470 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:09,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:09,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:09,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:09,698 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:09,699 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:09,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/b5.c.bpl [2025-04-26 16:24:09,702 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/b5.c.bpl' [2025-04-26 16:24:09,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:09,717 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:09,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:09,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:09,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:09,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,743 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:09,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:09,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:09,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:09,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:09,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:09,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:09,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:09,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:09,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/1) ... [2025-04-26 16:24:09,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:09,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:09,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:09,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:24:09,807 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:09,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:09,808 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:09,808 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:09,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:09,808 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:09,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:09,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:09,808 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:24:09,847 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:09,848 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:09,903 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:09,903 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:09,909 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:09,909 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:09,910 INFO L201 PluginConnector]: Adding new model b5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:09 BoogieIcfgContainer [2025-04-26 16:24:09,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:09,910 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:09,910 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:09,916 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:09,917 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:09,917 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "b5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:09" (1/2) ... [2025-04-26 16:24:09,918 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e792afe and model type b5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:09, skipping insertion in model container [2025-04-26 16:24:09,918 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:09,918 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "b5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:09" (2/2) ... [2025-04-26 16:24:09,919 INFO L376 chiAutomizerObserver]: Analyzing ICFG b5.c.bpl [2025-04-26 16:24:09,963 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:24:09,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 16:24:10,012 INFO L116 PetriNetUnfolderBase]: 2/16 cut-off events. [2025-04-26 16:24:10,014 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:24:10,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-04-26 16:24:10,022 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 16:24:10,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 44 flow [2025-04-26 16:24:10,029 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 21 places, 16 transitions, 44 flow [2025-04-26 16:24:10,038 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:10,038 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:10,038 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:10,038 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:10,038 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:10,038 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:10,039 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:10,039 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:10,040 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:10,065 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 31 [2025-04-26 16:24:10,065 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:10,065 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:10,068 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:10,068 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:10,068 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:10,069 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 41 states, but on-demand construction may add more states [2025-04-26 16:24:10,071 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 31 [2025-04-26 16:24:10,071 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:10,071 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:10,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:10,071 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:10,076 INFO L752 eck$LassoCheckResult]: Stem: "[51] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:10,076 INFO L754 eck$LassoCheckResult]: Loop: "[39] L21-->L23: Formula: (< (+ v_x5_1 v_x4_1 v_x3_1 v_x1_1) v_z_1) InVars {x1=v_x1_1, x4=v_x4_1, x5=v_x5_1, x3=v_x3_1, z=v_z_1} OutVars{x1=v_x1_1, x4=v_x4_1, x5=v_x5_1, x3=v_x3_1, z=v_z_1} AuxVars[] AssignedVars[]" "[41] L23-->L24: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[42] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[43] L25-->L26: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" "[44] L26-->L21: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-04-26 16:24:10,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:10,083 INFO L85 PathProgramCache]: Analyzing trace with hash 82, now seen corresponding path program 1 times [2025-04-26 16:24:10,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:10,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114565718] [2025-04-26 16:24:10,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:10,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:10,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:10,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:10,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:10,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:10,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:10,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:10,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash 65909640, now seen corresponding path program 1 times [2025-04-26 16:24:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:10,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070236464] [2025-04-26 16:24:10,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:10,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:10,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:10,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:10,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:10,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:10,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:10,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:10,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1910096425, now seen corresponding path program 1 times [2025-04-26 16:24:10,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:10,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094759261] [2025-04-26 16:24:10,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:10,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:10,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:10,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:10,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:10,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:10,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:10,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:10,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:10,299 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:10,300 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:10,300 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:10,300 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:10,300 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:10,300 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,300 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:10,300 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:10,300 INFO L132 ssoRankerPreferences]: Filename of dumped script: b5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:10,300 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:10,300 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:10,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:10,386 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:10,387 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:10,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,390 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:10,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:24:10,392 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:10,392 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:10,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:24:10,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,412 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:10,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:24:10,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:10,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:10,564 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:10,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:24:10,571 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:10,571 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:10,571 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:10,571 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:10,571 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:10,571 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,571 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:10,571 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:10,571 INFO L132 ssoRankerPreferences]: Filename of dumped script: b5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:10,571 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:10,572 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:10,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:10,625 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:10,629 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:10,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,632 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:10,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:24:10,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:10,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:10,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:10,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:10,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:10,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:10,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:10,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:10,653 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:10,660 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:24:10,660 INFO L437 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:10,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:10,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:10,663 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:10,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:24:10,666 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:10,668 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:10,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:10,670 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:10,670 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:10,670 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, x1, z, x5, x4) = -1*x3 - 1*x1 + 1*z - 1*x5 - 1*x4 Supporting invariants [] [2025-04-26 16:24:10,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:10,679 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:10,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:10,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:10,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:10,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:10,703 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:10,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:10,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:10,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:10,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:10,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:10,714 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:24:10,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:10,885 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:24:10,901 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 41 states, but on-demand construction may add more states Second operand has 6 states, 6 states have (on average 1.0) internal successors, (in total 6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:10,972 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 41 states, but on-demand construction may add more states. Second operand has 6 states, 6 states have (on average 1.0) internal successors, (in total 6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 98 states and 201 transitions. Complement of second has 6 states. [2025-04-26 16:24:10,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.0) internal successors, (in total 6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2025-04-26 16:24:10,980 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 1 letters. Loop has 5 letters. [2025-04-26 16:24:10,980 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:10,980 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 6 letters. Loop has 5 letters. [2025-04-26 16:24:10,980 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:10,980 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 1 letters. Loop has 10 letters. [2025-04-26 16:24:10,981 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:10,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 201 transitions. [2025-04-26 16:24:10,984 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2025-04-26 16:24:10,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 48 states and 101 transitions. [2025-04-26 16:24:10,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-04-26 16:24:10,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-04-26 16:24:10,987 INFO L74 IsDeterministic]: Start isDeterministic. Operand 48 states and 101 transitions. [2025-04-26 16:24:10,987 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:10,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 101 transitions. [2025-04-26 16:24:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 101 transitions. [2025-04-26 16:24:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2025-04-26 16:24:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (in total 87), 40 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 87 transitions. [2025-04-26 16:24:11,004 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 87 transitions. [2025-04-26 16:24:11,004 INFO L438 stractBuchiCegarLoop]: Abstraction has 41 states and 87 transitions. [2025-04-26 16:24:11,004 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:11,004 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 87 transitions. [2025-04-26 16:24:11,005 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2025-04-26 16:24:11,005 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:11,005 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:11,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:11,005 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:11,006 INFO L752 eck$LassoCheckResult]: Stem: "[51] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[54] L12-->L33: 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-04-26 16:24:11,006 INFO L754 eck$LassoCheckResult]: Loop: "[46] L33-->L35: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[48] L35-->L33: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:24:11,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:11,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2596, now seen corresponding path program 1 times [2025-04-26 16:24:11,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:11,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871862681] [2025-04-26 16:24:11,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:11,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:11,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:11,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:11,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:11,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2025-04-26 16:24:11,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:11,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160638549] [2025-04-26 16:24:11,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:11,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:11,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:11,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:11,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2496230, now seen corresponding path program 1 times [2025-04-26 16:24:11,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:11,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721618305] [2025-04-26 16:24:11,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:11,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:11,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:11,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:11,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:11,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:11,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:11,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:11,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:11,042 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:11,042 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:11,042 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:11,042 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:11,042 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:11,042 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,042 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:11,042 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:11,042 INFO L132 ssoRankerPreferences]: Filename of dumped script: b5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:11,042 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:11,042 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:11,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:11,063 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:11,063 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:11,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:11,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:11,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:24:11,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:11,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:11,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:11,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:11,085 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:11,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:24:11,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:11,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:11,149 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:11,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:24:11,153 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:11,153 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:11,154 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:11,154 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:11,154 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:11,154 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,154 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:11,154 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:11,154 INFO L132 ssoRankerPreferences]: Filename of dumped script: b5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:11,154 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:11,155 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:11,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:11,171 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:11,171 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:11,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:11,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:11,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:24:11,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:11,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:11,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:11,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:11,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:11,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:11,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:11,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:11,190 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:11,193 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:11,193 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:11,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:11,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:11,195 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:11,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:24:11,199 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:11,202 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:11,202 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-04-26 16:24:11,202 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:11,202 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:11,202 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:24:11,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:11,208 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:11,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:11,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:11,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:11,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:11,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:11,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:11,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:11,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:11,235 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:11,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:11,250 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:11,250 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 87 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:11,282 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 87 transitions. cyclomatic complexity: 56. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 103 states and 226 transitions. Complement of second has 6 states. [2025-04-26 16:24:11,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2025-04-26 16:24:11,283 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:11,284 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:11,284 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:11,284 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:11,284 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:11,284 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:11,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 226 transitions. [2025-04-26 16:24:11,286 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:11,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 0 states and 0 transitions. [2025-04-26 16:24:11,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:11,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:11,286 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:11,286 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:11,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:11,286 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:11,286 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:11,286 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:11,286 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:11,287 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:11,287 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:11,291 INFO L201 PluginConnector]: Adding new model b5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:11 BoogieIcfgContainer [2025-04-26 16:24:11,291 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:11,292 INFO L158 Benchmark]: Toolchain (without parser) took 1574.68ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 86.3MB in the beginning and 67.1MB in the end (delta: 19.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:11,292 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.83ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:11,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.48ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:11,292 INFO L158 Benchmark]: Boogie Preprocessor took 14.93ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 83.6MB in the end (delta: 854.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:11,292 INFO L158 Benchmark]: RCFGBuilder took 148.98ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 74.8MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:24:11,293 INFO L158 Benchmark]: BuchiAutomizer took 1380.71ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 74.6MB in the beginning and 67.1MB in the end (delta: 7.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:11,294 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.83ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.48ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 14.93ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 83.6MB in the end (delta: 854.5kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 148.98ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 74.8MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1380.71ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 74.6MB in the beginning and 67.1MB in the end (delta: 7.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 23 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf93 smp100 dnf100 smp100 tf107 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 9 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + -1 * x1 + -1 * x5 + -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:11,304 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...