/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/popl20-bad/dot-product-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:49,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:49,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:49,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:49,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:49,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:49,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:49,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:49,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:49,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:49,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:49,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:49,781 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:49,781 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:49,781 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:49,781 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:49,781 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:49,781 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:49,781 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:49,781 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:49,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:49,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:49,783 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:49,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:49,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:49,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:49,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:49,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:49,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:49,784 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:49,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:49,784 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:49,784 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:49,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:49,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:49,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:49,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:49,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:49,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:49,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:49,785 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:49,785 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:49,785 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:50,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:50,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:50,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:50,055 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:50,055 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:50,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/dot-product-alt.wvr.bpl [2025-04-26 18:40:50,057 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/dot-product-alt.wvr.bpl' [2025-04-26 18:40:50,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:50,074 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:50,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:50,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:50,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:50,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/1) ... [2025-04-26 18:40:50,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/1) ... [2025-04-26 18:40:50,105 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:50,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:50,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:50,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:50,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:50,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/1) ... [2025-04-26 18:40:50,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/1) ... [2025-04-26 18:40:50,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/1) ... [2025-04-26 18:40:50,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/1) ... [2025-04-26 18:40:50,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/1) ... [2025-04-26 18:40:50,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/1) ... [2025-04-26 18:40:50,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/1) ... [2025-04-26 18:40:50,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/1) ... [2025-04-26 18:40:50,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/1) ... [2025-04-26 18:40:50,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:50,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:50,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:50,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:50,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/1) ... [2025-04-26 18:40:50,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:50,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:50,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:40:50,187 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:50,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:50,188 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:50,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:50,188 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:50,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:50,188 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:50,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:50,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:50,189 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:40:50,230 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:50,231 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:50,329 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:50,329 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:50,336 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:50,336 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:40:50,337 INFO L201 PluginConnector]: Adding new model dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:50 BoogieIcfgContainer [2025-04-26 18:40:50,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:50,338 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:50,338 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:50,342 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:50,343 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:50,343 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:50" (1/2) ... [2025-04-26 18:40:50,344 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16caa2c7 and model type dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:50, skipping insertion in model container [2025-04-26 18:40:50,344 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:50,344 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:50" (2/2) ... [2025-04-26 18:40:50,345 INFO L376 chiAutomizerObserver]: Analyzing ICFG dot-product-alt.wvr.bpl [2025-04-26 18:40:50,392 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:40:50,425 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:50,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:50,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:50,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:40:50,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 18:40:50,500 INFO L116 PetriNetUnfolderBase]: 3/29 cut-off events. [2025-04-26 18:40:50,503 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:40:50,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 18:40:50,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 91 flow [2025-04-26 18:40:50,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2025-04-26 18:40:50,511 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 29 transitions, 76 flow [2025-04-26 18:40:50,511 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 76 flow [2025-04-26 18:40:50,537 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 195 states, 193 states have (on average 2.8756476683937824) internal successors, (in total 555), 194 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:50,538 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 195 states, 193 states have (on average 2.8756476683937824) internal successors, (in total 555), 194 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:50,541 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:50,622 WARN L140 AmpleReduction]: Number of pruned transitions: 209 [2025-04-26 18:40:50,622 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:40:50,622 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 52 [2025-04-26 18:40:50,622 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 18:40:50,622 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:116 [2025-04-26 18:40:50,622 WARN L145 AmpleReduction]: Times succ was already a loop node:17 [2025-04-26 18:40:50,622 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:88 [2025-04-26 18:40:50,623 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:50,623 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 195 states, 193 states have (on average 1.7927461139896372) internal successors, (in total 346), 194 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:50,629 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:50,629 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:50,630 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:50,630 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:50,630 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:50,630 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:50,630 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:50,630 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:50,632 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 195 states, 193 states have (on average 1.7927461139896372) internal successors, (in total 346), 194 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:50,647 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 165 [2025-04-26 18:40:50,647 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:50,647 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:50,650 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:50,650 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:50,650 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:50,651 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 195 states, 193 states have (on average 1.7927461139896372) internal successors, (in total 346), 194 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:50,656 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 165 [2025-04-26 18:40:50,657 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:50,657 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:50,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:40:50,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:50,661 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L51: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[42] L51-->L52: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L52-->L53: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[65] L53-->L54: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[84] L54-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:50,662 INFO L754 eck$LassoCheckResult]: Loop: "[68] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[70] L24-->L25: Formula: (= (+ (select (select v_mult_1 (select v_A_1 v_i_2)) (select v_B_1 v_i_2)) v_res1_2) v_res1_1) InVars {A=v_A_1, i=v_i_2, res1=v_res1_2, mult=v_mult_1, B=v_B_1} OutVars{A=v_A_1, i=v_i_2, res1=v_res1_1, mult=v_mult_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[71] L25-->L23: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 18:40:50,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,665 INFO L85 PathProgramCache]: Analyzing trace with hash 86277796, now seen corresponding path program 1 times [2025-04-26 18:40:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708776313] [2025-04-26 18:40:50,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:50,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:50,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:50,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:50,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,753 INFO L85 PathProgramCache]: Analyzing trace with hash 97380, now seen corresponding path program 1 times [2025-04-26 18:40:50,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223359959] [2025-04-26 18:40:50,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:50,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:50,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:50,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:50,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1911445217, now seen corresponding path program 1 times [2025-04-26 18:40:50,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315312757] [2025-04-26 18:40:50,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:50,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:50,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:50,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:50,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,971 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:50,972 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:50,972 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:50,972 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:50,972 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:50,972 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,972 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:50,972 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:50,973 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product-alt.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:50,973 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:50,973 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:51,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,178 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:51,182 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:51,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:51,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:40:51,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:51,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:51,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:51,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:51,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:51,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:51,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:51,223 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:51,237 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:51,238 INFO L437 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:40:51,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:51,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:40:51,242 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:51,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:51,260 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:51,261 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:51,261 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 18:40:51,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:51,270 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:51,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:51,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:51,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:51,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:51,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:51,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:51,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:51,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:51,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:51,331 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:51,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:51,373 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:40:51,375 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 195 states, 193 states have (on average 1.7927461139896372) internal successors, (in total 346), 194 states have internal predecessors, (346), 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 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:51,479 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 195 states, 193 states have (on average 1.7927461139896372) internal successors, (in total 346), 194 states have internal predecessors, (346), 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 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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 424 states and 772 transitions. Complement of second has 7 states. [2025-04-26 18:40:51,481 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:40:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-04-26 18:40:51,490 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:40:51,490 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:51,493 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:40:51,493 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:51,493 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:40:51,493 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:51,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 424 states and 772 transitions. [2025-04-26 18:40:51,502 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 18:40:51,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 424 states to 209 states and 374 transitions. [2025-04-26 18:40:51,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2025-04-26 18:40:51,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2025-04-26 18:40:51,509 INFO L74 IsDeterministic]: Start isDeterministic. Operand 209 states and 374 transitions. [2025-04-26 18:40:51,510 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:51,510 INFO L218 hiAutomatonCegarLoop]: Abstraction has 209 states and 374 transitions. [2025-04-26 18:40:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 374 transitions. [2025-04-26 18:40:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 183. [2025-04-26 18:40:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 183 states have (on average 1.7978142076502732) internal successors, (in total 329), 182 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 329 transitions. [2025-04-26 18:40:51,534 INFO L240 hiAutomatonCegarLoop]: Abstraction has 183 states and 329 transitions. [2025-04-26 18:40:51,534 INFO L438 stractBuchiCegarLoop]: Abstraction has 183 states and 329 transitions. [2025-04-26 18:40:51,534 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:51,534 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 329 transitions. [2025-04-26 18:40:51,535 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 18:40:51,535 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:51,535 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:51,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:51,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:51,536 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L51: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[42] L51-->L52: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L52-->L53: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[65] L53-->L54: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[84] L54-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L23-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[69] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[87] L54-1-->L32: 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:40:51,536 INFO L754 eck$LassoCheckResult]: Loop: "[73] L32-->L33: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[75] L33-->L34: Formula: (= (+ (select (select v_mult_2 (select v_A_2 v_j_2)) (select v_B_2 v_j_2)) v_res2_2) v_res2_1) InVars {A=v_A_2, res2=v_res2_2, mult=v_mult_2, j=v_j_2, B=v_B_2} OutVars{A=v_A_2, res2=v_res2_1, mult=v_mult_2, j=v_j_2, B=v_B_2} AuxVars[] AssignedVars[res2]" "[76] L34-->L32: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" [2025-04-26 18:40:51,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1911444241, now seen corresponding path program 1 times [2025-04-26 18:40:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:51,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656563207] [2025-04-26 18:40:51,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:51,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:51,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:51,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:51,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:51,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656563207] [2025-04-26 18:40:51,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656563207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:51,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:51,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:40:51,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985743581] [2025-04-26 18:40:51,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:51,620 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:40:51,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 1 times [2025-04-26 18:40:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:51,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531661349] [2025-04-26 18:40:51,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:51,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:51,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:51,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:51,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:51,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:51,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:51,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:51,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:51,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:51,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:40:51,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:40:51,665 INFO L87 Difference]: Start difference. First operand 183 states and 329 transitions. cyclomatic complexity: 173 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:51,709 INFO L93 Difference]: Finished difference Result 186 states and 332 transitions. [2025-04-26 18:40:51,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 332 transitions. [2025-04-26 18:40:51,711 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 18:40:51,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 332 transitions. [2025-04-26 18:40:51,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2025-04-26 18:40:51,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2025-04-26 18:40:51,714 INFO L74 IsDeterministic]: Start isDeterministic. Operand 186 states and 332 transitions. [2025-04-26 18:40:51,714 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:51,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 332 transitions. [2025-04-26 18:40:51,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 332 transitions. [2025-04-26 18:40:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2025-04-26 18:40:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 183 states have (on average 1.7923497267759563) internal successors, (in total 328), 182 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:51,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 328 transitions. [2025-04-26 18:40:51,723 INFO L240 hiAutomatonCegarLoop]: Abstraction has 183 states and 328 transitions. [2025-04-26 18:40:51,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:40:51,724 INFO L438 stractBuchiCegarLoop]: Abstraction has 183 states and 328 transitions. [2025-04-26 18:40:51,724 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:51,724 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 328 transitions. [2025-04-26 18:40:51,725 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 18:40:51,725 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:51,725 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:51,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:51,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:51,725 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L51: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[42] L51-->L52: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L52-->L53: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[65] L53-->L54: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[84] L54-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[70] L24-->L25: Formula: (= (+ (select (select v_mult_1 (select v_A_1 v_i_2)) (select v_B_1 v_i_2)) v_res1_2) v_res1_1) InVars {A=v_A_1, i=v_i_2, res1=v_res1_2, mult=v_mult_1, B=v_B_1} OutVars{A=v_A_1, i=v_i_2, res1=v_res1_1, mult=v_mult_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[87] L54-1-->L32: 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]" "[71] L25-->L23: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[67] L23-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:40:51,725 INFO L754 eck$LassoCheckResult]: Loop: "[73] L32-->L33: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[75] L33-->L34: Formula: (= (+ (select (select v_mult_2 (select v_A_2 v_j_2)) (select v_B_2 v_j_2)) v_res2_2) v_res2_1) InVars {A=v_A_2, res2=v_res2_2, mult=v_mult_2, j=v_j_2, B=v_B_2} OutVars{A=v_A_2, res2=v_res2_1, mult=v_mult_2, j=v_j_2, B=v_B_2} AuxVars[] AssignedVars[res2]" "[76] L34-->L32: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" [2025-04-26 18:40:51,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:51,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1347131507, now seen corresponding path program 1 times [2025-04-26 18:40:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:51,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487082562] [2025-04-26 18:40:51,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:51,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:51,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:51,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:51,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:51,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:51,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:51,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:51,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:51,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 2 times [2025-04-26 18:40:51,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:51,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500630847] [2025-04-26 18:40:51,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:51,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:51,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:51,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:51,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:51,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:51,754 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:51,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:51,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:51,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:51,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:51,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash -220238659, now seen corresponding path program 1 times [2025-04-26 18:40:51,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:51,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092468230] [2025-04-26 18:40:51,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:51,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:51,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:51,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:51,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:51,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092468230] [2025-04-26 18:40:51,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092468230] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:51,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:51,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 18:40:51,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751472776] [2025-04-26 18:40:51,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:51,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:51,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:40:51,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:40:51,864 INFO L87 Difference]: Start difference. First operand 183 states and 328 transitions. cyclomatic complexity: 172 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (in total 13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:51,975 INFO L93 Difference]: Finished difference Result 217 states and 371 transitions. [2025-04-26 18:40:51,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 371 transitions. [2025-04-26 18:40:51,976 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 81 [2025-04-26 18:40:51,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 217 states and 371 transitions. [2025-04-26 18:40:51,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2025-04-26 18:40:51,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2025-04-26 18:40:51,978 INFO L74 IsDeterministic]: Start isDeterministic. Operand 217 states and 371 transitions. [2025-04-26 18:40:51,978 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:51,978 INFO L218 hiAutomatonCegarLoop]: Abstraction has 217 states and 371 transitions. [2025-04-26 18:40:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states and 371 transitions. [2025-04-26 18:40:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 192. [2025-04-26 18:40:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 192 states have (on average 1.7708333333333333) internal successors, (in total 340), 191 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 340 transitions. [2025-04-26 18:40:51,989 INFO L240 hiAutomatonCegarLoop]: Abstraction has 192 states and 340 transitions. [2025-04-26 18:40:51,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:40:51,991 INFO L438 stractBuchiCegarLoop]: Abstraction has 192 states and 340 transitions. [2025-04-26 18:40:51,991 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:51,991 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 340 transitions. [2025-04-26 18:40:51,992 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2025-04-26 18:40:51,992 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:51,992 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:51,992 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:51,992 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:51,993 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L51: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[42] L51-->L52: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L52-->L53: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[65] L53-->L54: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[84] L54-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[70] L24-->L25: Formula: (= (+ (select (select v_mult_1 (select v_A_1 v_i_2)) (select v_B_1 v_i_2)) v_res1_2) v_res1_1) InVars {A=v_A_1, i=v_i_2, res1=v_res1_2, mult=v_mult_1, B=v_B_1} OutVars{A=v_A_1, i=v_i_2, res1=v_res1_1, mult=v_mult_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[71] L25-->L23: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[68] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[70] L24-->L25: Formula: (= (+ (select (select v_mult_1 (select v_A_1 v_i_2)) (select v_B_1 v_i_2)) v_res1_2) v_res1_1) InVars {A=v_A_1, i=v_i_2, res1=v_res1_2, mult=v_mult_1, B=v_B_1} OutVars{A=v_A_1, i=v_i_2, res1=v_res1_1, mult=v_mult_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[87] L54-1-->L32: 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]" "[71] L25-->L23: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[67] L23-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:40:51,993 INFO L754 eck$LassoCheckResult]: Loop: "[73] L32-->L33: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[75] L33-->L34: Formula: (= (+ (select (select v_mult_2 (select v_A_2 v_j_2)) (select v_B_2 v_j_2)) v_res2_2) v_res2_1) InVars {A=v_A_2, res2=v_res2_2, mult=v_mult_2, j=v_j_2, B=v_B_2} OutVars{A=v_A_2, res2=v_res2_1, mult=v_mult_2, j=v_j_2, B=v_B_2} AuxVars[] AssignedVars[res2]" "[76] L34-->L32: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" [2025-04-26 18:40:51,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:51,993 INFO L85 PathProgramCache]: Analyzing trace with hash -680972944, now seen corresponding path program 2 times [2025-04-26 18:40:51,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:51,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585481574] [2025-04-26 18:40:51,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:51,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:51,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-26 18:40:52,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:52,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:40:52,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:52,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:52,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:52,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:52,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 3 times [2025-04-26 18:40:52,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:52,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998243042] [2025-04-26 18:40:52,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:40:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:52,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:52,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:52,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:40:52,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:52,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:52,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:52,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:52,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1734363142, now seen corresponding path program 2 times [2025-04-26 18:40:52,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:52,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845350562] [2025-04-26 18:40:52,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:52,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:52,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-26 18:40:52,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:40:52,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:40:52,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:52,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:40:52,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:40:52,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:52,216 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:52,217 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:52,217 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:52,217 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:52,217 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:52,217 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,217 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:52,217 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:52,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product-alt.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:40:52,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:52,217 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:52,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,409 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:52,409 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:52,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,414 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:52,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:40:52,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:52,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:52,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:52,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:52,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:52,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:52,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:52,430 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:52,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:40:52,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,440 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:52,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:40:52,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:52,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:52,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:52,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:52,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:52,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:52,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:52,459 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:52,470 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:40:52,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,472 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:40:52,473 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:40:52,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:52,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:52,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:52,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:52,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:52,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:52,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:52,493 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:52,503 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:52,504 INFO L437 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:40:52,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,506 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:40:52,507 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:40:52,508 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:52,525 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:40:52,525 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:52,525 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:52,525 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 18:40:52,531 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:40:52,533 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:52,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:40:52,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:40:52,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:52,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:52,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:52,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:52,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:52,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:52,576 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:52,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:52,596 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:40:52,596 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 192 states and 340 transitions. cyclomatic complexity: 175 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:52,636 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 192 states and 340 transitions. cyclomatic complexity: 175. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 405 states and 765 transitions. Complement of second has 6 states. [2025-04-26 18:40:52,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 18:40:52,637 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 18:40:52,637 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:52,637 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 16 letters. Loop has 3 letters. [2025-04-26 18:40:52,638 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:52,638 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 13 letters. Loop has 6 letters. [2025-04-26 18:40:52,638 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:52,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 405 states and 765 transitions. [2025-04-26 18:40:52,640 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:40:52,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 405 states to 249 states and 443 transitions. [2025-04-26 18:40:52,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2025-04-26 18:40:52,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-04-26 18:40:52,644 INFO L74 IsDeterministic]: Start isDeterministic. Operand 249 states and 443 transitions. [2025-04-26 18:40:52,644 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:52,644 INFO L218 hiAutomatonCegarLoop]: Abstraction has 249 states and 443 transitions. [2025-04-26 18:40:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 443 transitions. [2025-04-26 18:40:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 212. [2025-04-26 18:40:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 212 states have (on average 1.8396226415094339) internal successors, (in total 390), 211 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 390 transitions. [2025-04-26 18:40:52,660 INFO L240 hiAutomatonCegarLoop]: Abstraction has 212 states and 390 transitions. [2025-04-26 18:40:52,661 INFO L438 stractBuchiCegarLoop]: Abstraction has 212 states and 390 transitions. [2025-04-26 18:40:52,661 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:40:52,661 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 390 transitions. [2025-04-26 18:40:52,661 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:40:52,662 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:52,662 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:52,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:52,662 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:52,662 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L51: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[42] L51-->L52: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L52-->L53: Formula: (and (= v_i_6 v_res2_3) (= v_i_6 v_res1_3) (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} OutVars{i=v_i_6, res2=v_res2_3, res1=v_res1_3, j=v_j_6} AuxVars[] AssignedVars[]" "[65] L53-->L54: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[84] L54-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[70] L24-->L25: Formula: (= (+ (select (select v_mult_1 (select v_A_1 v_i_2)) (select v_B_1 v_i_2)) v_res1_2) v_res1_1) InVars {A=v_A_1, i=v_i_2, res1=v_res1_2, mult=v_mult_1, B=v_B_1} OutVars{A=v_A_1, i=v_i_2, res1=v_res1_1, mult=v_mult_1, B=v_B_1} AuxVars[] AssignedVars[res1]" "[87] L54-1-->L32: 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]" "[71] L25-->L23: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[67] L23-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[72] L32-->thread2FINAL: Formula: (<= v_M_2 v_j_5) InVars {M=v_M_2, j=v_j_5} OutVars{M=v_M_2, j=v_j_5} AuxVars[] AssignedVars[]" "[69] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[74] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[90] L55-->L41: 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:40:52,662 INFO L754 eck$LassoCheckResult]: Loop: "[78] L41-->L42: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[80] L42-->L43: Formula: (= v_res2_5 (+ (select (select v_mult_3 (select v_A_3 v_k_3)) (select v_B_3 v_k_3)) v_res2_6)) InVars {A=v_A_3, res2=v_res2_6, k=v_k_3, mult=v_mult_3, B=v_B_3} OutVars{A=v_A_3, res2=v_res2_5, k=v_k_3, mult=v_mult_3, B=v_B_3} AuxVars[] AssignedVars[res2]" "[81] L43-->L41: Formula: (= v_k_4 (+ v_k_5 1)) InVars {k=v_k_5} OutVars{k=v_k_4} AuxVars[] AssignedVars[k]" [2025-04-26 18:40:52,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1762500634, now seen corresponding path program 1 times [2025-04-26 18:40:52,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:52,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072329042] [2025-04-26 18:40:52,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:52,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:52,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:52,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:52,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:52,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:52,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:52,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:52,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash 107310, now seen corresponding path program 1 times [2025-04-26 18:40:52,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:52,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69509837] [2025-04-26 18:40:52,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:52,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:52,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:52,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,677 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:52,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:52,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:52,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:52,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash 681271413, now seen corresponding path program 1 times [2025-04-26 18:40:52,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:52,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806755896] [2025-04-26 18:40:52,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:52,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:52,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:40:52,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:40:52,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,686 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:52,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:40:52,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:40:52,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:52,839 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:52,840 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:52,840 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:52,840 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:52,840 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:52,840 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,840 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:52,840 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:52,840 INFO L132 ssoRankerPreferences]: Filename of dumped script: dot-product-alt.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:40:52,840 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:52,840 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:52,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,003 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:53,003 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:53,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,014 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:40:53,015 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:40:53,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,029 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,035 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:40:53,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,038 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:40:53,038 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:40:53,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,057 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,063 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:40:53,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,065 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:40:53,066 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:40:53,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,082 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,088 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:40:53,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,090 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:40:53,091 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:40:53,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,107 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,113 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:40:53,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,115 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:40:53,115 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:40:53,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,131 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,137 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:40:53,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,139 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:40:53,142 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:40:53,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,176 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:53,185 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:40:53,185 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:40:53,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,187 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:40:53,189 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:40:53,190 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:53,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:40:53,207 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:53,207 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:53,207 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 18:40:53,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:53,214 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:53,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:53,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:53,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:53,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:53,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:53,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:53,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:53,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:53,254 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:53,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:53,268 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:40:53,268 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 212 states and 390 transitions. cyclomatic complexity: 197 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:53,299 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 212 states and 390 transitions. cyclomatic complexity: 197. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 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 456 states and 839 transitions. Complement of second has 6 states. [2025-04-26 18:40:53,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 18:40:53,300 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 18:40:53,300 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:53,300 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 17 letters. Loop has 3 letters. [2025-04-26 18:40:53,301 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:53,301 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 14 letters. Loop has 6 letters. [2025-04-26 18:40:53,301 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:53,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 456 states and 839 transitions. [2025-04-26 18:40:53,303 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:53,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 456 states to 0 states and 0 transitions. [2025-04-26 18:40:53,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:53,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:53,303 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:53,303 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:53,303 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:53,303 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:53,303 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:53,303 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:40:53,304 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:53,304 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:53,304 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:53,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:40:53,314 INFO L201 PluginConnector]: Adding new model dot-product-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:53 BoogieIcfgContainer [2025-04-26 18:40:53,315 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:53,315 INFO L158 Benchmark]: Toolchain (without parser) took 3240.81ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 83.2MB in the beginning and 98.2MB in the end (delta: -15.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:53,315 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:53,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.37ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 81.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:53,316 INFO L158 Benchmark]: Boogie Preprocessor took 22.79ms. Allocated memory is still 155.2MB. Free memory was 81.3MB in the beginning and 80.3MB in the end (delta: 971.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:53,316 INFO L158 Benchmark]: RCFGBuilder took 204.72ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 71.0MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:40:53,316 INFO L158 Benchmark]: BuchiAutomizer took 2977.06ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 70.9MB in the beginning and 98.2MB in the end (delta: -27.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:53,321 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.19ms. Allocated memory is still 155.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.37ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 81.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.79ms. Allocated memory is still 155.2MB. Free memory was 81.3MB in the beginning and 80.3MB in the end (delta: 971.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 204.72ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 71.0MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2977.06ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 70.9MB in the beginning and 98.2MB in the end (delta: -27.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 91 StatesRemovedByMinimization, 4 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, 271 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 200 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 103 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital72 mio100 ax100 hnf100 lsp75 ukn81 mio100 lsp59 div100 bol100 ite100 ukn100 eq163 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 78ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 201, Number of transitions in reduction automaton: 346, Number of states in reduction automaton: 195, 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 N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:40:53,331 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...