/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-proofs/counter-add-4-semi-Q67.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:14:14,130 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:14:14,165 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:14:14,191 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:14:14,192 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:14:14,192 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:14:14,193 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:14:14,193 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:14:14,193 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:14:14,194 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:14:14,194 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:14:14,194 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:14:14,194 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:14:14,194 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:14:14,195 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:14:14,195 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:14:14,195 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:14:14,195 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:14:14,196 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:14:14,196 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:14:14,196 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:14:14,200 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:14:14,202 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:14:14,202 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:14:14,204 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:14:14,205 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:14:14,205 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:14:14,206 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:14:14,206 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:14:14,206 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:14:14,207 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:14:14,207 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:14:14,207 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:14:14,208 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:14:14,208 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2023-10-12 17:14:14,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:14:14,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:14:14,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:14:14,376 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:14:14,378 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:14:14,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-proofs/counter-add-4-semi-Q67.wvr.bpl [2023-10-12 17:14:14,379 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-proofs/counter-add-4-semi-Q67.wvr.bpl' [2023-10-12 17:14:14,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:14:14,395 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:14:14,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:14,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:14:14,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:14:14,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:14" (1/1) ... [2023-10-12 17:14:14,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:14" (1/1) ... [2023-10-12 17:14:14,412 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:14:14,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:14,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:14:14,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:14:14,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:14:14,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:14" (1/1) ... [2023-10-12 17:14:14,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:14" (1/1) ... [2023-10-12 17:14:14,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:14" (1/1) ... [2023-10-12 17:14:14,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:14" (1/1) ... [2023-10-12 17:14:14,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:14" (1/1) ... [2023-10-12 17:14:14,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:14" (1/1) ... [2023-10-12 17:14:14,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:14" (1/1) ... [2023-10-12 17:14:14,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:14" (1/1) ... [2023-10-12 17:14:14,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:14:14,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:14:14,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:14:14,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:14:14,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:14" (1/1) ... [2023-10-12 17:14:14,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:14,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:14,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:14:14,485 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:14:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:14:14,485 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:14:14,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:14:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:14:14,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:14:14,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:14:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:14:14,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:14:14,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:14:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:14:14,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:14:14,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:14:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:14:14,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:14:14,487 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:14:14,529 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:14:14,530 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:14:14,619 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:14:14,633 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:14:14,634 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:14:14,635 INFO L201 PluginConnector]: Adding new model counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:14 BoogieIcfgContainer [2023-10-12 17:14:14,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:14:14,636 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:14:14,636 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:14:14,638 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:14:14,638 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:14,639 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:14" (1/2) ... [2023-10-12 17:14:14,639 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5be7de89 and model type counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:14:14, skipping insertion in model container [2023-10-12 17:14:14,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:14,640 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:14" (2/2) ... [2023-10-12 17:14:14,640 INFO L332 chiAutomizerObserver]: Analyzing ICFG counter-add-4-semi-Q67.wvr.bpl [2023-10-12 17:14:14,679 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:14:14,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:14:14,711 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:14:14,712 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:14:14,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-10-12 17:14:14,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:14:14,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2023-10-12 17:14:14,719 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:14:14,728 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:14:14,729 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:14:14,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 86 flow [2023-10-12 17:14:14,735 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:14:14,735 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:14:14,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-10-12 17:14:14,736 INFO L119 LiptonReduction]: Number of co-enabled transitions 288 [2023-10-12 17:14:14,958 INFO L134 LiptonReduction]: Checked pairs total: 192 [2023-10-12 17:14:14,958 INFO L136 LiptonReduction]: Total number of compositions: 13 [2023-10-12 17:14:14,978 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:14:14,978 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:14:14,978 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:14:14,978 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:14:14,978 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:14:14,978 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:14:14,978 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:14:14,978 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:14:14,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:14:15,005 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 37 [2023-10-12 17:14:15,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:15,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:15,009 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:15,009 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:15,009 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:14:15,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 48 states, but on-demand construction may add more states [2023-10-12 17:14:15,013 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 37 [2023-10-12 17:14:15,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:15,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:15,013 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:15,013 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:15,016 INFO L748 eck$LassoCheckResult]: Stem: 47#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 50#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L23-1, L71-1]don't care [2023-10-12 17:14:15,016 INFO L750 eck$LassoCheckResult]: Loop: 52#[L23-1, L71-1]don't care [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 52#[L23-1, L71-1]don't care [2023-10-12 17:14:15,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 5095, now seen corresponding path program 1 times [2023-10-12 17:14:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:15,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834912325] [2023-10-12 17:14:15,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:15,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash 155, now seen corresponding path program 1 times [2023-10-12 17:14:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:15,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920354935] [2023-10-12 17:14:15,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:15,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:15,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash 158069, now seen corresponding path program 1 times [2023-10-12 17:14:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:15,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837033278] [2023-10-12 17:14:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:15,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:15,202 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:15,202 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:15,202 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:15,202 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:15,203 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:15,203 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,203 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:15,203 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:15,203 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:14:15,203 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:15,203 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:15,213 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:15,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:15,254 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:15,255 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:15,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:15,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:14:15,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:15,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:15,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:15,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,335 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:15,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:15,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:15,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:14:15,469 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:15,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:15,475 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:15,476 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:15,476 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:15,476 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:15,476 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:15,476 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,476 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:15,476 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:15,476 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:14:15,476 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:15,476 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:15,477 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:15,486 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:15,513 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:15,516 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:15,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:15,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:14:15,522 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 [2023-10-12 17:14:15,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:15,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:15,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:15,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:15,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:15,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:15,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:15,556 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:15,560 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:14:15,560 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:14:15,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:15,605 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:15,605 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:15,606 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:15,606 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N1) = -1*i1 + 1*N1 Supporting invariants [] [2023-10-12 17:14:15,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:14:15,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:14:15,625 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:15,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:15,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:15,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:15,668 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:15,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:15,687 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:15,688 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 48 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:15,760 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 48 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 137 states and 541 transitions. Complement of second has 5 states. [2023-10-12 17:14:15,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2023-10-12 17:14:15,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:14:15,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:15,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:15,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:15,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:14:15,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:15,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 541 transitions. [2023-10-12 17:14:15,785 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 33 [2023-10-12 17:14:15,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 94 states and 381 transitions. [2023-10-12 17:14:15,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2023-10-12 17:14:15,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2023-10-12 17:14:15,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 381 transitions. [2023-10-12 17:14:15,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:15,791 INFO L219 hiAutomatonCegarLoop]: Abstraction has 94 states and 381 transitions. [2023-10-12 17:14:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 381 transitions. [2023-10-12 17:14:15,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2023-10-12 17:14:15,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 4.220588235294118) internal successors, (287), 67 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 287 transitions. [2023-10-12 17:14:15,830 INFO L241 hiAutomatonCegarLoop]: Abstraction has 68 states and 287 transitions. [2023-10-12 17:14:15,830 INFO L430 stractBuchiCegarLoop]: Abstraction has 68 states and 287 transitions. [2023-10-12 17:14:15,830 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:15,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 287 transitions. [2023-10-12 17:14:15,839 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 33 [2023-10-12 17:14:15,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:15,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:15,840 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:15,840 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:15,840 INFO L748 eck$LassoCheckResult]: Stem: 439#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 361#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 363#[L23-1, L71-1]don't care [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 399#[L72, L34-1, L23-1]don't care [2023-10-12 17:14:15,840 INFO L750 eck$LassoCheckResult]: Loop: 399#[L72, L34-1, L23-1]don't care [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 399#[L72, L34-1, L23-1]don't care [2023-10-12 17:14:15,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash 158052, now seen corresponding path program 1 times [2023-10-12 17:14:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:15,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222887784] [2023-10-12 17:14:15,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:15,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:15,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:15,853 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 1 times [2023-10-12 17:14:15,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:15,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166202746] [2023-10-12 17:14:15,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:15,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:15,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash 4899733, now seen corresponding path program 1 times [2023-10-12 17:14:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:15,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791311917] [2023-10-12 17:14:15,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:15,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:15,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:15,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791311917] [2023-10-12 17:14:15,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791311917] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:15,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:15,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889915906] [2023-10-12 17:14:15,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:15,925 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:15,926 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:15,926 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:15,926 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:15,926 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:15,926 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,926 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:15,926 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:15,926 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:14:15,927 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:15,927 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:15,927 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:15,931 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:15,960 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:15,960 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:15,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,977 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:15,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:14:15,981 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:15,981 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:16,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:16,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:16,006 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:16,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:14:16,010 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:16,010 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:16,041 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:16,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:16,046 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:16,046 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:16,046 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:16,046 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:16,046 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:16,047 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,047 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:16,047 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:16,047 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:14:16,047 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:16,047 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:16,047 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:16,054 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:16,081 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:16,082 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:16,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:16,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:16,090 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 [2023-10-12 17:14:16,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:16,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:16,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:16,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:16,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:16,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:16,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:16,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:14:16,109 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:16,111 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:14:16,111 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:14:16,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:16,122 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:16,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:14:16,169 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:16,169 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:16,170 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:16,170 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:14:16,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:14:16,174 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:16,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:16,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,203 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:16,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:16,204 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:16,204 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 68 states and 287 transitions. cyclomatic complexity: 266 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:16,243 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 68 states and 287 transitions. cyclomatic complexity: 266. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 247 states and 925 transitions. Complement of second has 5 states. [2023-10-12 17:14:16,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2023-10-12 17:14:16,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:16,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:14:16,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:14:16,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 247 states and 925 transitions. [2023-10-12 17:14:16,249 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 33 [2023-10-12 17:14:16,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 247 states to 184 states and 703 transitions. [2023-10-12 17:14:16,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2023-10-12 17:14:16,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2023-10-12 17:14:16,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 703 transitions. [2023-10-12 17:14:16,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:16,253 INFO L219 hiAutomatonCegarLoop]: Abstraction has 184 states and 703 transitions. [2023-10-12 17:14:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 703 transitions. [2023-10-12 17:14:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 147. [2023-10-12 17:14:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 3.945578231292517) internal successors, (580), 146 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 580 transitions. [2023-10-12 17:14:16,261 INFO L241 hiAutomatonCegarLoop]: Abstraction has 147 states and 580 transitions. [2023-10-12 17:14:16,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:16,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:16,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:16,263 INFO L87 Difference]: Start difference. First operand 147 states and 580 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:16,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:16,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:14:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:16,345 INFO L93 Difference]: Finished difference Result 212 states and 728 transitions. [2023-10-12 17:14:16,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 728 transitions. [2023-10-12 17:14:16,348 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 33 [2023-10-12 17:14:16,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 184 states and 679 transitions. [2023-10-12 17:14:16,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2023-10-12 17:14:16,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2023-10-12 17:14:16,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 679 transitions. [2023-10-12 17:14:16,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:16,352 INFO L219 hiAutomatonCegarLoop]: Abstraction has 184 states and 679 transitions. [2023-10-12 17:14:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 679 transitions. [2023-10-12 17:14:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 150. [2023-10-12 17:14:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 3.9133333333333336) internal successors, (587), 149 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 587 transitions. [2023-10-12 17:14:16,363 INFO L241 hiAutomatonCegarLoop]: Abstraction has 150 states and 587 transitions. [2023-10-12 17:14:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:16,370 INFO L430 stractBuchiCegarLoop]: Abstraction has 150 states and 587 transitions. [2023-10-12 17:14:16,370 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:16,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 587 transitions. [2023-10-12 17:14:16,371 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 33 [2023-10-12 17:14:16,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:16,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:16,371 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:14:16,371 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:16,372 INFO L748 eck$LassoCheckResult]: Stem: 1424#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 1282#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1284#[L23-1, L71-1]don't care [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1368#[L72, L34-1, L23-1]don't care [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 1484#[L72, L34-1, L23-1]don't care [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 1490#[L72, L34-1, L23-1]don't care [2023-10-12 17:14:16,372 INFO L750 eck$LassoCheckResult]: Loop: 1490#[L72, L34-1, L23-1]don't care [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 1490#[L72, L34-1, L23-1]don't care [2023-10-12 17:14:16,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash 151891937, now seen corresponding path program 1 times [2023-10-12 17:14:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:16,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082669485] [2023-10-12 17:14:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:16,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:16,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:16,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 2 times [2023-10-12 17:14:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:16,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320497508] [2023-10-12 17:14:16,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:16,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:16,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:16,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash 413682872, now seen corresponding path program 2 times [2023-10-12 17:14:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:16,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232077674] [2023-10-12 17:14:16,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:16,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:16,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232077674] [2023-10-12 17:14:16,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232077674] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:16,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:16,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:14:16,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397402250] [2023-10-12 17:14:16,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:16,443 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:16,443 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:16,443 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:16,444 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:16,444 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:16,444 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,444 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:16,444 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:16,444 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:14:16,444 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:16,444 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:16,444 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:16,449 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:16,472 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:16,472 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:16,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:16,485 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:16,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:14:16,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:16,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:16,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:14:16,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:16,589 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:16,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:16,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:16,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:14:16,610 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:16,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:16,614 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:16,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:16,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:16,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:16,614 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:16,614 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,614 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:16,614 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:16,614 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:14:16,614 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:16,614 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:16,615 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:16,627 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:16,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:16,651 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:16,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:16,773 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:16,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:14:16,779 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 [2023-10-12 17:14:16,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:16,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:16,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:16,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:16,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:16,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:16,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:16,816 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:16,819 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:14:16,819 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:14:16,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:16,821 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:16,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:14:16,858 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:16,859 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:16,859 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:16,859 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:14:16,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:16,863 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:16,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:16,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,897 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:16,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:16,898 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:16,898 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 150 states and 587 transitions. cyclomatic complexity: 505 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:16,940 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 150 states and 587 transitions. cyclomatic complexity: 505. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 547 states and 2031 transitions. Complement of second has 5 states. [2023-10-12 17:14:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2023-10-12 17:14:16,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:14:16,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:14:16,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:14:16,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 547 states and 2031 transitions. [2023-10-12 17:14:16,947 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 59 [2023-10-12 17:14:16,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 547 states to 399 states and 1522 transitions. [2023-10-12 17:14:16,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2023-10-12 17:14:16,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2023-10-12 17:14:16,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 399 states and 1522 transitions. [2023-10-12 17:14:16,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:16,952 INFO L219 hiAutomatonCegarLoop]: Abstraction has 399 states and 1522 transitions. [2023-10-12 17:14:16,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states and 1522 transitions. [2023-10-12 17:14:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 217. [2023-10-12 17:14:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 217 states have (on average 4.299539170506913) internal successors, (933), 216 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 933 transitions. [2023-10-12 17:14:16,960 INFO L241 hiAutomatonCegarLoop]: Abstraction has 217 states and 933 transitions. [2023-10-12 17:14:16,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:16,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:14:16,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:14:16,961 INFO L87 Difference]: Start difference. First operand 217 states and 933 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:17,005 INFO L93 Difference]: Finished difference Result 538 states and 2058 transitions. [2023-10-12 17:14:17,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 538 states and 2058 transitions. [2023-10-12 17:14:17,011 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 74 [2023-10-12 17:14:17,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 538 states to 469 states and 1797 transitions. [2023-10-12 17:14:17,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2023-10-12 17:14:17,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2023-10-12 17:14:17,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 469 states and 1797 transitions. [2023-10-12 17:14:17,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:17,015 INFO L219 hiAutomatonCegarLoop]: Abstraction has 469 states and 1797 transitions. [2023-10-12 17:14:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states and 1797 transitions. [2023-10-12 17:14:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 349. [2023-10-12 17:14:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 349 states have (on average 4.1203438395415475) internal successors, (1438), 348 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1438 transitions. [2023-10-12 17:14:17,025 INFO L241 hiAutomatonCegarLoop]: Abstraction has 349 states and 1438 transitions. [2023-10-12 17:14:17,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:14:17,025 INFO L430 stractBuchiCegarLoop]: Abstraction has 349 states and 1438 transitions. [2023-10-12 17:14:17,025 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:14:17,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 349 states and 1438 transitions. [2023-10-12 17:14:17,028 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 74 [2023-10-12 17:14:17,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:17,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:17,028 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:14:17,028 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:17,029 INFO L748 eck$LassoCheckResult]: Stem: 3312#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 3146#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 3148#[L23-1, L71-1]don't care [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3248#[L72, L34-1, L23-1]don't care [110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 3184#[L73, L46-1, L23-1, L34-1]don't care [113] L73-->L57-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 3104#[L46-1, L74, L57-1, L34-1, L23-1]don't care [2023-10-12 17:14:17,029 INFO L750 eck$LassoCheckResult]: Loop: 3104#[L46-1, L74, L57-1, L34-1, L23-1]don't care [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 3106#[L46-1, L74, L57-1, L34-1, L23-1]don't care [127] L57-1-->L57-1: Formula: (and (= v_j2_12 (+ v_j2_13 1)) (< 0 v_counter_52) (< v_j2_13 v_M2_8) (= v_counter_52 (+ v_counter_51 1))) InVars {counter=v_counter_52, j2=v_j2_13, M2=v_M2_8} OutVars{counter=v_counter_51, j2=v_j2_12, M2=v_M2_8} AuxVars[] AssignedVars[counter, j2] 3104#[L46-1, L74, L57-1, L34-1, L23-1]don't care [2023-10-12 17:14:17,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash 151891495, now seen corresponding path program 1 times [2023-10-12 17:14:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:17,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366541079] [2023-10-12 17:14:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:17,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:17,036 INFO L85 PathProgramCache]: Analyzing trace with hash 4777, now seen corresponding path program 1 times [2023-10-12 17:14:17,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:17,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832354255] [2023-10-12 17:14:17,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:17,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:17,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash -61157553, now seen corresponding path program 1 times [2023-10-12 17:14:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:17,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078582643] [2023-10-12 17:14:17,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:17,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:17,088 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:17,088 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:17,088 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:17,088 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:17,088 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:17,088 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,088 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:17,088 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:17,088 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:14:17,088 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:17,088 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:17,089 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:17,092 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:17,096 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:17,127 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:17,127 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:17,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,141 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:17,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:14:17,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:17,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:17,189 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:14:17,189 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=0} Honda state: {counter=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:14:17,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-10-12 17:14:17,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,209 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:17,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:14:17,218 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:17,219 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:17,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:14:17,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,236 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:17,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:14:17,298 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:17,298 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:17,389 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:17,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:17,393 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:17,393 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:17,393 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:17,393 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:17,393 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:17,393 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,393 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:17,393 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:17,393 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:14:17,393 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:17,393 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:17,394 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:17,412 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:17,423 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:17,451 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:17,451 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:17,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,582 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:17,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:14:17,585 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 [2023-10-12 17:14:17,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:17,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:17,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:17,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:17,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:17,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:17,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:17,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:17,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:17,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,625 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:17,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:14:17,678 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 [2023-10-12 17:14:17,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:17,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:17,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:17,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:17,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:17,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:17,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:17,710 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:17,714 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:17,714 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:14:17,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,715 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:17,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:14:17,718 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:17,718 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:17,718 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:17,719 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j1, M1) = -1*j1 + 1*M1 Supporting invariants [] [2023-10-12 17:14:17,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:17,725 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:17,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:17,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:17,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:17,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:17,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:17,792 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 [2023-10-12 17:14:17,793 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 349 states and 1438 transitions. cyclomatic complexity: 1206 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:17,822 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 349 states and 1438 transitions. cyclomatic complexity: 1206. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 797 states and 3524 transitions. Complement of second has 4 states. [2023-10-12 17:14:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2023-10-12 17:14:17,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:14:17,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:17,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:14:17,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:17,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:14:17,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:17,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 797 states and 3524 transitions. [2023-10-12 17:14:17,832 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 41 [2023-10-12 17:14:17,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 797 states to 577 states and 2298 transitions. [2023-10-12 17:14:17,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2023-10-12 17:14:17,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2023-10-12 17:14:17,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 577 states and 2298 transitions. [2023-10-12 17:14:17,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:17,837 INFO L219 hiAutomatonCegarLoop]: Abstraction has 577 states and 2298 transitions. [2023-10-12 17:14:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states and 2298 transitions. [2023-10-12 17:14:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 481. [2023-10-12 17:14:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 481 states have (on average 4.101871101871102) internal successors, (1973), 480 states have internal predecessors, (1973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1973 transitions. [2023-10-12 17:14:17,846 INFO L241 hiAutomatonCegarLoop]: Abstraction has 481 states and 1973 transitions. [2023-10-12 17:14:17,846 INFO L430 stractBuchiCegarLoop]: Abstraction has 481 states and 1973 transitions. [2023-10-12 17:14:17,846 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:14:17,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 481 states and 1973 transitions. [2023-10-12 17:14:17,849 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 41 [2023-10-12 17:14:17,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:17,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:17,850 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:14:17,850 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:17,850 INFO L748 eck$LassoCheckResult]: Stem: 4841#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 4665#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 4667#[L23-1, L71-1]don't care [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 4767#[L72, L34-1, L23-1]don't care [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 5083#[L72, L34-1, L23-1]don't care [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 5101#[L72, L34-1, L23-1]don't care [110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 5011#[L73, L46-1, L23-1, L34-1]don't care [2023-10-12 17:14:17,850 INFO L750 eck$LassoCheckResult]: Loop: 5011#[L73, L46-1, L23-1, L34-1]don't care [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 5111#[L73, L46-1, L23-1, L34-1]don't care [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 5011#[L73, L46-1, L23-1, L34-1]don't care [2023-10-12 17:14:17,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:17,850 INFO L85 PathProgramCache]: Analyzing trace with hash 413682861, now seen corresponding path program 1 times [2023-10-12 17:14:17,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:17,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463178567] [2023-10-12 17:14:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:17,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash 4771, now seen corresponding path program 1 times [2023-10-12 17:14:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:17,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101844346] [2023-10-12 17:14:17,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:17,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:17,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1882725297, now seen corresponding path program 1 times [2023-10-12 17:14:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063863583] [2023-10-12 17:14:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:17,905 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:17,905 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:17,905 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:17,905 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:17,905 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:17,906 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,906 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:17,906 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:17,906 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration5_Loop [2023-10-12 17:14:17,906 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:17,906 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:17,906 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:17,910 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:17,915 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:17,942 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:17,942 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:17,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,961 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:17,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:14:17,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:18,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:18,025 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:14:18,025 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=0} Honda state: {counter=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:14:18,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:18,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,061 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:18,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:14:18,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:18,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:18,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:18,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,116 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:18,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:14:18,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:18,135 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:18,234 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:18,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:18,239 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:18,239 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:18,239 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:18,239 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:18,239 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:18,240 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,240 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:18,240 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:18,240 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration5_Loop [2023-10-12 17:14:18,240 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:18,240 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:18,240 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:18,245 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:18,249 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:18,279 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:18,279 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:18,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,280 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:18,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:14:18,283 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 [2023-10-12 17:14:18,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:18,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:18,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:18,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:18,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:18,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,311 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:18,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:14:18,314 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 [2023-10-12 17:14:18,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:18,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:18,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:18,361 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:18,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:18,363 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:18,363 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:14:18,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,364 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:18,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:14:18,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:14:18,391 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:18,391 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:18,391 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:18,391 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2023-10-12 17:14:18,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:18,399 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:18,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:18,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:18,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:18,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:18,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:18,429 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:18,429 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 481 states and 1973 transitions. cyclomatic complexity: 1636 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:18,464 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 481 states and 1973 transitions. cyclomatic complexity: 1636. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1204 states and 5145 transitions. Complement of second has 4 states. [2023-10-12 17:14:18,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2023-10-12 17:14:18,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:14:18,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:18,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:18,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:18,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:14:18,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:18,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1204 states and 5145 transitions. [2023-10-12 17:14:18,478 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 29 [2023-10-12 17:14:18,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1204 states to 759 states and 3028 transitions. [2023-10-12 17:14:18,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 185 [2023-10-12 17:14:18,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2023-10-12 17:14:18,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 759 states and 3028 transitions. [2023-10-12 17:14:18,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:18,485 INFO L219 hiAutomatonCegarLoop]: Abstraction has 759 states and 3028 transitions. [2023-10-12 17:14:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states and 3028 transitions. [2023-10-12 17:14:18,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 540. [2023-10-12 17:14:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 540 states have (on average 4.087037037037037) internal successors, (2207), 539 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 2207 transitions. [2023-10-12 17:14:18,497 INFO L241 hiAutomatonCegarLoop]: Abstraction has 540 states and 2207 transitions. [2023-10-12 17:14:18,497 INFO L430 stractBuchiCegarLoop]: Abstraction has 540 states and 2207 transitions. [2023-10-12 17:14:18,497 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:14:18,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 540 states and 2207 transitions. [2023-10-12 17:14:18,500 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2023-10-12 17:14:18,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:18,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:18,501 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:14:18,501 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:18,502 INFO L748 eck$LassoCheckResult]: Stem: 7033#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 6857#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 6859#[L23-1, L71-1]don't care [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 6937#[L72, L34-1, L23-1]don't care [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 6941#[L72, L34-1, L23-1]don't care [110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 7545#[L73, L46-1, L23-1, L34-1]don't care [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 6909#[L73, L46-1, L23-1, L34-1]don't care [2023-10-12 17:14:18,502 INFO L750 eck$LassoCheckResult]: Loop: 6909#[L73, L46-1, L23-1, L34-1]don't care [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 6909#[L73, L46-1, L23-1, L34-1]don't care [2023-10-12 17:14:18,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:18,502 INFO L85 PathProgramCache]: Analyzing trace with hash 413682529, now seen corresponding path program 1 times [2023-10-12 17:14:18,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:18,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337249505] [2023-10-12 17:14:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:18,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash 150, now seen corresponding path program 1 times [2023-10-12 17:14:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:18,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136063946] [2023-10-12 17:14:18,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:18,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:18,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:18,517 INFO L85 PathProgramCache]: Analyzing trace with hash -60743370, now seen corresponding path program 2 times [2023-10-12 17:14:18,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:18,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375489933] [2023-10-12 17:14:18,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:18,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:18,536 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:18,536 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:18,536 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:18,537 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:18,537 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:18,537 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,537 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:18,537 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:18,537 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration6_Loop [2023-10-12 17:14:18,537 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:18,537 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:18,537 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:18,541 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:18,555 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:18,556 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:18,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,557 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:18,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:14:18,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:18,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:18,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-10-12 17:14:18,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,584 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:18,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:14:18,587 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:18,587 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:18,681 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:18,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:18,687 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:18,687 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:18,687 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:18,687 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:18,687 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:18,687 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,687 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:18,687 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:18,687 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration6_Loop [2023-10-12 17:14:18,687 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:18,687 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:18,688 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:18,698 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:18,714 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:18,715 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:18,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,725 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:18,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:14:18,729 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 [2023-10-12 17:14:18,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:18,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:18,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:18,752 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:18,755 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:14:18,755 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:14:18,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,756 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:18,769 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:18,769 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:18,769 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:18,769 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j1, M1) = -1*j1 + 1*M1 Supporting invariants [] [2023-10-12 17:14:18,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-10-12 17:14:18,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:18,785 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:18,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:18,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:18,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:18,811 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:18,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:18,812 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:18,812 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 540 states and 2207 transitions. cyclomatic complexity: 1809 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:18,854 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 540 states and 2207 transitions. cyclomatic complexity: 1809. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1595 states and 6686 transitions. Complement of second has 4 states. [2023-10-12 17:14:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2023-10-12 17:14:18,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:14:18,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:18,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:14:18,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:18,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:14:18,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:18,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1595 states and 6686 transitions. [2023-10-12 17:14:18,870 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 32 [2023-10-12 17:14:18,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1595 states to 1209 states and 4857 transitions. [2023-10-12 17:14:18,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2023-10-12 17:14:18,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2023-10-12 17:14:18,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1209 states and 4857 transitions. [2023-10-12 17:14:18,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:18,881 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1209 states and 4857 transitions. [2023-10-12 17:14:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states and 4857 transitions. [2023-10-12 17:14:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 662. [2023-10-12 17:14:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 662 states have (on average 4.22356495468278) internal successors, (2796), 661 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2796 transitions. [2023-10-12 17:14:18,899 INFO L241 hiAutomatonCegarLoop]: Abstraction has 662 states and 2796 transitions. [2023-10-12 17:14:18,899 INFO L430 stractBuchiCegarLoop]: Abstraction has 662 states and 2796 transitions. [2023-10-12 17:14:18,900 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:14:18,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 662 states and 2796 transitions. [2023-10-12 17:14:18,903 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 17 [2023-10-12 17:14:18,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:18,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:18,904 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:18,904 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:18,904 INFO L748 eck$LassoCheckResult]: Stem: 9753#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 9589#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 9591#[L23-1, L71-1]don't care [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 9701#[L72, L34-1, L23-1]don't care [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 10119#[L72, L34-1, L23-1]don't care [110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 10127#[L73, L46-1, L23-1, L34-1]don't care [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 9935#[L73, L46-1, L23-1, L34-1]don't care [113] L73-->L57-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 10079#[L46-1, L74, L57-1, L34-1, L23-1]don't care [2023-10-12 17:14:18,904 INFO L750 eck$LassoCheckResult]: Loop: 10079#[L46-1, L74, L57-1, L34-1, L23-1]don't care [127] L57-1-->L57-1: Formula: (and (= v_j2_12 (+ v_j2_13 1)) (< 0 v_counter_52) (< v_j2_13 v_M2_8) (= v_counter_52 (+ v_counter_51 1))) InVars {counter=v_counter_52, j2=v_j2_13, M2=v_M2_8} OutVars{counter=v_counter_51, j2=v_j2_12, M2=v_M2_8} AuxVars[] AssignedVars[counter, j2] 10079#[L46-1, L74, L57-1, L34-1, L23-1]don't care [2023-10-12 17:14:18,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash -60743376, now seen corresponding path program 1 times [2023-10-12 17:14:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:18,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991670763] [2023-10-12 17:14:18,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:18,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:18,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:18,923 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 1 times [2023-10-12 17:14:18,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:18,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615808304] [2023-10-12 17:14:18,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:18,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:18,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:18,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1883044529, now seen corresponding path program 1 times [2023-10-12 17:14:18,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:18,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005787037] [2023-10-12 17:14:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:18,969 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:18,969 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:18,969 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:18,969 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:18,969 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:18,969 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,969 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:18,969 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:18,969 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration7_Loop [2023-10-12 17:14:18,969 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:18,969 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:18,969 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:18,973 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:18,994 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:18,994 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:18,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,995 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:18,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-10-12 17:14:18,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:18,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:19,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:19,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,023 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:19,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-10-12 17:14:19,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:19,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:19,047 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:19,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:19,052 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:19,052 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:19,053 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:19,053 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:19,053 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:19,053 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,053 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:19,053 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:19,053 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration7_Loop [2023-10-12 17:14:19,053 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:19,053 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:19,053 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:19,066 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:19,087 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:19,087 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:19,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,088 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:19,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-10-12 17:14:19,091 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 [2023-10-12 17:14:19,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:19,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:19,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:19,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:19,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:19,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:19,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:19,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:19,109 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:14:19,109 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:14:19,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,111 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:19,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-10-12 17:14:19,113 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:19,113 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:19,113 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:19,113 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:14:19,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:19,118 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:19,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:19,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:19,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:19,153 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:19,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:19,153 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:19,153 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 662 states and 2796 transitions. cyclomatic complexity: 2302 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:19,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 662 states and 2796 transitions. cyclomatic complexity: 2302. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1306 states and 4992 transitions. Complement of second has 5 states. [2023-10-12 17:14:19,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2023-10-12 17:14:19,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:14:19,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:19,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:19,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:19,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:14:19,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:19,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1306 states and 4992 transitions. [2023-10-12 17:14:19,198 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 17 [2023-10-12 17:14:19,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1306 states to 1052 states and 3968 transitions. [2023-10-12 17:14:19,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2023-10-12 17:14:19,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2023-10-12 17:14:19,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1052 states and 3968 transitions. [2023-10-12 17:14:19,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:19,206 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1052 states and 3968 transitions. [2023-10-12 17:14:19,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states and 3968 transitions. [2023-10-12 17:14:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 667. [2023-10-12 17:14:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 667 states have (on average 4.217391304347826) internal successors, (2813), 666 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2813 transitions. [2023-10-12 17:14:19,222 INFO L241 hiAutomatonCegarLoop]: Abstraction has 667 states and 2813 transitions. [2023-10-12 17:14:19,222 INFO L430 stractBuchiCegarLoop]: Abstraction has 667 states and 2813 transitions. [2023-10-12 17:14:19,222 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:14:19,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 667 states and 2813 transitions. [2023-10-12 17:14:19,226 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 17 [2023-10-12 17:14:19,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:19,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:19,226 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:19,226 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:19,227 INFO L748 eck$LassoCheckResult]: Stem: 12416#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 12252#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 12254#[L23-1, L71-1]don't care [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 12356#[L72, L34-1, L23-1]don't care [110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 12852#[L73, L46-1, L23-1, L34-1]don't care [113] L73-->L57-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 12856#[L46-1, L74, L57-1, L34-1, L23-1]don't care [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 12234#[L46-1, L74, L57-1, L34-1, L23-1]don't care [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 12732#[L46-1, L74, L57-1, L34-1, L23-1]don't care [118] L46-1-->thread3EXIT: Formula: (<= v_M1_4 v_j1_10) InVars {j1=v_j1_10, M1=v_M1_4} OutVars{j1=v_j1_10, M1=v_M1_4} AuxVars[] AssignedVars[] 12470#[L57-1, L74, L23-1, L34-1, thread3EXIT]don't care [2023-10-12 17:14:19,227 INFO L750 eck$LassoCheckResult]: Loop: 12470#[L57-1, L74, L23-1, L34-1, thread3EXIT]don't care [127] L57-1-->L57-1: Formula: (and (= v_j2_12 (+ v_j2_13 1)) (< 0 v_counter_52) (< v_j2_13 v_M2_8) (= v_counter_52 (+ v_counter_51 1))) InVars {counter=v_counter_52, j2=v_j2_13, M2=v_M2_8} OutVars{counter=v_counter_51, j2=v_j2_12, M2=v_M2_8} AuxVars[] AssignedVars[counter, j2] 12470#[L57-1, L74, L23-1, L34-1, thread3EXIT]don't care [2023-10-12 17:14:19,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:19,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1895884273, now seen corresponding path program 1 times [2023-10-12 17:14:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:19,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116564142] [2023-10-12 17:14:19,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:19,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:19,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:19,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:19,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 2 times [2023-10-12 17:14:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:19,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636164734] [2023-10-12 17:14:19,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:19,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:19,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:19,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:19,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:19,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1357129808, now seen corresponding path program 1 times [2023-10-12 17:14:19,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:19,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101125029] [2023-10-12 17:14:19,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:19,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:19,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:19,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:19,259 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:19,259 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:19,259 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:19,260 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:19,260 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:19,260 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,260 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:19,260 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:19,260 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration8_Loop [2023-10-12 17:14:19,260 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:19,260 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:19,260 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:19,264 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:19,283 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:19,283 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:19,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,284 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:19,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-10-12 17:14:19,287 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:19,287 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:19,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-10-12 17:14:19,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,312 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:19,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-10-12 17:14:19,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:19,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:19,336 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:19,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:19,341 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:19,341 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:19,341 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:19,341 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:19,341 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:19,341 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,341 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:19,341 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:19,341 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration8_Loop [2023-10-12 17:14:19,341 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:19,341 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:19,342 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:19,358 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:19,378 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:19,378 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:19,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,379 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:19,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-10-12 17:14:19,382 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 [2023-10-12 17:14:19,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:19,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:19,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:19,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:19,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:19,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:19,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:19,403 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:19,407 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:14:19,407 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:14:19,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,409 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:19,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-10-12 17:14:19,410 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:19,410 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:19,410 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:19,410 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:14:19,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:19,414 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:19,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:19,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:19,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:19,458 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:19,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:19,459 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:19,459 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 667 states and 2813 transitions. cyclomatic complexity: 2312 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:19,490 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 667 states and 2813 transitions. cyclomatic complexity: 2312. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 825 states and 3215 transitions. Complement of second has 5 states. [2023-10-12 17:14:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2023-10-12 17:14:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:19,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 825 states and 3215 transitions. [2023-10-12 17:14:19,519 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 17 [2023-10-12 17:14:19,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 825 states to 744 states and 2951 transitions. [2023-10-12 17:14:19,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2023-10-12 17:14:19,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2023-10-12 17:14:19,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 744 states and 2951 transitions. [2023-10-12 17:14:19,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:19,524 INFO L219 hiAutomatonCegarLoop]: Abstraction has 744 states and 2951 transitions. [2023-10-12 17:14:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states and 2951 transitions. [2023-10-12 17:14:19,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 675. [2023-10-12 17:14:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 675 states have (on average 4.151111111111111) internal successors, (2802), 674 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 2802 transitions. [2023-10-12 17:14:19,542 INFO L241 hiAutomatonCegarLoop]: Abstraction has 675 states and 2802 transitions. [2023-10-12 17:14:19,542 INFO L430 stractBuchiCegarLoop]: Abstraction has 675 states and 2802 transitions. [2023-10-12 17:14:19,542 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:14:19,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 675 states and 2802 transitions. [2023-10-12 17:14:19,546 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 17 [2023-10-12 17:14:19,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:19,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:19,546 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:19,546 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:19,547 INFO L748 eck$LassoCheckResult]: Stem: 14623#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 14459#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 14461#[L23-1, L71-1]don't care [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 14559#[L72, L34-1, L23-1]don't care [110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 15353#[L73, L46-1, L23-1, L34-1]don't care [113] L73-->L57-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 15355#[L46-1, L74, L57-1, L34-1, L23-1]don't care [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 14439#[L46-1, L74, L57-1, L34-1, L23-1]don't care [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 15075#[L46-1, L74, L57-1, L34-1, L23-1]don't care [120] L34-1-->thread2EXIT: Formula: (<= v_N2_4 v_i2_10) InVars {i2=v_i2_10, N2=v_N2_4} OutVars{i2=v_i2_10, N2=v_N2_4} AuxVars[] AssignedVars[] 14859#[L46-1, L74, L57-1, L23-1, thread2EXIT]don't care [2023-10-12 17:14:19,547 INFO L750 eck$LassoCheckResult]: Loop: 14859#[L46-1, L74, L57-1, L23-1, thread2EXIT]don't care [127] L57-1-->L57-1: Formula: (and (= v_j2_12 (+ v_j2_13 1)) (< 0 v_counter_52) (< v_j2_13 v_M2_8) (= v_counter_52 (+ v_counter_51 1))) InVars {counter=v_counter_52, j2=v_j2_13, M2=v_M2_8} OutVars{counter=v_counter_51, j2=v_j2_12, M2=v_M2_8} AuxVars[] AssignedVars[counter, j2] 14859#[L46-1, L74, L57-1, L23-1, thread2EXIT]don't care [2023-10-12 17:14:19,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:19,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1895884271, now seen corresponding path program 1 times [2023-10-12 17:14:19,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:19,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383831995] [2023-10-12 17:14:19,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:19,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:19,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-10-12 17:14:19,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:19,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:19,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:19,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383831995] [2023-10-12 17:14:19,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383831995] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:19,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:19,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:14:19,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427947910] [2023-10-12 17:14:19,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:19,588 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:14:19,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 3 times [2023-10-12 17:14:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:19,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987001019] [2023-10-12 17:14:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:19,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:19,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:19,607 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:19,607 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:19,607 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:19,607 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:19,607 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:19,608 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,608 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:19,608 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:19,608 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration9_Loop [2023-10-12 17:14:19,608 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:19,608 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:19,608 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:19,611 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:19,630 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:19,630 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:19,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,631 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:19,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-10-12 17:14:19,635 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:19,635 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:19,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:19,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,660 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:19,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-10-12 17:14:19,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:19,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:19,765 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:19,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:19,768 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:19,768 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:19,768 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:19,768 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:19,768 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:19,768 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,769 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:19,769 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:19,769 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration9_Loop [2023-10-12 17:14:19,769 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:19,769 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:19,769 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:19,773 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:19,792 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:19,792 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:19,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,793 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:19,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-10-12 17:14:19,797 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 [2023-10-12 17:14:19,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:19,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:19,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:19,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:19,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:19,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:19,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:19,818 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:19,820 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:19,820 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:14:19,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,821 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:19,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-10-12 17:14:19,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:19,825 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:19,825 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:19,825 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j2, M2) = -1*j2 + 1*M2 Supporting invariants [] [2023-10-12 17:14:19,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-10-12 17:14:19,828 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:19,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:19,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:19,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:19,860 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:19,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:19,860 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:19,860 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 675 states and 2802 transitions. cyclomatic complexity: 2293 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:19,892 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 675 states and 2802 transitions. cyclomatic complexity: 2293. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1042 states and 3876 transitions. Complement of second has 4 states. [2023-10-12 17:14:19,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2023-10-12 17:14:19,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:19,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:19,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:19,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:19,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:19,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:19,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 3876 transitions. [2023-10-12 17:14:19,900 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2023-10-12 17:14:19,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 483 states and 1938 transitions. [2023-10-12 17:14:19,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2023-10-12 17:14:19,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2023-10-12 17:14:19,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 1938 transitions. [2023-10-12 17:14:19,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:19,904 INFO L219 hiAutomatonCegarLoop]: Abstraction has 483 states and 1938 transitions. [2023-10-12 17:14:19,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 1938 transitions. [2023-10-12 17:14:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 465. [2023-10-12 17:14:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 465 states have (on average 4.025806451612903) internal successors, (1872), 464 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1872 transitions. [2023-10-12 17:14:19,912 INFO L241 hiAutomatonCegarLoop]: Abstraction has 465 states and 1872 transitions. [2023-10-12 17:14:19,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:19,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:14:19,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:14:19,913 INFO L87 Difference]: Start difference. First operand 465 states and 1872 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:19,965 INFO L93 Difference]: Finished difference Result 1034 states and 3888 transitions. [2023-10-12 17:14:19,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1034 states and 3888 transitions. [2023-10-12 17:14:19,972 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 26 [2023-10-12 17:14:19,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1034 states to 1034 states and 3888 transitions. [2023-10-12 17:14:19,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2023-10-12 17:14:19,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2023-10-12 17:14:19,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1034 states and 3888 transitions. [2023-10-12 17:14:19,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:19,979 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1034 states and 3888 transitions. [2023-10-12 17:14:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states and 3888 transitions. [2023-10-12 17:14:19,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 465. [2023-10-12 17:14:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 465 states have (on average 4.025806451612903) internal successors, (1872), 464 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1872 transitions. [2023-10-12 17:14:19,992 INFO L241 hiAutomatonCegarLoop]: Abstraction has 465 states and 1872 transitions. [2023-10-12 17:14:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:14:19,993 INFO L430 stractBuchiCegarLoop]: Abstraction has 465 states and 1872 transitions. [2023-10-12 17:14:19,993 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:14:19,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 465 states and 1872 transitions. [2023-10-12 17:14:19,995 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2023-10-12 17:14:19,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:19,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:19,995 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:19,996 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:19,996 INFO L748 eck$LassoCheckResult]: Stem: 18899#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 18875#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 18857#[L23-1, L71-1]don't care [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 18861#[L72, L34-1, L23-1]don't care [110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 19515#[L73, L46-1, L23-1, L34-1]don't care [113] L73-->L57-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 19519#[L46-1, L74, L57-1, L34-1, L23-1]don't care [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 18831#[L46-1, L74, L57-1, L34-1, L23-1]don't care [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 19533#[L46-1, L74, L57-1, L34-1, L23-1]don't care [123] L23-1-->thread1EXIT: Formula: (<= v_N1_4 v_i1_10) InVars {i1=v_i1_10, N1=v_N1_4} OutVars{i1=v_i1_10, N1=v_N1_4} AuxVars[] AssignedVars[] 19365#[thread1EXIT, L46-1, L74, L57-1, L34-1]don't care [2023-10-12 17:14:19,996 INFO L750 eck$LassoCheckResult]: Loop: 19365#[thread1EXIT, L46-1, L74, L57-1, L34-1]don't care [127] L57-1-->L57-1: Formula: (and (= v_j2_12 (+ v_j2_13 1)) (< 0 v_counter_52) (< v_j2_13 v_M2_8) (= v_counter_52 (+ v_counter_51 1))) InVars {counter=v_counter_52, j2=v_j2_13, M2=v_M2_8} OutVars{counter=v_counter_51, j2=v_j2_12, M2=v_M2_8} AuxVars[] AssignedVars[counter, j2] 19365#[thread1EXIT, L46-1, L74, L57-1, L34-1]don't care [2023-10-12 17:14:19,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1895884268, now seen corresponding path program 1 times [2023-10-12 17:14:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:19,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565833900] [2023-10-12 17:14:19,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:20,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565833900] [2023-10-12 17:14:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565833900] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:20,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:20,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:14:20,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47718740] [2023-10-12 17:14:20,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:20,026 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:14:20,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,026 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 4 times [2023-10-12 17:14:20,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:20,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024207670] [2023-10-12 17:14:20,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:20,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:20,047 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:20,047 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:20,047 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:20,047 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:20,048 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:20,048 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,048 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:20,048 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:20,048 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration10_Loop [2023-10-12 17:14:20,048 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:20,048 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:20,048 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,052 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,073 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:20,074 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:20,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,075 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:20,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-10-12 17:14:20,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:20,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:20,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:20,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,102 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:20,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-10-12 17:14:20,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:20,106 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:20,126 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:20,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:20,141 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:20,141 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:20,141 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:20,141 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:20,141 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:20,141 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,141 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:20,141 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:20,141 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration10_Loop [2023-10-12 17:14:20,141 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:20,141 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:20,142 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,148 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,168 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:20,168 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:20,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,170 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:20,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-10-12 17:14:20,173 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 [2023-10-12 17:14:20,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:20,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:20,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:20,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:20,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:20,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:20,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:20,192 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:20,205 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:14:20,206 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:14:20,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,207 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:20,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-10-12 17:14:20,210 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:20,210 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:20,210 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:20,210 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:14:20,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-10-12 17:14:20,213 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:20,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:20,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,242 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:20,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:20,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:20,243 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:20,243 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 465 states and 1872 transitions. cyclomatic complexity: 1527 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,266 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 465 states and 1872 transitions. cyclomatic complexity: 1527. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 826 states and 2927 transitions. Complement of second has 5 states. [2023-10-12 17:14:20,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2023-10-12 17:14:20,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:20,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:20,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:20,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:20,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:20,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:20,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 2927 transitions. [2023-10-12 17:14:20,273 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2023-10-12 17:14:20,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 707 states and 2575 transitions. [2023-10-12 17:14:20,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2023-10-12 17:14:20,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2023-10-12 17:14:20,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 707 states and 2575 transitions. [2023-10-12 17:14:20,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:20,277 INFO L219 hiAutomatonCegarLoop]: Abstraction has 707 states and 2575 transitions. [2023-10-12 17:14:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states and 2575 transitions. [2023-10-12 17:14:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 469. [2023-10-12 17:14:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 469 states have (on average 3.997867803837953) internal successors, (1875), 468 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1875 transitions. [2023-10-12 17:14:20,288 INFO L241 hiAutomatonCegarLoop]: Abstraction has 469 states and 1875 transitions. [2023-10-12 17:14:20,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:20,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:14:20,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:14:20,288 INFO L87 Difference]: Start difference. First operand 469 states and 1875 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:20,339 INFO L93 Difference]: Finished difference Result 1083 states and 4047 transitions. [2023-10-12 17:14:20,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1083 states and 4047 transitions. [2023-10-12 17:14:20,346 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:14:20,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1083 states to 1083 states and 4047 transitions. [2023-10-12 17:14:20,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2023-10-12 17:14:20,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2023-10-12 17:14:20,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1083 states and 4047 transitions. [2023-10-12 17:14:20,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:20,353 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1083 states and 4047 transitions. [2023-10-12 17:14:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states and 4047 transitions. [2023-10-12 17:14:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 639. [2023-10-12 17:14:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 639 states have (on average 4.082942097026604) internal successors, (2609), 638 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 2609 transitions. [2023-10-12 17:14:20,368 INFO L241 hiAutomatonCegarLoop]: Abstraction has 639 states and 2609 transitions. [2023-10-12 17:14:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:14:20,369 INFO L430 stractBuchiCegarLoop]: Abstraction has 639 states and 2609 transitions. [2023-10-12 17:14:20,369 INFO L337 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-10-12 17:14:20,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 639 states and 2609 transitions. [2023-10-12 17:14:20,372 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2023-10-12 17:14:20,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:20,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:20,372 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2023-10-12 17:14:20,372 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:20,372 INFO L748 eck$LassoCheckResult]: Stem: 22711#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 22703#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 22685#[L23-1, L71-1]don't care [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 22689#[L72, L34-1, L23-1]don't care [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 22809#[L72, L34-1, L23-1]don't care [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 22799#[L72, L34-1, L23-1]don't care [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 22797#[L72, L34-1, L23-1]don't care [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 22781#[L72, L34-1, L23-1]don't care [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 22783#[L72, L34-1, L23-1]don't care [2023-10-12 17:14:20,372 INFO L750 eck$LassoCheckResult]: Loop: 22783#[L72, L34-1, L23-1]don't care [121] L34-1-->L34-1: Formula: (and (= v_i2_12 (+ v_i2_13 1)) (= v_counter_42 (+ v_counter_41 1)) (< v_i2_13 v_N2_6) (< 0 v_counter_42)) InVars {counter=v_counter_42, i2=v_i2_13, N2=v_N2_6} OutVars{counter=v_counter_41, i2=v_i2_12, N2=v_N2_6} AuxVars[] AssignedVars[counter, i2] 22783#[L72, L34-1, L23-1]don't care [2023-10-12 17:14:20,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1882711688, now seen corresponding path program 3 times [2023-10-12 17:14:20,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:20,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055305151] [2023-10-12 17:14:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:20,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:20,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 3 times [2023-10-12 17:14:20,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:20,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964684736] [2023-10-12 17:14:20,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:20,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:20,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1765479937, now seen corresponding path program 4 times [2023-10-12 17:14:20,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:20,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434385220] [2023-10-12 17:14:20,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:20,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:20,417 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:20,417 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:20,417 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:20,417 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:20,417 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:20,417 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,418 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:20,418 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:20,418 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration11_Loop [2023-10-12 17:14:20,418 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:20,418 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:20,418 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:20,423 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:20,442 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:20,443 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:20,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,444 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:20,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-10-12 17:14:20,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:20,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:20,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:20,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,471 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:20,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-10-12 17:14:20,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:20,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:20,565 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:20,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:20,572 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:20,572 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:20,572 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:20,572 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:20,572 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:20,572 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,572 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:20,572 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:20,572 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration11_Loop [2023-10-12 17:14:20,572 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:20,572 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:20,573 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,577 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,597 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:20,597 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:20,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,613 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:20,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-10-12 17:14:20,618 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 [2023-10-12 17:14:20,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:20,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:20,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:20,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:20,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:20,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:20,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:20,637 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:20,639 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:20,639 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:14:20,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,640 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:20,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-10-12 17:14:20,643 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:20,643 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:20,643 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:20,643 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N2) = -1*i2 + 1*N2 Supporting invariants [] [2023-10-12 17:14:20,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:20,646 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:20,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:20,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,682 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:20,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:20,683 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:20,683 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 639 states and 2609 transitions. cyclomatic complexity: 2132 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,711 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 639 states and 2609 transitions. cyclomatic complexity: 2132. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1462 states and 6026 transitions. Complement of second has 4 states. [2023-10-12 17:14:20,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2023-10-12 17:14:20,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:20,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:20,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:20,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:20,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:20,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:20,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1462 states and 6026 transitions. [2023-10-12 17:14:20,724 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2023-10-12 17:14:20,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1462 states to 991 states and 3782 transitions. [2023-10-12 17:14:20,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 165 [2023-10-12 17:14:20,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2023-10-12 17:14:20,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 991 states and 3782 transitions. [2023-10-12 17:14:20,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:20,732 INFO L219 hiAutomatonCegarLoop]: Abstraction has 991 states and 3782 transitions. [2023-10-12 17:14:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states and 3782 transitions. [2023-10-12 17:14:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 670. [2023-10-12 17:14:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 670 states have (on average 4.038805970149253) internal successors, (2706), 669 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 2706 transitions. [2023-10-12 17:14:20,747 INFO L241 hiAutomatonCegarLoop]: Abstraction has 670 states and 2706 transitions. [2023-10-12 17:14:20,747 INFO L430 stractBuchiCegarLoop]: Abstraction has 670 states and 2706 transitions. [2023-10-12 17:14:20,747 INFO L337 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-10-12 17:14:20,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 670 states and 2706 transitions. [2023-10-12 17:14:20,751 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:14:20,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:20,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:20,751 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:20,751 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:20,752 INFO L748 eck$LassoCheckResult]: Stem: 25492#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 25466#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 25468#[L23-1, L71-1]don't care [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 25470#[L72, L34-1, L23-1]don't care [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 25764#[L72, L34-1, L23-1]don't care [110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 25790#[L73, L46-1, L23-1, L34-1]don't care [113] L73-->L57-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 26462#[L46-1, L74, L57-1, L34-1, L23-1]don't care [119] L46-1-->L46-1: Formula: (and (= v_counter_37 (+ v_counter_38 1)) (< v_j1_13 v_M1_6) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_38, j1=v_j1_13, M1=v_M1_6} OutVars{counter=v_counter_37, j1=v_j1_12, M1=v_M1_6} AuxVars[] AssignedVars[counter, j1] 25442#[L46-1, L74, L57-1, L34-1, L23-1]don't care [127] L57-1-->L57-1: Formula: (and (= v_j2_12 (+ v_j2_13 1)) (< 0 v_counter_52) (< v_j2_13 v_M2_8) (= v_counter_52 (+ v_counter_51 1))) InVars {counter=v_counter_52, j2=v_j2_13, M2=v_M2_8} OutVars{counter=v_counter_51, j2=v_j2_12, M2=v_M2_8} AuxVars[] AssignedVars[counter, j2] 26734#[L46-1, L74, L57-1, L34-1, L23-1]don't care [2023-10-12 17:14:20,752 INFO L750 eck$LassoCheckResult]: Loop: 26734#[L46-1, L74, L57-1, L34-1, L23-1]don't care [127] L57-1-->L57-1: Formula: (and (= v_j2_12 (+ v_j2_13 1)) (< 0 v_counter_52) (< v_j2_13 v_M2_8) (= v_counter_52 (+ v_counter_51 1))) InVars {counter=v_counter_52, j2=v_j2_13, M2=v_M2_8} OutVars{counter=v_counter_51, j2=v_j2_12, M2=v_M2_8} AuxVars[] AssignedVars[counter, j2] 26734#[L46-1, L74, L57-1, L34-1, L23-1]don't care [2023-10-12 17:14:20,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1883050109, now seen corresponding path program 2 times [2023-10-12 17:14:20,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:20,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003298407] [2023-10-12 17:14:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:20,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:20,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 5 times [2023-10-12 17:14:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:20,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979186337] [2023-10-12 17:14:20,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:20,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1754988892, now seen corresponding path program 3 times [2023-10-12 17:14:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:20,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072996199] [2023-10-12 17:14:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:20,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:20,799 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:20,799 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:20,799 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:20,799 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:20,799 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:20,799 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,799 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:20,799 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:20,799 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration12_Loop [2023-10-12 17:14:20,799 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:20,799 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:20,800 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,803 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,822 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:20,822 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:20,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,836 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:20,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-10-12 17:14:20,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:20,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:20,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:20,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,878 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:20,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-10-12 17:14:20,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:20,880 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:20,893 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:20,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2023-10-12 17:14:20,897 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:20,897 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:20,897 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:20,897 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:20,897 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:20,897 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,897 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:20,897 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:20,897 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration12_Loop [2023-10-12 17:14:20,897 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:20,897 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:20,898 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,903 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,927 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:20,927 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:20,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,929 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:20,937 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 [2023-10-12 17:14:20,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:20,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:20,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:20,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:20,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:20,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:20,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:20,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-10-12 17:14:20,953 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:20,954 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:14:20,954 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:14:20,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,955 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:20,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-10-12 17:14:20,958 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:20,958 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:20,958 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:20,958 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:14:20,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-10-12 17:14:20,961 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:20,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:20,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,990 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:20,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:20,990 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:20,990 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 670 states and 2706 transitions. cyclomatic complexity: 2203 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 670 states and 2706 transitions. cyclomatic complexity: 2203. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1167 states and 4480 transitions. Complement of second has 5 states. [2023-10-12 17:14:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2023-10-12 17:14:21,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:21,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:21,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:21,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1167 states and 4480 transitions. [2023-10-12 17:14:21,025 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:14:21,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1167 states to 1074 states and 4202 transitions. [2023-10-12 17:14:21,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2023-10-12 17:14:21,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2023-10-12 17:14:21,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1074 states and 4202 transitions. [2023-10-12 17:14:21,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:21,032 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1074 states and 4202 transitions. [2023-10-12 17:14:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states and 4202 transitions. [2023-10-12 17:14:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 871. [2023-10-12 17:14:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 871 states have (on average 4.053960964408725) internal successors, (3531), 870 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 3531 transitions. [2023-10-12 17:14:21,050 INFO L241 hiAutomatonCegarLoop]: Abstraction has 871 states and 3531 transitions. [2023-10-12 17:14:21,050 INFO L430 stractBuchiCegarLoop]: Abstraction has 871 states and 3531 transitions. [2023-10-12 17:14:21,050 INFO L337 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-10-12 17:14:21,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 871 states and 3531 transitions. [2023-10-12 17:14:21,054 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:14:21,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:21,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:21,055 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2023-10-12 17:14:21,055 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:21,055 INFO L748 eck$LassoCheckResult]: Stem: 28047#[$Ultimate##0]don't care [130] $Ultimate##0-->L71: Formula: (and (= v_M1_10 v_N1_10) (= v_counter_59 0) (= v_i1_16 v_j2_16) (= v_i1_16 v_j1_16) (= v_M2_10 v_N1_10) (= v_i1_16 v_i2_16) (= v_N2_10 v_N1_10) (= v_i1_16 0)) InVars {counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} OutVars{counter=v_counter_59, i1=v_i1_16, j2=v_j2_16, i2=v_i2_16, j1=v_j1_16, N2=v_N2_10, M1=v_M1_10, M2=v_M2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 28037#[L71]don't care [104] L71-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 28019#[L23-1, L71-1]don't care [107] L71-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 28021#[L72, L34-1, L23-1]don't care [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 28259#[L72, L34-1, L23-1]don't care [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 28241#[L72, L34-1, L23-1]don't care [110] L72-->L46-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 28401#[L73, L46-1, L23-1, L34-1]don't care [113] L73-->L57-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 28659#[L46-1, L74, L57-1, L34-1, L23-1]don't care [127] L57-1-->L57-1: Formula: (and (= v_j2_12 (+ v_j2_13 1)) (< 0 v_counter_52) (< v_j2_13 v_M2_8) (= v_counter_52 (+ v_counter_51 1))) InVars {counter=v_counter_52, j2=v_j2_13, M2=v_M2_8} OutVars{counter=v_counter_51, j2=v_j2_12, M2=v_M2_8} AuxVars[] AssignedVars[counter, j2] 28615#[L46-1, L74, L57-1, L34-1, L23-1]don't care [124] L23-1-->L23-1: Formula: (and (< v_i1_13 v_N1_6) (= v_i1_12 (+ v_i1_13 1)) (= v_counter_45 (+ v_counter_46 1))) InVars {counter=v_counter_46, i1=v_i1_13, N1=v_N1_6} OutVars{counter=v_counter_45, i1=v_i1_12, N1=v_N1_6} AuxVars[] AssignedVars[counter, i1] 28617#[L46-1, L74, L57-1, L34-1, L23-1]don't care [127] L57-1-->L57-1: Formula: (and (= v_j2_12 (+ v_j2_13 1)) (< 0 v_counter_52) (< v_j2_13 v_M2_8) (= v_counter_52 (+ v_counter_51 1))) InVars {counter=v_counter_52, j2=v_j2_13, M2=v_M2_8} OutVars{counter=v_counter_51, j2=v_j2_12, M2=v_M2_8} AuxVars[] AssignedVars[counter, j2] 29675#[L46-1, L74, L57-1, L34-1, L23-1]don't care [2023-10-12 17:14:21,055 INFO L750 eck$LassoCheckResult]: Loop: 29675#[L46-1, L74, L57-1, L34-1, L23-1]don't care [127] L57-1-->L57-1: Formula: (and (= v_j2_12 (+ v_j2_13 1)) (< 0 v_counter_52) (< v_j2_13 v_M2_8) (= v_counter_52 (+ v_counter_51 1))) InVars {counter=v_counter_52, j2=v_j2_13, M2=v_M2_8} OutVars{counter=v_counter_51, j2=v_j2_12, M2=v_M2_8} AuxVars[] AssignedVars[counter, j2] 29675#[L46-1, L74, L57-1, L34-1, L23-1]don't care [2023-10-12 17:14:21,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1032060357, now seen corresponding path program 1 times [2023-10-12 17:14:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:21,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000967922] [2023-10-12 17:14:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:21,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:21,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:21,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:21,062 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 6 times [2023-10-12 17:14:21,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:21,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39232545] [2023-10-12 17:14:21,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:21,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:21,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:21,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:21,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1929099868, now seen corresponding path program 2 times [2023-10-12 17:14:21,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:21,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487132035] [2023-10-12 17:14:21,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:21,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:21,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:21,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:21,084 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:21,084 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:21,084 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:21,084 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:21,084 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:14:21,084 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,084 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:21,085 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:21,085 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration13_Loop [2023-10-12 17:14:21,085 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:21,085 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:21,085 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:21,088 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:21,107 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:21,107 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:14:21,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,108 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:21,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-10-12 17:14:21,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:14:21,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:21,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:21,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,146 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:21,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-10-12 17:14:21,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:14:21,149 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:14:21,193 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:14:21,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:21,197 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:21,197 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:21,197 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:21,197 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:21,197 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:21,197 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,197 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:21,197 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:21,197 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-add-4-semi-Q67.wvr.bpl_BEv2_Iteration13_Loop [2023-10-12 17:14:21,197 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:21,197 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:21,198 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:21,201 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:21,221 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:21,221 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:21,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,222 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:21,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-10-12 17:14:21,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:21,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:21,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:21,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:21,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:21,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:21,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:21,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:21,247 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:21,249 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:14:21,249 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:14:21,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,250 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:21,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-10-12 17:14:21,253 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:21,253 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:14:21,254 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:21,254 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:14:21,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:21,257 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:21,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:21,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:21,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:21,293 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:21,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:21,294 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:21,294 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 871 states and 3531 transitions. cyclomatic complexity: 2873 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,319 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 871 states and 3531 transitions. cyclomatic complexity: 2873. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1080 states and 4170 transitions. Complement of second has 5 states. [2023-10-12 17:14:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2023-10-12 17:14:21,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:21,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,320 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:21,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:21,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:21,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:21,351 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:21,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:21,352 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:21,352 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 871 states and 3531 transitions. cyclomatic complexity: 2873 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,374 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 871 states and 3531 transitions. cyclomatic complexity: 2873. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1102 states and 4252 transitions. Complement of second has 5 states. [2023-10-12 17:14:21,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2023-10-12 17:14:21,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:21,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,375 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:21,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:21,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:21,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:21,403 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:21,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:21,403 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:21,403 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 871 states and 3531 transitions. cyclomatic complexity: 2873 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,424 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 871 states and 3531 transitions. cyclomatic complexity: 2873. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1091 states and 4266 transitions. Complement of second has 4 states. [2023-10-12 17:14:21,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2023-10-12 17:14:21,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:21,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:21,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:21,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1091 states and 4266 transitions. [2023-10-12 17:14:21,432 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:21,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1091 states to 0 states and 0 transitions. [2023-10-12 17:14:21,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:14:21,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:14:21,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:14:21,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:14:21,432 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:21,432 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:21,432 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:21,432 INFO L337 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-10-12 17:14:21,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:14:21,432 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:21,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:14:21,436 INFO L201 PluginConnector]: Adding new model counter-add-4-semi-Q67.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:21 BoogieIcfgContainer [2023-10-12 17:14:21,436 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:21,437 INFO L158 Benchmark]: Toolchain (without parser) took 7041.30ms. Allocated memory was 224.4MB in the beginning and 359.7MB in the end (delta: 135.3MB). Free memory was 176.2MB in the beginning and 167.5MB in the end (delta: 8.7MB). Peak memory consumption was 145.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:21,437 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 224.4MB. Free memory is still 177.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:21,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.64ms. Allocated memory is still 224.4MB. Free memory was 176.2MB in the beginning and 174.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:21,437 INFO L158 Benchmark]: Boogie Preprocessor took 11.37ms. Allocated memory is still 224.4MB. Free memory was 174.7MB in the beginning and 173.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:21,437 INFO L158 Benchmark]: RCFGBuilder took 209.72ms. Allocated memory is still 224.4MB. Free memory was 173.5MB in the beginning and 193.8MB in the end (delta: -20.3MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2023-10-12 17:14:21,438 INFO L158 Benchmark]: BuchiAutomizer took 6800.77ms. Allocated memory was 224.4MB in the beginning and 359.7MB in the end (delta: 135.3MB). Free memory was 193.7MB in the beginning and 167.5MB in the end (delta: 26.2MB). Peak memory consumption was 162.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:21,438 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.27ms. Allocated memory is still 224.4MB. Free memory is still 177.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.64ms. Allocated memory is still 224.4MB. Free memory was 176.2MB in the beginning and 174.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.37ms. Allocated memory is still 224.4MB. Free memory was 174.7MB in the beginning and 173.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 209.72ms. Allocated memory is still 224.4MB. Free memory was 173.5MB in the beginning and 193.8MB in the end (delta: -20.3MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 6800.77ms. Allocated memory was 224.4MB in the beginning and 359.7MB in the end (delta: 135.3MB). Free memory was 193.7MB in the beginning and 167.5MB in the end (delta: 26.2MB). Peak memory consumption was 162.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (4 trivial, 12 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One deterministic module has affine ranking function -1 * j1 + M1 and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 3 locations. One deterministic module has affine ranking function -1 * j1 + M1 and consists of 3 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One deterministic module has affine ranking function -1 * j2 + M2 and consists of 3 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 3 locations. One deterministic module has affine ranking function counter and consists of 3 locations. One nondeterministic module has affine ranking function counter and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 14 iterations. TraceHistogramMax:3. Analysis of lassos took 4.5s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 16. Automata minimization 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 3508 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [12, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 660 IncrementalHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 0 mSDtfsCounter, 660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT9 conc0 concLT2 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp54 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq159 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 89ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 40 PlacesBefore, 28 PlacesAfterwards, 31 TransitionsBefore, 19 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 2 FixpointIterations, 5 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 192 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 192, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 156, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 156, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 192, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 156, unknown conditional: 0, unknown unconditional: 156] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:14:21,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:21,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:21,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:22,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...