/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/mult-flipped-dist.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:39:48,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:48,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:48,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:48,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:48,822 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:48,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:48,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:48,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:48,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:48,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:48,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:48,841 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:48,841 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:48,841 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:48,841 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:48,841 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:48,841 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:48,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:48,843 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:48,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:48,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:48,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:48,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:48,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:48,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:48,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:48,844 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:48,844 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:48,844 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:49,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:49,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:49,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:49,099 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:49,099 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:49,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/mult-flipped-dist.wvr.bpl [2025-04-26 18:39:49,102 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/mult-flipped-dist.wvr.bpl' [2025-04-26 18:39:49,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:49,121 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:49,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:49,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:49,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:49,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/1) ... [2025-04-26 18:39:49,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/1) ... [2025-04-26 18:39:49,155 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:49,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:49,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:49,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:49,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:49,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/1) ... [2025-04-26 18:39:49,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/1) ... [2025-04-26 18:39:49,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/1) ... [2025-04-26 18:39:49,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/1) ... [2025-04-26 18:39:49,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/1) ... [2025-04-26 18:39:49,170 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/1) ... [2025-04-26 18:39:49,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/1) ... [2025-04-26 18:39:49,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/1) ... [2025-04-26 18:39:49,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/1) ... [2025-04-26 18:39:49,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:49,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:49,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:49,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:49,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/1) ... [2025-04-26 18:39:49,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:49,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,213 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:49,216 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:49,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:39:49,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:39:49,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:39:49,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:39:49,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:39:49,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:39:49,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:49,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:49,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:49,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:39:49,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:39:49,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:39:49,239 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:49,278 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:49,279 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:49,362 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:49,362 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:49,383 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:49,383 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:39:49,385 INFO L201 PluginConnector]: Adding new model mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:49 BoogieIcfgContainer [2025-04-26 18:39:49,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:49,386 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:49,386 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:49,390 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:49,391 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:49,391 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:39:49" (1/2) ... [2025-04-26 18:39:49,392 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66f61a9b and model type mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:49, skipping insertion in model container [2025-04-26 18:39:49,392 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:49,392 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:49" (2/2) ... [2025-04-26 18:39:49,393 INFO L376 chiAutomizerObserver]: Analyzing ICFG mult-flipped-dist.wvr.bpl [2025-04-26 18:39:49,441 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:39:49,481 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:49,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:49,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:49,484 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:49,486 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:49,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 18:39:49,555 INFO L116 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-04-26 18:39:49,557 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:39:49,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 18:39:49,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 18:39:49,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 64 flow [2025-04-26 18:39:49,565 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 23 transitions, 64 flow [2025-04-26 18:39:49,566 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 23 transitions, 64 flow [2025-04-26 18:39:49,592 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 111 states, 109 states have (on average 2.853211009174312) internal successors, (in total 311), 110 states have internal predecessors, (311), 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:49,592 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 111 states, 109 states have (on average 2.853211009174312) internal successors, (in total 311), 110 states have internal predecessors, (311), 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:49,597 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:49,663 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 18:39:49,663 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:49,663 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 18:39:49,663 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:20 [2025-04-26 18:39:49,663 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:51 [2025-04-26 18:39:49,663 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 18:39:49,663 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:2 [2025-04-26 18:39:49,663 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:49,664 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 111 states, 109 states have (on average 2.055045871559633) internal successors, (in total 224), 110 states have internal predecessors, (224), 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:49,671 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:49,671 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:49,671 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:49,671 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:49,671 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:49,671 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:49,671 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:49,671 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:49,673 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 111 states, 109 states have (on average 2.055045871559633) internal successors, (in total 224), 110 states have internal predecessors, (224), 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:49,687 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:39:49,687 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:49,687 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:49,690 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:49,690 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:49,690 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:49,690 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 111 states, 109 states have (on average 2.055045871559633) internal successors, (in total 224), 110 states have internal predecessors, (224), 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:49,695 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:39:49,695 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:49,695 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:49,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:39:49,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:49,699 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L56: Formula: (and (= v_x_1_3 0) (= v_x_3_1 v_x_1_3) (= v_i_1_5 v_x_1_3) (= v_i_2_5 v_x_1_3) (= v_i_3_1 v_x_1_3) (= v_x_2_3 v_x_1_3)) InVars {x_1=v_x_1_3, x_2=v_x_2_3, x_3=v_x_3_1, i_2=v_i_2_5, i_3=v_i_3_1, i_1=v_i_1_5} OutVars{x_1=v_x_1_3, x_2=v_x_2_3, x_3=v_x_3_1, i_2=v_i_2_5, i_3=v_i_3_1, i_1=v_i_1_5} AuxVars[] AssignedVars[]" "[75] L56-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:39:49,699 INFO L754 eck$LassoCheckResult]: Loop: "[62] L23-1-->L23: Formula: (< v_i_1_1 v_c_1) InVars {c=v_c_1, i_1=v_i_1_1} OutVars{c=v_c_1, i_1=v_i_1_1} AuxVars[] AssignedVars[]" "[64] L23-->L23-1: Formula: (and (= v_x_1_5 (+ v_a_3 v_x_1_6)) (= (+ v_i_1_7 1) v_i_1_6)) InVars {x_1=v_x_1_6, a=v_a_3, i_1=v_i_1_7} OutVars{x_1=v_x_1_5, a=v_a_3, i_1=v_i_1_6} AuxVars[] AssignedVars[x_1, i_1]" [2025-04-26 18:39:49,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:49,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2710, now seen corresponding path program 1 times [2025-04-26 18:39:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:49,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639893526] [2025-04-26 18:39:49,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:49,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:49,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:49,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:49,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,756 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:49,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:49,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:49,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:49,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:49,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2025-04-26 18:39:49,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:49,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594093308] [2025-04-26 18:39:49,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:49,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:49,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:49,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:49,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,785 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:49,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:49,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:49,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:49,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:49,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2606296, now seen corresponding path program 1 times [2025-04-26 18:39:49,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:49,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530275192] [2025-04-26 18:39:49,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:49,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:49,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:49,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:49,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:49,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:49,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:49,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:49,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:49,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:49,926 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:49,927 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:49,927 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:49,927 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:49,927 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:39:49,927 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:49,927 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:49,927 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:49,928 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-flipped-dist.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:39:49,928 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:49,928 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:49,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:49,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,029 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:50,030 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:39:50,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,033 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:50,034 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:50,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:50,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:50,049 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:39:50,050 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x_1=0, a=0} Honda state: {x_1=0, a=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:39:50,056 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:39:50,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,058 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:50,059 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:50,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:50,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:50,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:39:50,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,079 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:50,080 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:50,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:39:50,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:50,151 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:39:50,156 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:39:50,156 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:50,156 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:50,156 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:50,156 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:50,156 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:50,156 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,156 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:50,156 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:50,156 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-flipped-dist.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:39:50,156 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:50,156 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:50,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,191 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:50,193 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:50,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,196 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:50,197 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:50,198 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:50,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:50,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:50,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:50,216 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:50,221 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:50,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,223 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:50,224 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:50,226 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:50,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:50,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:50,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:50,239 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:50,243 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:39:50,243 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:39:50,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,247 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:50,248 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:50,248 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:50,251 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:50,251 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:39:50,252 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:50,252 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(c, i_1) = 1*c - 1*i_1 Supporting invariants [] [2025-04-26 18:39:50,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:39:50,260 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:50,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:50,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:50,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:50,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:50,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:50,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:50,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:50,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:50,300 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:50,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:50,319 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:50,336 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:39:50,337 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 111 states, 109 states have (on average 2.055045871559633) internal successors, (in total 224), 110 states have internal predecessors, (224), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:50,452 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 111 states, 109 states have (on average 2.055045871559633) internal successors, (in total 224), 110 states have internal predecessors, (224), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 257 states and 526 transitions. Complement of second has 7 states. [2025-04-26 18:39:50,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:39:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:39:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2025-04-26 18:39:50,460 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:39:50,461 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:50,461 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:39:50,461 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:50,461 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:39:50,461 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:50,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 526 transitions. [2025-04-26 18:39:50,472 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:39:50,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 116 states and 238 transitions. [2025-04-26 18:39:50,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-04-26 18:39:50,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2025-04-26 18:39:50,477 INFO L74 IsDeterministic]: Start isDeterministic. Operand 116 states and 238 transitions. [2025-04-26 18:39:50,478 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:50,478 INFO L218 hiAutomatonCegarLoop]: Abstraction has 116 states and 238 transitions. [2025-04-26 18:39:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 238 transitions. [2025-04-26 18:39:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2025-04-26 18:39:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 2.0495049504950495) internal successors, (in total 207), 100 states have internal predecessors, (207), 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:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 207 transitions. [2025-04-26 18:39:50,502 INFO L240 hiAutomatonCegarLoop]: Abstraction has 101 states and 207 transitions. [2025-04-26 18:39:50,503 INFO L438 stractBuchiCegarLoop]: Abstraction has 101 states and 207 transitions. [2025-04-26 18:39:50,503 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:50,503 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 207 transitions. [2025-04-26 18:39:50,506 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:39:50,506 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:50,506 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:50,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:39:50,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:50,507 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L56: Formula: (and (= v_x_1_3 0) (= v_x_3_1 v_x_1_3) (= v_i_1_5 v_x_1_3) (= v_i_2_5 v_x_1_3) (= v_i_3_1 v_x_1_3) (= v_x_2_3 v_x_1_3)) InVars {x_1=v_x_1_3, x_2=v_x_2_3, x_3=v_x_3_1, i_2=v_i_2_5, i_3=v_i_3_1, i_1=v_i_1_5} OutVars{x_1=v_x_1_3, x_2=v_x_2_3, x_3=v_x_3_1, i_2=v_i_2_5, i_3=v_i_3_1, i_1=v_i_1_5} AuxVars[] AssignedVars[]" "[75] L56-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L23-1-->thread1FINAL: Formula: (<= v_c_2 v_i_1_4) InVars {c=v_c_2, i_1=v_i_1_4} OutVars{c=v_c_2, i_1=v_i_1_4} AuxVars[] AssignedVars[]" "[63] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[78] L56-1-->L34-1: 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:50,507 INFO L754 eck$LassoCheckResult]: Loop: "[66] L34-1-->L34: Formula: (< v_i_2_1 v_c_3) InVars {i_2=v_i_2_1, c=v_c_3} OutVars{i_2=v_i_2_1, c=v_c_3} AuxVars[] AssignedVars[]" "[68] L34-->L34-1: Formula: (and (= v_i_2_6 (+ v_i_2_7 1)) (= (+ v_b_3 v_x_2_6) v_x_2_5)) InVars {i_2=v_i_2_7, x_2=v_x_2_6, b=v_b_3} OutVars{i_2=v_i_2_6, x_2=v_x_2_5, b=v_b_3} AuxVars[] AssignedVars[x_2, i_2]" [2025-04-26 18:39:50,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,507 INFO L85 PathProgramCache]: Analyzing trace with hash 80794262, now seen corresponding path program 1 times [2025-04-26 18:39:50,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:50,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255424653] [2025-04-26 18:39:50,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:50,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:50,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:50,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:50,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:50,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:50,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:50,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:50,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2025-04-26 18:39:50,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:50,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793910550] [2025-04-26 18:39:50,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:50,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:50,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:50,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,532 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:50,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:50,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:50,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:50,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:50,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,539 INFO L85 PathProgramCache]: Analyzing trace with hash 333876568, now seen corresponding path program 1 times [2025-04-26 18:39:50,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:50,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335087939] [2025-04-26 18:39:50,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:50,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:50,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:50,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:50,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:50,613 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:50,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:50,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335087939] [2025-04-26 18:39:50,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335087939] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:50,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:50,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:39:50,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315843120] [2025-04-26 18:39:50,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:50,636 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:50,636 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:50,636 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:50,636 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:50,636 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:39:50,636 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,636 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:50,637 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:50,637 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-flipped-dist.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:39:50,637 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:50,637 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:50,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,669 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:50,669 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:39:50,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,671 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:50,672 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:50,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:50,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:50,689 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:50,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,692 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:50,694 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:50,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:39:50,695 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:50,761 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:39:50,765 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:50,765 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:50,765 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:50,766 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:50,766 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:50,766 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:50,766 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,766 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:50,766 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:50,766 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-flipped-dist.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:39:50,766 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:50,766 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:50,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:50,805 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:50,805 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:50,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,814 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:50,815 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:50,817 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:50,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:50,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:50,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:50,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:50,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:50,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:50,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:50,831 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:50,833 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:39:50,834 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:39:50,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:50,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:50,836 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:50,838 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:50,838 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:50,841 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:39:50,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:39:50,843 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:39:50,843 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:50,843 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(c, i_2) = 1*c - 1*i_2 Supporting invariants [] [2025-04-26 18:39:50,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:50,849 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:50,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:50,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:50,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:50,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:50,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:50,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:50,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:50,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:50,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:50,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:50,881 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:50,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:50,899 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:50,899 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:39:50,900 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 207 transitions. cyclomatic complexity: 133 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:50,964 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 207 transitions. cyclomatic complexity: 133. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 257 states and 529 transitions. Complement of second has 6 states. [2025-04-26 18:39:50,964 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:39:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 18:39:50,965 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:39:50,965 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:50,965 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:39:50,965 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:50,965 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:39:50,966 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:50,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 529 transitions. [2025-04-26 18:39:50,968 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:39:50,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 120 states and 241 transitions. [2025-04-26 18:39:50,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2025-04-26 18:39:50,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-04-26 18:39:50,969 INFO L74 IsDeterministic]: Start isDeterministic. Operand 120 states and 241 transitions. [2025-04-26 18:39:50,969 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:50,969 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 241 transitions. [2025-04-26 18:39:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 241 transitions. [2025-04-26 18:39:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 107. [2025-04-26 18:39:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 2.046728971962617) internal successors, (in total 219), 106 states have internal predecessors, (219), 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:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 219 transitions. [2025-04-26 18:39:50,975 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 219 transitions. [2025-04-26 18:39:50,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:50,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:39:50,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:39:50,978 INFO L87 Difference]: Start difference. First operand 107 states and 219 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:51,038 INFO L93 Difference]: Finished difference Result 120 states and 236 transitions. [2025-04-26 18:39:51,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 236 transitions. [2025-04-26 18:39:51,040 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2025-04-26 18:39:51,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 236 transitions. [2025-04-26 18:39:51,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2025-04-26 18:39:51,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2025-04-26 18:39:51,041 INFO L74 IsDeterministic]: Start isDeterministic. Operand 120 states and 236 transitions. [2025-04-26 18:39:51,041 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:51,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 236 transitions. [2025-04-26 18:39:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 236 transitions. [2025-04-26 18:39:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2025-04-26 18:39:51,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 2.018181818181818) internal successors, (in total 222), 109 states have internal predecessors, (222), 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:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 222 transitions. [2025-04-26 18:39:51,052 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 222 transitions. [2025-04-26 18:39:51,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:39:51,053 INFO L438 stractBuchiCegarLoop]: Abstraction has 110 states and 222 transitions. [2025-04-26 18:39:51,053 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:51,053 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 222 transitions. [2025-04-26 18:39:51,054 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:39:51,054 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:51,054 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:51,054 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:51,054 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:51,054 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L56: Formula: (and (= v_x_1_3 0) (= v_x_3_1 v_x_1_3) (= v_i_1_5 v_x_1_3) (= v_i_2_5 v_x_1_3) (= v_i_3_1 v_x_1_3) (= v_x_2_3 v_x_1_3)) InVars {x_1=v_x_1_3, x_2=v_x_2_3, x_3=v_x_3_1, i_2=v_i_2_5, i_3=v_i_3_1, i_1=v_i_1_5} OutVars{x_1=v_x_1_3, x_2=v_x_2_3, x_3=v_x_3_1, i_2=v_i_2_5, i_3=v_i_3_1, i_1=v_i_1_5} AuxVars[] AssignedVars[]" "[75] L56-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L23-1-->thread1FINAL: Formula: (<= v_c_2 v_i_1_4) InVars {c=v_c_2, i_1=v_i_1_4} OutVars{c=v_c_2, i_1=v_i_1_4} AuxVars[] AssignedVars[]" "[63] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[78] L56-1-->L34-1: 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]" "[65] L34-1-->thread2FINAL: Formula: (<= v_c_4 v_i_2_4) InVars {i_2=v_i_2_4, c=v_c_4} OutVars{i_2=v_i_2_4, c=v_c_4} AuxVars[] AssignedVars[]" "[67] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[81] L57-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:39:51,054 INFO L754 eck$LassoCheckResult]: Loop: "[70] L45-1-->L45: Formula: (< v_i_3_3 v_c_6) InVars {i_3=v_i_3_3, c=v_c_6} OutVars{i_3=v_i_3_3, c=v_c_6} AuxVars[] AssignedVars[]" "[72] L45-->L45-1: Formula: (and (= v_x_3_5 (+ v_a_5 v_b_5 v_x_3_6)) (= (+ v_i_3_7 1) v_i_3_6)) InVars {a=v_a_5, x_3=v_x_3_6, i_3=v_i_3_7, b=v_b_5} OutVars{a=v_a_5, x_3=v_x_3_5, i_3=v_i_3_6, b=v_b_5} AuxVars[] AssignedVars[x_3, i_3]" [2025-04-26 18:39:51,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1760238105, now seen corresponding path program 1 times [2025-04-26 18:39:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:51,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107272056] [2025-04-26 18:39:51,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:51,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:51,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:51,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:51,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:51,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:51,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:51,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:51,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:51,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:51,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:51,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:51,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2025-04-26 18:39:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:51,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087382225] [2025-04-26 18:39:51,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:51,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:51,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:51,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:51,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:51,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:51,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:51,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:51,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:51,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:51,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:51,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash -628293477, now seen corresponding path program 1 times [2025-04-26 18:39:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:51,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995362130] [2025-04-26 18:39:51,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:51,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:51,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:51,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:51,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:51,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:51,164 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:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:51,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995362130] [2025-04-26 18:39:51,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995362130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:51,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:51,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:39:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324530828] [2025-04-26 18:39:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:51,184 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:51,184 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:51,184 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:51,184 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:51,184 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:39:51,184 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:51,184 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:51,184 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:51,184 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-flipped-dist.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:39:51,185 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:51,185 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:51,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:51,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:51,216 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:51,216 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:39:51,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:51,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:51,218 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:51,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:39:51,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:39:51,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:51,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:39:51,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:51,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:51,237 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:51,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:39:51,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:39:51,239 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:39:51,304 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:39:51,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:39:51,308 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:51,308 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:51,308 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:51,309 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:51,309 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:51,309 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:51,309 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:51,309 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:51,309 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-flipped-dist.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:39:51,309 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:51,309 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:51,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:51,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:51,334 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:51,334 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:51,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:51,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:51,337 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:51,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:39:51,341 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:51,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:51,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:51,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:51,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:51,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:51,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:51,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:51,355 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:51,358 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:39:51,358 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:39:51,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:51,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:51,360 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:39:51,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:39:51,362 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:51,365 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:39:51,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:51,366 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:39:51,366 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:51,366 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(c, i_3) = 1*c - 1*i_3 Supporting invariants [] [2025-04-26 18:39:51,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:51,372 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:51,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:51,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:51,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:51,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:51,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:51,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:51,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:51,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:51,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:51,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:51,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:51,403 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:51,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:51,414 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:51,414 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:39:51,415 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 222 transitions. cyclomatic complexity: 133 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:51,455 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 222 transitions. cyclomatic complexity: 133. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 245 states and 497 transitions. Complement of second has 6 states. [2025-04-26 18:39:51,455 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:39:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 18:39:51,456 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:39:51,456 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:51,456 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:39:51,456 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:51,456 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:39:51,456 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:51,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 497 transitions. [2025-04-26 18:39:51,458 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:51,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 0 states and 0 transitions. [2025-04-26 18:39:51,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:51,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:51,459 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:51,459 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:51,459 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:51,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:51,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:51,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:39:51,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:39:51,459 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 4 states have internal predecessors, (10), 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:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:51,459 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:39:51,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:39:51,459 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:51,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:39:51,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:51,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:51,459 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:51,459 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:51,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:51,460 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:51,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:39:51,460 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:51,460 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:51,460 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:51,460 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:51,460 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:51,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:51,477 INFO L201 PluginConnector]: Adding new model mult-flipped-dist.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:51 BoogieIcfgContainer [2025-04-26 18:39:51,477 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:51,477 INFO L158 Benchmark]: Toolchain (without parser) took 2355.90ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 108.6MB in the end (delta: -25.0MB). Peak memory consumption was 66.0MB. Max. memory is 8.0GB. [2025-04-26 18:39:51,478 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.94ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 84.5MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:51,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.88ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 81.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:51,478 INFO L158 Benchmark]: Boogie Preprocessor took 28.01ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 80.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:51,478 INFO L158 Benchmark]: RCFGBuilder took 199.38ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 71.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:51,478 INFO L158 Benchmark]: BuchiAutomizer took 2090.53ms. Allocated memory is still 155.2MB. Free memory was 70.9MB in the beginning and 108.6MB in the end (delta: -37.7MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:51,481 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.94ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 84.5MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.88ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 81.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.01ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 80.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 199.38ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 71.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2090.53ms. Allocated memory is still 155.2MB. Free memory was 70.9MB in the beginning and 108.6MB in the end (delta: -37.7MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 38 StatesRemovedByMinimization, 3 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 33 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp69 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 186, Number of transitions in reduction automaton: 224, Number of states in reduction automaton: 111, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function c + -1 * i_1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i_2 + c and consists of 4 locations. One deterministic module has affine ranking function -1 * i_3 + c and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 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:51,494 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...