/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/unroll-cond-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:54,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:54,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:54,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:54,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:54,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:54,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:54,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:54,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:54,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:54,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:54,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:54,658 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:54,658 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:54,658 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:54,658 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:54,658 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:54,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:54,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:54,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:54,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:54,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:54,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:54,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:54,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:54,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:54,660 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:54,660 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:54,660 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:54,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:54,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:54,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:54,904 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:54,905 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:54,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-4.wvr.bpl [2025-04-26 18:39:54,907 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/unroll-cond-4.wvr.bpl' [2025-04-26 18:39:54,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:54,930 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:54,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:54,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:54,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:54,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,966 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:54,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:54,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:54,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:54,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:54,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:54,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:54,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:54,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:54,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:54,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/1) ... [2025-04-26 18:39:55,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:55,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,022 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:39:55,027 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:39:55,047 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:55,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:55,048 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:55,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:55,048 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:55,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:55,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:55,049 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:39:55,084 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:55,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:55,186 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:55,186 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:55,236 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:55,237 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 18:39:55,237 INFO L201 PluginConnector]: Adding new model unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:55 BoogieIcfgContainer [2025-04-26 18:39:55,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:55,238 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:55,238 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:55,242 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:55,242 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:55,242 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:54" (1/2) ... [2025-04-26 18:39:55,244 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d6160a2 and model type unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:55, skipping insertion in model container [2025-04-26 18:39:55,245 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:55,245 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:55" (2/2) ... [2025-04-26 18:39:55,247 INFO L376 chiAutomizerObserver]: Analyzing ICFG unroll-cond-4.wvr.bpl [2025-04-26 18:39:55,287 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:39:55,322 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:55,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:55,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,324 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:39:55,325 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:39:55,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 52 flow [2025-04-26 18:39:55,380 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-26 18:39:55,381 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:39:55,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 15 events. 2/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2025-04-26 18:39:55,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 19 transitions, 52 flow [2025-04-26 18:39:55,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 15 transitions, 42 flow [2025-04-26 18:39:55,386 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 20 places, 15 transitions, 42 flow [2025-04-26 18:39:55,386 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 15 transitions, 42 flow [2025-04-26 18:39:55,392 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22 states, 20 states have (on average 1.85) internal successors, (in total 37), 21 states have internal predecessors, (37), 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:39:55,393 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 22 states, 20 states have (on average 1.85) internal successors, (in total 37), 21 states have internal predecessors, (37), 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:39:55,396 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:55,427 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 41#[L61, L33, thread1EXIT]true [2025-04-26 18:39:55,427 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 29#[L60-1, L20]true [2025-04-26 18:39:55,429 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 35#[L61, L33, thread1FINAL]true [2025-04-26 18:39:55,429 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 31#[L61, L33, L20]true [2025-04-26 18:39:55,430 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 37#[thread2FINAL, L61, L20]true [2025-04-26 18:39:55,430 WARN L140 AmpleReduction]: Number of pruned transitions: 4 [2025-04-26 18:39:55,430 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 5 [2025-04-26 18:39:55,430 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 18:39:55,430 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:13 [2025-04-26 18:39:55,430 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:8 [2025-04-26 18:39:55,430 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:39:55,430 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:39:55,431 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:55,431 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 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:39:55,439 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:55,440 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:55,440 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:55,440 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:55,441 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:55,441 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:55,441 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:55,441 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:55,443 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 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:39:55,453 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2025-04-26 18:39:55,454 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:55,454 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:55,456 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:55,456 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:55,456 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:55,457 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 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:39:55,458 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2025-04-26 18:39:55,458 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:55,458 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:55,458 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:55,458 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:55,463 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L60: Formula: (and (= v_i1_5 v_x2_16) (= v_i1_5 0) (= v_i1_5 v_i2_20) (= v_i1_5 v_x1_4)) InVars {i1=v_i1_5, i2=v_i2_20, x1=v_x1_4, x2=v_x2_16} OutVars{i1=v_i1_5, i2=v_i2_20, x1=v_x1_4, x2=v_x2_16} AuxVars[] AssignedVars[]" "[76] L60-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:39:55,463 INFO L754 eck$LassoCheckResult]: Loop: "[69] L20-->L20: Formula: (and (= (+ v_i1_11 1) v_i1_10) (= (select v_f_11 v_x1_10) v_x1_9) (< v_i1_11 v_n_11)) InVars {i1=v_i1_11, x1=v_x1_10, n=v_n_11, f=v_f_11} OutVars{i1=v_i1_10, x1=v_x1_9, n=v_n_11, f=v_f_11} AuxVars[] AssignedVars[i1, x1]" [2025-04-26 18:39:55,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:55,469 INFO L85 PathProgramCache]: Analyzing trace with hash 3021, now seen corresponding path program 1 times [2025-04-26 18:39:55,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:55,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171551689] [2025-04-26 18:39:55,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:55,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:55,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:55,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:55,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:55,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:55,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:55,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:55,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:55,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:55,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 1 times [2025-04-26 18:39:55,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:55,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606217569] [2025-04-26 18:39:55,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:55,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:55,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:55,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:55,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:55,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:55,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:55,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:55,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:55,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:55,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:55,554 INFO L85 PathProgramCache]: Analyzing trace with hash 93720, now seen corresponding path program 1 times [2025-04-26 18:39:55,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:55,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169466915] [2025-04-26 18:39:55,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:55,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:55,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:55,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:55,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:55,564 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:55,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:55,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:55,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:55,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:55,694 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:55,695 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:55,695 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:55,695 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:55,695 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:55,695 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,695 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:55,695 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:55,696 INFO L132 ssoRankerPreferences]: Filename of dumped script: unroll-cond-4.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:55,696 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:55,696 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:55,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:55,856 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:55,865 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:55,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,883 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:39:55,886 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:39:55,886 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:39:55,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:55,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:55,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:55,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:55,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:55,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:55,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:55,921 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:39:55,921 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:55,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:55,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:55,924 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:39:55,926 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:39:55,927 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:55,945 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:39:55,945 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:55,946 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:55,946 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, i1) = 1*n - 1*i1 Supporting invariants [] [2025-04-26 18:39:55,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:55,954 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:55,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:55,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:55,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:55,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:55,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:55,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:55,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:55,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:55,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:55,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:56,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:56,000 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:56,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:56,003 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:39:56,019 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:39:56,020 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:39:56,071 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 20 states have (on average 1.65) internal successors, (in total 33), 21 states have internal predecessors, (33), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 49 states and 88 transitions. Complement of second has 5 states. [2025-04-26 18:39:56,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:39:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-04-26 18:39:56,078 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 18:39:56,078 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:56,078 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:39:56,078 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:56,079 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:39:56,079 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:56,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 88 transitions. [2025-04-26 18:39:56,082 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:39:56,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 14 states and 27 transitions. [2025-04-26 18:39:56,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-04-26 18:39:56,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-04-26 18:39:56,085 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14 states and 27 transitions. [2025-04-26 18:39:56,085 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:56,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 27 transitions. [2025-04-26 18:39:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 27 transitions. [2025-04-26 18:39:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2025-04-26 18:39:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (in total 24), 11 states have internal predecessors, (24), 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:39:56,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2025-04-26 18:39:56,102 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 24 transitions. [2025-04-26 18:39:56,102 INFO L438 stractBuchiCegarLoop]: Abstraction has 12 states and 24 transitions. [2025-04-26 18:39:56,102 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:56,102 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 24 transitions. [2025-04-26 18:39:56,102 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:39:56,102 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:56,102 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:56,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:56,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:39:56,103 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L60: Formula: (and (= v_i1_5 v_x2_16) (= v_i1_5 0) (= v_i1_5 v_i2_20) (= v_i1_5 v_x1_4)) InVars {i1=v_i1_5, i2=v_i2_20, x1=v_x1_4, x2=v_x2_16} OutVars{i1=v_i1_5, i2=v_i2_20, x1=v_x1_4, x2=v_x2_16} AuxVars[] AssignedVars[]" "[76] L60-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[79] L60-1-->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 18:39:56,103 INFO L754 eck$LassoCheckResult]: Loop: "[72] L33-->L33: Formula: (and (= (select v_f_39 (select v_f_39 (select v_f_39 (select v_f_39 v_x2_80)))) v_x2_79) (= (+ v_i2_84 4) v_i2_83) (< (+ 3 v_i2_84) v_n_25)) InVars {i2=v_i2_84, n=v_n_25, f=v_f_39, x2=v_x2_80} OutVars{i2=v_i2_83, n=v_n_25, f=v_f_39, x2=v_x2_79} AuxVars[] AssignedVars[x2, i2]" [2025-04-26 18:39:56,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:56,103 INFO L85 PathProgramCache]: Analyzing trace with hash 93730, now seen corresponding path program 1 times [2025-04-26 18:39:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:56,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457041515] [2025-04-26 18:39:56,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:56,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:56,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:56,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:56,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:56,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:56,108 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:56,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:56,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:56,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:56,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:56,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:56,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:56,111 INFO L85 PathProgramCache]: Analyzing trace with hash 103, now seen corresponding path program 1 times [2025-04-26 18:39:56,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:56,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127316491] [2025-04-26 18:39:56,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:56,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:56,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:56,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:56,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:56,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:56,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:56,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:56,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:56,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:56,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:56,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:56,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2905702, now seen corresponding path program 1 times [2025-04-26 18:39:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:56,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920984177] [2025-04-26 18:39:56,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:56,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:56,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:56,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:56,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:56,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:56,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:56,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:56,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:56,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:56,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:56,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:56,197 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:56,197 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:56,197 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:56,197 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:56,197 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:56,197 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:56,198 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:56,198 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:56,198 INFO L132 ssoRankerPreferences]: Filename of dumped script: unroll-cond-4.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:39:56,198 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:56,198 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:56,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:56,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:56,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:56,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:56,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:56,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:56,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:56,330 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:56,330 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:56,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:56,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:56,333 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:39:56,334 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:39:56,336 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:39:56,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:56,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:56,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:56,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:56,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:56,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:56,353 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:56,360 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 18:39:56,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:56,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:56,362 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:39:56,363 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:39:56,367 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:39:56,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:56,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:56,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:56,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:56,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:56,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:56,386 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:56,392 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 18:39:56,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:56,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:56,394 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 18:39:56,395 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 18:39:56,397 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:39:56,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:56,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:56,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:56,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:56,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:56,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:56,417 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:56,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:56,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:56,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:56,425 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 18:39:56,425 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 18:39:56,428 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:39:56,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:56,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:56,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:56,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:56,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:56,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:56,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:56,441 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:56,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:39:56,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:56,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:56,449 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 18:39:56,449 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 18:39:56,450 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:39:56,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:56,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:56,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:56,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:56,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:56,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:56,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:56,461 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:56,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:39:56,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:56,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:56,469 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:56,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:39:56,470 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:39:56,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:56,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:56,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:56,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:56,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:56,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:56,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:56,481 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:56,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:39:56,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:56,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:56,488 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:56,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:39:56,490 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:39:56,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:56,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:56,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:56,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:56,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:56,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:56,507 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:56,516 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:39:56,516 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:56,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:56,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:56,518 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:56,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:39:56,521 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:56,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:56,536 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:56,536 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:56,536 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, i2) = 1*n - 1*i2 Supporting invariants [] [2025-04-26 18:39:56,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:39:56,543 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:56,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:56,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:56,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:56,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:56,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:56,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:56,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:56,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:39:56,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:39:56,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:56,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:56,569 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:56,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:56,569 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:39:56,570 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:39:56,570 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 24 transitions. cyclomatic complexity: 18 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 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 18:39:56,580 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 24 transitions. cyclomatic complexity: 18. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 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 21 states and 38 transitions. Complement of second has 4 states. [2025-04-26 18:39:56,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 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 18:39:56,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-04-26 18:39:56,581 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:39:56,581 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:56,582 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 18:39:56,582 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:56,582 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:39:56,582 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:56,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 38 transitions. [2025-04-26 18:39:56,582 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:56,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2025-04-26 18:39:56,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:56,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:56,583 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:56,583 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:56,583 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:56,583 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:56,583 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:56,583 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:56,583 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:56,583 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:56,583 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:56,593 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:39:56,594 INFO L201 PluginConnector]: Adding new model unroll-cond-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:56 BoogieIcfgContainer [2025-04-26 18:39:56,594 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:56,596 INFO L158 Benchmark]: Toolchain (without parser) took 1665.14ms. Allocated memory was 163.6MB in the beginning and 155.2MB in the end (delta: -8.4MB). Free memory was 88.7MB in the beginning and 63.0MB in the end (delta: 25.7MB). Peak memory consumption was 19.6MB. Max. memory is 8.0GB. [2025-04-26 18:39:56,597 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.71ms. Allocated memory is still 163.6MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:56,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.93ms. Allocated memory is still 163.6MB. Free memory was 88.7MB in the beginning and 86.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:56,597 INFO L158 Benchmark]: Boogie Preprocessor took 25.15ms. Allocated memory is still 163.6MB. Free memory was 86.7MB in the beginning and 85.7MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:56,597 INFO L158 Benchmark]: RCFGBuilder took 243.25ms. Allocated memory is still 163.6MB. Free memory was 85.7MB in the beginning and 72.1MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:39:56,597 INFO L158 Benchmark]: BuchiAutomizer took 1356.30ms. Allocated memory was 163.6MB in the beginning and 155.2MB in the end (delta: -8.4MB). Free memory was 71.9MB in the beginning and 63.0MB in the end (delta: 9.0MB). Peak memory consumption was 2.8MB. Max. memory is 8.0GB. [2025-04-26 18:39:56,598 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.71ms. Allocated memory is still 163.6MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.93ms. Allocated memory is still 163.6MB. Free memory was 88.7MB in the beginning and 86.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.15ms. Allocated memory is still 163.6MB. Free memory was 86.7MB in the beginning and 85.7MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 243.25ms. Allocated memory is still 163.6MB. Free memory was 85.7MB in the beginning and 72.1MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1356.30ms. Allocated memory was 163.6MB in the beginning and 155.2MB in the end (delta: -8.4MB). Free memory was 71.9MB in the beginning and 63.0MB in the end (delta: 9.0MB). Peak memory consumption was 2.8MB. 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.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 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, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 8 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq171 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 80ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 113, Number of transitions in reduction automaton: 33, Number of states in reduction automaton: 22, Underlying: - 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 n + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + n and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:39:56,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...