/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-3-extended.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:39,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:39,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:39,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:39,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:39,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:39,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:39,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:39,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:39,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:39,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:39,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:39,562 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:39,562 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:39,562 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:39,562 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:39,562 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:39,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:39,563 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:39,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:39,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:39,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:39,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:39,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:39,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:39,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:39,564 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:39,564 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:39,564 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:39,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:39,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:39,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:39,806 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:39,807 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:39,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-3-extended.wvr.bpl [2025-04-26 18:40:39,810 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-3-extended.wvr.bpl' [2025-04-26 18:40:39,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:39,825 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:39,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:39,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:39,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:39,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,857 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:39,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:39,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:39,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:39,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:39,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,868 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:39,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:39,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:39,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:39,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/1) ... [2025-04-26 18:40:39,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:39,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:39,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:39,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:40:39,934 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:39,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:39,935 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:39,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:39,935 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:39,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:39,935 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:39,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:39,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:39,936 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 18:40:39,971 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:39,973 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:40,066 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:40,066 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:40,075 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:40,075 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:40:40,075 INFO L201 PluginConnector]: Adding new model misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:40 BoogieIcfgContainer [2025-04-26 18:40:40,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:40,076 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:40,076 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:40,080 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:40,081 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:40,081 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:39" (1/2) ... [2025-04-26 18:40:40,082 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75471166 and model type misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:40, skipping insertion in model container [2025-04-26 18:40:40,082 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:40,082 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:40" (2/2) ... [2025-04-26 18:40:40,083 INFO L376 chiAutomizerObserver]: Analyzing ICFG misc-3-extended.wvr.bpl [2025-04-26 18:40:40,125 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:40:40,160 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:40,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:40,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:40:40,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 53 transitions, 127 flow [2025-04-26 18:40:40,236 INFO L116 PetriNetUnfolderBase]: 12/47 cut-off events. [2025-04-26 18:40:40,239 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:40:40,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 12/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 108 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 42. Up to 4 conditions per place. [2025-04-26 18:40:40,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 53 transitions, 127 flow [2025-04-26 18:40:40,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2025-04-26 18:40:40,247 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 45 places, 47 transitions, 112 flow [2025-04-26 18:40:40,248 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 47 transitions, 112 flow [2025-04-26 18:40:40,303 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 916 states, 914 states have (on average 3.8938730853391683) internal successors, (in total 3559), 915 states have internal predecessors, (3559), 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 18:40:40,326 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 916 states, 914 states have (on average 3.8938730853391683) internal successors, (in total 3559), 915 states have internal predecessors, (3559), 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 18:40:40,328 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:40,449 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1665#[L79, L96, L50]true [2025-04-26 18:40:40,566 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1447#[L26, L95, L78, L50]true [2025-04-26 18:40:40,573 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1205#[L55, L26, L95, L78-1]true [2025-04-26 18:40:40,575 WARN L140 AmpleReduction]: Number of pruned transitions: 1779 [2025-04-26 18:40:40,575 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 3 [2025-04-26 18:40:40,575 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 147 [2025-04-26 18:40:40,575 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:35 [2025-04-26 18:40:40,575 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:736 [2025-04-26 18:40:40,575 WARN L145 AmpleReduction]: Times succ was already a loop node:57 [2025-04-26 18:40:40,575 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:680 [2025-04-26 18:40:40,575 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:40,578 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 916 states, 914 states have (on average 1.947483588621444) internal successors, (in total 1780), 915 states have internal predecessors, (1780), 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 18:40:40,586 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:40,586 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:40,586 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:40,586 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:40,586 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:40,587 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:40,587 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:40,587 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:40,590 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 916 states, 914 states have (on average 1.947483588621444) internal successors, (in total 1780), 915 states have internal predecessors, (1780), 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 18:40:40,629 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 889 [2025-04-26 18:40:40,629 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:40,629 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:40,634 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:40,634 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:40,634 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:40,636 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 916 states, 914 states have (on average 1.947483588621444) internal successors, (in total 1780), 915 states have internal predecessors, (1780), 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 18:40:40,649 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 889 [2025-04-26 18:40:40,649 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:40,649 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:40,649 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:40,650 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:40,655 INFO L752 eck$LassoCheckResult]: Stem: "[131] $Ultimate##0-->L93: Formula: (let ((.cse0 (not v_d1_7))) (and v_d1_7 (or (and v_g2_4 v_d1_7) (and .cse0 (not v_g2_4))) (or (and v_d2_7 v_d1_7) (and (not v_d2_7) .cse0)) (or (and v_g1_4 v_d1_7) (and (not v_g1_4) .cse0)) (= v_pos_9 0) (or (and (not v_g3_1) .cse0) (and v_g3_1 v_d1_7)) (or (and (not v_d3_1) .cse0) (and v_d1_7 v_d3_1)))) InVars {d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} OutVars{d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} AuxVars[] AssignedVars[]" "[171] L93-->L30-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:40,656 INFO L754 eck$LassoCheckResult]: Loop: "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[137] L21-->L26: Formula: (not v_d1_3) InVars {d1=v_d1_3} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[]" "[139] L26-->L21-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" "[140] L21-2-->L30: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[142] L30-->L30-1: Formula: (not v_d1_1) InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" [2025-04-26 18:40:40,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,660 INFO L85 PathProgramCache]: Analyzing trace with hash 5193, now seen corresponding path program 1 times [2025-04-26 18:40:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781159048] [2025-04-26 18:40:40,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:40,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:40,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:40,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:40,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:40,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:40,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:40,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:40,734 INFO L85 PathProgramCache]: Analyzing trace with hash 156600393, now seen corresponding path program 1 times [2025-04-26 18:40:40,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:40,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364214266] [2025-04-26 18:40:40,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:40,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:40,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:40,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:40,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:40,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:40,823 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 18:40:40,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:40,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364214266] [2025-04-26 18:40:40,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364214266] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:40,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:40,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:40,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527770732] [2025-04-26 18:40:40,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:40,833 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 18:40:40,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:40,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:40,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:40,866 INFO L87 Difference]: Start difference. First operand has 916 states, 914 states have (on average 1.947483588621444) internal successors, (in total 1780), 915 states have internal predecessors, (1780), 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) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:40,992 INFO L93 Difference]: Finished difference Result 1553 states and 2735 transitions. [2025-04-26 18:40:40,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1553 states and 2735 transitions. [2025-04-26 18:40:41,015 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 1505 [2025-04-26 18:40:41,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1553 states to 1519 states and 2669 transitions. [2025-04-26 18:40:41,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1519 [2025-04-26 18:40:41,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1519 [2025-04-26 18:40:41,052 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1519 states and 2669 transitions. [2025-04-26 18:40:41,061 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:41,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1519 states and 2669 transitions. [2025-04-26 18:40:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states and 2669 transitions. [2025-04-26 18:40:41,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1261. [2025-04-26 18:40:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1261 states have (on average 1.747026169706582) internal successors, (in total 2203), 1260 states have internal predecessors, (2203), 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 18:40:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 2203 transitions. [2025-04-26 18:40:41,137 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1261 states and 2203 transitions. [2025-04-26 18:40:41,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:40:41,145 INFO L438 stractBuchiCegarLoop]: Abstraction has 1261 states and 2203 transitions. [2025-04-26 18:40:41,146 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:41,146 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1261 states and 2203 transitions. [2025-04-26 18:40:41,152 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 1253 [2025-04-26 18:40:41,152 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:41,152 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:41,152 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:41,152 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:41,153 INFO L752 eck$LassoCheckResult]: Stem: "[131] $Ultimate##0-->L93: Formula: (let ((.cse0 (not v_d1_7))) (and v_d1_7 (or (and v_g2_4 v_d1_7) (and .cse0 (not v_g2_4))) (or (and v_d2_7 v_d1_7) (and (not v_d2_7) .cse0)) (or (and v_g1_4 v_d1_7) (and (not v_g1_4) .cse0)) (= v_pos_9 0) (or (and (not v_g3_1) .cse0) (and v_g3_1 v_d1_7)) (or (and (not v_d3_1) .cse0) (and v_d1_7 v_d3_1)))) InVars {d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} OutVars{d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} AuxVars[] AssignedVars[]" "[171] L93-->L30-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:41,153 INFO L754 eck$LassoCheckResult]: Loop: "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[136] L21-->L22: Formula: v_d1_2 InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" "[138] L22-->L21-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[140] L21-2-->L30: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[142] L30-->L30-1: Formula: (not v_d1_1) InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[137] L21-->L26: Formula: (not v_d1_3) InVars {d1=v_d1_3} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[]" "[139] L26-->L21-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" "[140] L21-2-->L30: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[141] L30-->L31: Formula: v_d1_6 InVars {d1=v_d1_6} OutVars{d1=v_d1_6} AuxVars[] AssignedVars[]" "[144] L31-->L30-1: Formula: (not v_g1_1) InVars {} OutVars{g1=v_g1_1} AuxVars[] AssignedVars[g1]" [2025-04-26 18:40:41,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,154 INFO L85 PathProgramCache]: Analyzing trace with hash 5193, now seen corresponding path program 2 times [2025-04-26 18:40:41,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:41,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930134080] [2025-04-26 18:40:41,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:41,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:41,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:41,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:41,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:41,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:41,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:41,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:41,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:41,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1096952976, now seen corresponding path program 1 times [2025-04-26 18:40:41,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:41,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194308485] [2025-04-26 18:40:41,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:41,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:41,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:41,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:41,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:41,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:41,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:41,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:41,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash -914374104, now seen corresponding path program 1 times [2025-04-26 18:40:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:41,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936556476] [2025-04-26 18:40:41,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:41,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:41,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:41,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:41,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:41,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:41,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:41,273 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:41,274 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:41,274 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:41,274 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:41,274 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:41,274 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,274 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:41,274 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:41,274 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-3-extended.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:40:41,274 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:41,274 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:41,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,325 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:41,326 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:41,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,329 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 18:40:41,330 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 18:40:41,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:41,332 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:41,349 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 18:40:41,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,351 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 18:40:41,353 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 18:40:41,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:41,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:41,380 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:41,384 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 18:40:41,385 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:41,385 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:41,385 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:41,385 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:41,385 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:41,385 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,385 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:41,385 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:41,385 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-3-extended.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:40:41,385 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:41,385 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:41,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:41,435 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:41,438 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:41,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,440 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 18:40:41,442 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 18:40:41,444 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 18:40:41,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:41,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:41,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:41,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:41,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:41,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:41,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:41,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:41,471 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:40:41,471 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:40:41,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:41,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:41,474 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 18:40:41,475 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 18:40:41,476 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:41,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:40:41,479 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:40:41,479 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:41,480 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite g1 1 0)_2) = 1*v_rep(ite g1 1 0)_2 Supporting invariants [] [2025-04-26 18:40:41,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:40:41,487 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:41,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:41,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:41,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:41,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:41,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:41,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:41,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:41,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:41,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:41,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-26 18:40:41,555 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 18:40:41,556 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1261 states and 2203 transitions. cyclomatic complexity: 973 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 18:40:41,650 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1261 states and 2203 transitions. cyclomatic complexity: 973. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 2973 states and 5460 transitions. Complement of second has 6 states. [2025-04-26 18:40:41,650 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 18:40:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 18:40:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-04-26 18:40:41,653 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 2 letters. Loop has 11 letters. [2025-04-26 18:40:41,654 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:41,654 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 13 letters. Loop has 11 letters. [2025-04-26 18:40:41,654 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:41,654 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 2 letters. Loop has 22 letters. [2025-04-26 18:40:41,654 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:41,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2973 states and 5460 transitions. [2025-04-26 18:40:41,671 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 1253 [2025-04-26 18:40:41,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2973 states to 2715 states and 4711 transitions. [2025-04-26 18:40:41,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1271 [2025-04-26 18:40:41,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1588 [2025-04-26 18:40:41,699 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2715 states and 4711 transitions. [2025-04-26 18:40:41,699 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:41,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2715 states and 4711 transitions. [2025-04-26 18:40:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states and 4711 transitions. [2025-04-26 18:40:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2420. [2025-04-26 18:40:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 2420 states have (on average 1.721487603305785) internal successors, (in total 4166), 2419 states have internal predecessors, (4166), 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 18:40:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 4166 transitions. [2025-04-26 18:40:41,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2420 states and 4166 transitions. [2025-04-26 18:40:41,773 INFO L438 stractBuchiCegarLoop]: Abstraction has 2420 states and 4166 transitions. [2025-04-26 18:40:41,773 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:41,773 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2420 states and 4166 transitions. [2025-04-26 18:40:41,781 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 1253 [2025-04-26 18:40:41,782 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:41,782 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:41,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:40:41,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:41,783 INFO L752 eck$LassoCheckResult]: Stem: "[131] $Ultimate##0-->L93: Formula: (let ((.cse0 (not v_d1_7))) (and v_d1_7 (or (and v_g2_4 v_d1_7) (and .cse0 (not v_g2_4))) (or (and v_d2_7 v_d1_7) (and (not v_d2_7) .cse0)) (or (and v_g1_4 v_d1_7) (and (not v_g1_4) .cse0)) (= v_pos_9 0) (or (and (not v_g3_1) .cse0) (and v_g3_1 v_d1_7)) (or (and (not v_d3_1) .cse0) (and v_d1_7 v_d3_1)))) InVars {d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} OutVars{d2=v_d2_7, d3=v_d3_1, g3=v_g3_1, d1=v_d1_7, g1=v_g1_4, g2=v_g2_4, pos=v_pos_9} AuxVars[] AssignedVars[]" "[171] L93-->L30-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" [2025-04-26 18:40:41,783 INFO L754 eck$LassoCheckResult]: Loop: "[136] L21-->L22: Formula: v_d1_2 InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" "[138] L22-->L21-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[140] L21-2-->L30: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[142] L30-->L30-1: Formula: (not v_d1_1) InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" "[137] L21-->L26: Formula: (not v_d1_3) InVars {d1=v_d1_3} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[]" "[139] L26-->L21-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" "[140] L21-2-->L30: Formula: (or (and v_d1_4 (not v_d1_5)) (and v_d1_5 (not v_d1_4))) InVars {d1=v_d1_5} OutVars{d1=v_d1_4} AuxVars[] AssignedVars[d1]" "[141] L30-->L31: Formula: v_d1_6 InVars {d1=v_d1_6} OutVars{d1=v_d1_6} AuxVars[] AssignedVars[]" "[143] L31-->L30-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[134] L30-1-->L21: Formula: v_g1_2 InVars {g1=v_g1_2} OutVars{g1=v_g1_2} AuxVars[] AssignedVars[]" [2025-04-26 18:40:41,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,783 INFO L85 PathProgramCache]: Analyzing trace with hash 161117, now seen corresponding path program 1 times [2025-04-26 18:40:41,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:41,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646963714] [2025-04-26 18:40:41,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:41,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:41,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:41,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,789 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:41,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:41,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:41,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:41,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash 659466779, now seen corresponding path program 1 times [2025-04-26 18:40:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:41,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058633784] [2025-04-26 18:40:41,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:41,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:41,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:41,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:41,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:41,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:41,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:41,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:41,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1719173951, now seen corresponding path program 1 times [2025-04-26 18:40:41,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:41,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123099069] [2025-04-26 18:40:41,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:41,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:41,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:41,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:41,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:41,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:41,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:41,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:41,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:41,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:41,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:41,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:41,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:41,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:41,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:41,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:40:41,973 INFO L201 PluginConnector]: Adding new model misc-3-extended.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:41 BoogieIcfgContainer [2025-04-26 18:40:41,973 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:41,974 INFO L158 Benchmark]: Toolchain (without parser) took 2149.32ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 83.0MB in the beginning and 69.0MB in the end (delta: 14.0MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. [2025-04-26 18:40:41,974 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.83ms. Allocated memory is still 155.2MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:41,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.41ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:41,975 INFO L158 Benchmark]: Boogie Preprocessor took 19.38ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 79.8MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:41,975 INFO L158 Benchmark]: RCFGBuilder took 195.65ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 69.9MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:41,975 INFO L158 Benchmark]: BuchiAutomizer took 1897.37ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 69.7MB in the beginning and 69.0MB in the end (delta: 644.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:41,976 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 155.2MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.41ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.38ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 79.8MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 195.65ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 69.9MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1897.37ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 69.7MB in the beginning and 69.0MB in the end (delta: 644.7kB). 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.7s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 553 StatesRemovedByMinimization, 2 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 124 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol160 ite100 ukn100 eq100 hnf100 smp100 dnf100 smp100 tf125 neg100 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 420, Number of transitions in reduction automaton: 1780, Number of states in reduction automaton: 916, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (if g1 then 1 else 0) and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 2420 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 21]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L92] 0 assume pos == 0 && d1 == d2 && d1 == d3 && d1 == g1 && d1 == g2 && d1 == g3 && d1 == true; VAL [d1=true, d2=true, d3=true, g1=true, g2=true, g3=true, pos=0] [L93] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, d3=true, g1=true, g2=true, g3=true, pos=0] [L20] COND TRUE 1 g1 VAL [d1=true, d2=true, d3=true, g1=true, g2=true, g3=true, pos=0] Loop: [L21] COND TRUE d1 [L22] pos := pos + 1; [L29] d1 := !d1; [L30] COND FALSE !(d1) [L20] COND TRUE g1 [L21] COND FALSE !(d1) [L26] pos := pos - 1; [L29] d1 := !d1; [L30] COND TRUE d1 [L20] COND TRUE g1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L92] 0 assume pos == 0 && d1 == d2 && d1 == d3 && d1 == g1 && d1 == g2 && d1 == g3 && d1 == true; VAL [d1=true, d2=true, d3=true, g1=true, g2=true, g3=true, pos=0] [L93] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, d3=true, g1=true, g2=true, g3=true, pos=0] [L20] COND TRUE 1 g1 VAL [d1=true, d2=true, d3=true, g1=true, g2=true, g3=true, pos=0] Loop: [L21] COND TRUE d1 [L22] pos := pos + 1; [L29] d1 := !d1; [L30] COND FALSE !(d1) [L20] COND TRUE g1 [L21] COND FALSE !(d1) [L26] pos := pos - 1; [L29] d1 := !d1; [L30] COND TRUE d1 [L20] COND TRUE g1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:40:41,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...