/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_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-2-nl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:30:05,963 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:30:06,027 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:30:06,050 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:30:06,051 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:30:06,051 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:30:06,052 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:30:06,052 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:30:06,053 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:30:06,056 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:30:06,056 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:30:06,056 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:30:06,056 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:30:06,057 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:30:06,057 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:30:06,058 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:30:06,058 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:30:06,058 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:30:06,058 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:30:06,058 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:30:06,058 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:30:06,059 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:30:06,060 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:30:06,060 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:30:06,060 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:30:06,060 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:30:06,060 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:30:06,060 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:30:06,060 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:30:06,061 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:30:06,061 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:30:06,062 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:30:06,062 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:30:06,063 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:30:06,063 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_PETRI_NET [2023-10-12 17:30:06,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:30:06,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:30:06,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:30:06,270 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:30:06,271 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:30:06,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-2-nl.wvr.bpl [2023-10-12 17:30:06,272 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-2-nl.wvr.bpl' [2023-10-12 17:30:06,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:30:06,289 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:30:06,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:30:06,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:30:06,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:30:06,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:06" (1/1) ... [2023-10-12 17:30:06,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:06" (1/1) ... [2023-10-12 17:30:06,307 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:30:06,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:30:06,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:30:06,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:30:06,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:30:06,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:06" (1/1) ... [2023-10-12 17:30:06,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:06" (1/1) ... [2023-10-12 17:30:06,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:06" (1/1) ... [2023-10-12 17:30:06,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:06" (1/1) ... [2023-10-12 17:30:06,319 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:06" (1/1) ... [2023-10-12 17:30:06,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:06" (1/1) ... [2023-10-12 17:30:06,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:06" (1/1) ... [2023-10-12 17:30:06,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:06" (1/1) ... [2023-10-12 17:30:06,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:30:06,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:30:06,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:30:06,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:30:06,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:06" (1/1) ... [2023-10-12 17:30:06,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:06,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:06,346 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:30:06,363 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:30:06,386 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:30:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:30:06,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:30:06,387 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:30:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:30:06,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:30:06,387 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:30:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:30:06,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:30:06,388 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:30:06,432 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:30:06,434 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:30:06,597 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:30:06,615 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:30:06,615 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:30:06,616 INFO L201 PluginConnector]: Adding new model queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:30:06 BoogieIcfgContainer [2023-10-12 17:30:06,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:30:06,617 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:30:06,617 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:30:06,624 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:30:06,624 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:30:06,625 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:06" (1/2) ... [2023-10-12 17:30:06,626 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5974ace4 and model type queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:30:06, skipping insertion in model container [2023-10-12 17:30:06,626 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:30:06,626 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:30:06" (2/2) ... [2023-10-12 17:30:06,627 INFO L332 chiAutomizerObserver]: Analyzing ICFG queue-add-2-nl.wvr.bpl [2023-10-12 17:30:06,665 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:30:06,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 31 transitions, 78 flow [2023-10-12 17:30:06,713 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-10-12 17:30:06,714 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:30:06,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 2/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:30:06,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 31 transitions, 78 flow [2023-10-12 17:30:06,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 27 transitions, 66 flow [2023-10-12 17:30:06,728 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:30:06,751 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 27 transitions, 66 flow [2023-10-12 17:30:06,753 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 66 flow [2023-10-12 17:30:06,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 66 flow [2023-10-12 17:30:06,766 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-10-12 17:30:06,766 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:30:06,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 2/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:30:06,768 INFO L119 LiptonReduction]: Number of co-enabled transitions 198 [2023-10-12 17:30:07,259 INFO L134 LiptonReduction]: Checked pairs total: 172 [2023-10-12 17:30:07,259 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:30:07,269 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:30:07,269 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:30:07,269 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:30:07,269 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:30:07,269 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:30:07,269 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:30:07,269 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:30:07,269 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:30:07,270 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:30:07,273 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:07,273 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:30:07,273 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:30:07,273 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:07,275 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:30:07,275 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:30:07,276 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:07,277 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:30:07,277 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:30:07,277 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:07,280 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 44#[L61-1, L25-1]true [2023-10-12 17:30:07,280 INFO L750 eck$LassoCheckResult]: Loop: 44#[L61-1, L25-1]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 44#[L61-1, L25-1]true [2023-10-12 17:30:07,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash 98092, now seen corresponding path program 1 times [2023-10-12 17:30:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754212219] [2023-10-12 17:30:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:07,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:07,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:07,397 INFO L85 PathProgramCache]: Analyzing trace with hash 140, now seen corresponding path program 1 times [2023-10-12 17:30:07,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:07,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216221350] [2023-10-12 17:30:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:07,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:07,410 INFO L85 PathProgramCache]: Analyzing trace with hash 3040961, now seen corresponding path program 1 times [2023-10-12 17:30:07,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:07,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304604630] [2023-10-12 17:30:07,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:07,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:07,499 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:07,500 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:07,500 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:07,500 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:07,500 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:07,500 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:07,500 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:07,500 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:07,500 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:30:07,501 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:07,501 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:07,511 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:30:07,533 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:30:07,535 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:30:07,542 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:30:07,554 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:30:07,623 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:07,626 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:07,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:07,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:07,629 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:30:07,630 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:30:07,632 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:30:07,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:07,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:07,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:07,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:07,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:07,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:07,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:07,664 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:30:07,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:07,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:07,666 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:30:07,668 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:30:07,669 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:30:07,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:07,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:07,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:07,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:07,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:07,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:07,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:07,706 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:30:07,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:07,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:07,708 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:30:07,708 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:30:07,711 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:30:07,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:07,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:07,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:07,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:07,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:07,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:07,732 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:07,740 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:30:07,740 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:30:07,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:07,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:07,767 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:30:07,768 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:30:07,811 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:07,830 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:07,831 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:07,831 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:30:07,835 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:30:07,837 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:30:07,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:07,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:07,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:07,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:30:07,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:07,874 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:30:07,894 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:30:07,895 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:30:07,980 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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 6 states and 312 transitions. [2023-10-12 17:30:07,981 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:07,983 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:07,985 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:30:07,988 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:30:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2023-10-12 17:30:07,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:30:07,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:07,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:30:07,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:07,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:30:07,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:07,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 170 transitions, 848 flow [2023-10-12 17:30:08,004 INFO L124 PetriNetUnfolderBase]: 55/104 cut-off events. [2023-10-12 17:30:08,004 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-10-12 17:30:08,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 104 events. 55/104 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 298 event pairs, 2 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 164. Up to 32 conditions per place. [2023-10-12 17:30:08,005 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 30 places, 170 transitions, 848 flow [2023-10-12 17:30:08,007 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 30 places, 170 transitions, 848 flow [2023-10-12 17:30:08,007 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 170 transitions, 848 flow [2023-10-12 17:30:08,008 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:30:08,008 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 places, 170 transitions, 848 flow [2023-10-12 17:30:08,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:08,013 INFO L124 PetriNetUnfolderBase]: 22/41 cut-off events. [2023-10-12 17:30:08,013 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:30:08,013 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:08,013 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 95#[L62, $Ultimate##0, $Ultimate##0]true [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 97#[L45-1, L62, $Ultimate##0]true [2023-10-12 17:30:08,014 INFO L750 eck$LassoCheckResult]: Loop: 97#[L45-1, L62, $Ultimate##0]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 97#[L45-1, L62, $Ultimate##0]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 97#[L45-1, L62, $Ultimate##0]true [2023-10-12 17:30:08,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:08,014 INFO L85 PathProgramCache]: Analyzing trace with hash 3041574, now seen corresponding path program 1 times [2023-10-12 17:30:08,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:08,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012448467] [2023-10-12 17:30:08,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:08,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:08,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:08,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:08,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash 4481, now seen corresponding path program 1 times [2023-10-12 17:30:08,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:08,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2624983] [2023-10-12 17:30:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:08,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:08,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:08,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:08,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:08,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1372011162, now seen corresponding path program 1 times [2023-10-12 17:30:08,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:08,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968498112] [2023-10-12 17:30:08,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:08,074 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:30:08,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968498112] [2023-10-12 17:30:08,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968498112] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:30:08,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:30:08,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:30:08,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567975505] [2023-10-12 17:30:08,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:30:08,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:08,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:30:08,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:30:08,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 170 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 2.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:30:08,227 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:08,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:08,258 INFO L124 PetriNetUnfolderBase]: 62/117 cut-off events. [2023-10-12 17:30:08,258 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-10-12 17:30:08,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 117 events. 62/117 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 339 event pairs, 1 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 287. Up to 98 conditions per place. [2023-10-12 17:30:08,260 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 45 selfloop transitions, 8 changer transitions 10/63 dead transitions. [2023-10-12 17:30:08,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 63 transitions, 420 flow [2023-10-12 17:30:08,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 63 transitions, 420 flow [2023-10-12 17:30:08,269 INFO L124 PetriNetUnfolderBase]: 62/117 cut-off events. [2023-10-12 17:30:08,269 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-10-12 17:30:08,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 117 events. 62/117 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 339 event pairs, 1 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 287. Up to 98 conditions per place. [2023-10-12 17:30:08,270 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 26 places, 63 transitions, 420 flow [2023-10-12 17:30:08,270 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 26 places, 63 transitions, 420 flow [2023-10-12 17:30:08,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:30:08,271 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 63 transitions, 420 flow [2023-10-12 17:30:08,271 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:30:08,272 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 places, 63 transitions, 420 flow [2023-10-12 17:30:08,277 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:08,277 INFO L124 PetriNetUnfolderBase]: 42/74 cut-off events. [2023-10-12 17:30:08,277 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:30:08,278 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:08,278 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 44#[L61-1, L25-1]true [90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 114#[L62, L25-1, $Ultimate##0]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 114#[L62, L25-1, $Ultimate##0]true [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 117#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 117#[L45-1, L62, L25-1]true [2023-10-12 17:30:08,278 INFO L750 eck$LassoCheckResult]: Loop: 117#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 117#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 117#[L45-1, L62, L25-1]true [2023-10-12 17:30:08,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:08,279 INFO L85 PathProgramCache]: Analyzing trace with hash 398497927, now seen corresponding path program 1 times [2023-10-12 17:30:08,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:08,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758971816] [2023-10-12 17:30:08,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:08,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:08,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:08,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:08,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash 4481, now seen corresponding path program 2 times [2023-10-12 17:30:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911989728] [2023-10-12 17:30:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:08,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:08,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:08,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash 704422023, now seen corresponding path program 2 times [2023-10-12 17:30:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857174271] [2023-10-12 17:30:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:08,391 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:30:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:08,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:08,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857174271] [2023-10-12 17:30:08,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857174271] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:30:08,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:30:08,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-10-12 17:30:08,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739844623] [2023-10-12 17:30:08,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:30:08,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:08,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:30:08,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:30:08,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 63 transitions, 420 flow. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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:30:08,518 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:08,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:08,564 INFO L124 PetriNetUnfolderBase]: 103/220 cut-off events. [2023-10-12 17:30:08,564 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-10-12 17:30:08,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 220 events. 103/220 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 917 event pairs, 2 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 642. Up to 201 conditions per place. [2023-10-12 17:30:08,566 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 71 selfloop transitions, 21 changer transitions 22/114 dead transitions. [2023-10-12 17:30:08,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 114 transitions, 1002 flow [2023-10-12 17:30:08,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 114 transitions, 1002 flow [2023-10-12 17:30:08,581 INFO L124 PetriNetUnfolderBase]: 103/220 cut-off events. [2023-10-12 17:30:08,581 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-10-12 17:30:08,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 220 events. 103/220 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 916 event pairs, 2 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 642. Up to 201 conditions per place. [2023-10-12 17:30:08,582 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 29 places, 114 transitions, 1002 flow [2023-10-12 17:30:08,584 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 29 places, 114 transitions, 1002 flow [2023-10-12 17:30:08,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:30:08,585 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 114 transitions, 1002 flow [2023-10-12 17:30:08,585 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:30:08,585 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 29 places, 114 transitions, 1002 flow [2023-10-12 17:30:08,595 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:08,595 INFO L124 PetriNetUnfolderBase]: 66/128 cut-off events. [2023-10-12 17:30:08,595 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-10-12 17:30:08,595 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:08,596 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 44#[L61-1, L25-1]true [90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 114#[L62, L25-1, $Ultimate##0]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 114#[L62, L25-1, $Ultimate##0]true [108] L25-1-->thread1EXIT: Formula: (and (= v_x_23 (+ v_C_12 v_x_24)) (= (select v_q_30 v_q_back_52) 0) (= v_q_back_51 (+ v_q_back_52 1)) (<= v_N_15 v_i_12)) InVars {q=v_q_30, q_back=v_q_back_52, N=v_N_15, i=v_i_12, x=v_x_24, C=v_C_12} OutVars{q=v_q_30, q_back=v_q_back_51, N=v_N_15, i=v_i_12, x=v_x_23, C=v_C_12} AuxVars[] AssignedVars[q_back, x] 139#[L62, thread1EXIT, $Ultimate##0]true [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 141#[L45-1, L62, thread1EXIT]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 141#[L45-1, L62, thread1EXIT]true [2023-10-12 17:30:08,596 INFO L750 eck$LassoCheckResult]: Loop: 141#[L45-1, L62, thread1EXIT]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 141#[L45-1, L62, thread1EXIT]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 141#[L45-1, L62, thread1EXIT]true [2023-10-12 17:30:08,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash -531460523, now seen corresponding path program 1 times [2023-10-12 17:30:08,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:08,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881533547] [2023-10-12 17:30:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:08,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:08,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:08,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:08,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash 4481, now seen corresponding path program 3 times [2023-10-12 17:30:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:08,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217982164] [2023-10-12 17:30:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:08,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:08,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:08,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:08,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash 367549141, now seen corresponding path program 2 times [2023-10-12 17:30:08,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:08,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463278939] [2023-10-12 17:30:08,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:08,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463278939] [2023-10-12 17:30:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463278939] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:30:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811064888] [2023-10-12 17:30:08,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:30:08,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:30:08,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:08,685 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:30:08,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-10-12 17:30:08,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:30:08,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:30:08,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:30:08,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:08,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:30:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:08,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811064888] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:30:08,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:30:08,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-10-12 17:30:08,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062111564] [2023-10-12 17:30:08,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:30:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:08,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-10-12 17:30:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-10-12 17:30:08,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 114 transitions, 1002 flow. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:30:08,885 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:08,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:08,951 INFO L124 PetriNetUnfolderBase]: 166/371 cut-off events. [2023-10-12 17:30:08,951 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-10-12 17:30:08,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1957 conditions, 371 events. 166/371 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1842 event pairs, 3 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 1275. Up to 352 conditions per place. [2023-10-12 17:30:08,954 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 107 selfloop transitions, 44 changer transitions 40/191 dead transitions. [2023-10-12 17:30:08,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 191 transitions, 2066 flow [2023-10-12 17:30:08,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 191 transitions, 2066 flow [2023-10-12 17:30:08,981 INFO L124 PetriNetUnfolderBase]: 166/371 cut-off events. [2023-10-12 17:30:08,981 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-10-12 17:30:08,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1957 conditions, 371 events. 166/371 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1848 event pairs, 3 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 1275. Up to 352 conditions per place. [2023-10-12 17:30:08,982 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 33 places, 191 transitions, 2066 flow [2023-10-12 17:30:08,984 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 33 places, 191 transitions, 2066 flow [2023-10-12 17:30:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:30:08,985 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 191 transitions, 2066 flow [2023-10-12 17:30:08,985 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:30:08,986 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 places, 191 transitions, 2066 flow [2023-10-12 17:30:08,999 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:08,999 INFO L124 PetriNetUnfolderBase]: 107/215 cut-off events. [2023-10-12 17:30:08,999 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-10-12 17:30:09,000 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:09,000 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 44#[L61-1, L25-1]true [90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 114#[L62, L25-1, $Ultimate##0]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 114#[L62, L25-1, $Ultimate##0]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 114#[L62, L25-1, $Ultimate##0]true [108] L25-1-->thread1EXIT: Formula: (and (= v_x_23 (+ v_C_12 v_x_24)) (= (select v_q_30 v_q_back_52) 0) (= v_q_back_51 (+ v_q_back_52 1)) (<= v_N_15 v_i_12)) InVars {q=v_q_30, q_back=v_q_back_52, N=v_N_15, i=v_i_12, x=v_x_24, C=v_C_12} OutVars{q=v_q_30, q_back=v_q_back_51, N=v_N_15, i=v_i_12, x=v_x_23, C=v_C_12} AuxVars[] AssignedVars[q_back, x] 139#[L62, thread1EXIT, $Ultimate##0]true [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 141#[L45-1, L62, thread1EXIT]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 141#[L45-1, L62, thread1EXIT]true [2023-10-12 17:30:09,000 INFO L750 eck$LassoCheckResult]: Loop: 141#[L45-1, L62, thread1EXIT]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 141#[L45-1, L62, thread1EXIT]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 141#[L45-1, L62, thread1EXIT]true [2023-10-12 17:30:09,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash 704628390, now seen corresponding path program 3 times [2023-10-12 17:30:09,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:09,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160219878] [2023-10-12 17:30:09,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:09,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:09,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:09,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:09,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:09,013 INFO L85 PathProgramCache]: Analyzing trace with hash 4481, now seen corresponding path program 4 times [2023-10-12 17:30:09,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:09,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452927168] [2023-10-12 17:30:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:09,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:09,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:09,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:09,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:09,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1456946458, now seen corresponding path program 4 times [2023-10-12 17:30:09,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:09,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156718788] [2023-10-12 17:30:09,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:09,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:09,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:09,342 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:09,342 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:09,342 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:09,342 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:09,342 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:09,342 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:09,342 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:09,342 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:09,342 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:30:09,342 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:09,342 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:09,344 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:30:09,346 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:30:09,349 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:30:09,352 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:30:09,354 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:30:09,356 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:30:09,363 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:30:09,767 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:09,767 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:09,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:09,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:09,781 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:30:09,802 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:30:09,803 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:30:09,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:09,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:09,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:09,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:09,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:09,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:09,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:09,849 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:30:09,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:09,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:09,861 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:30:09,892 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:30:09,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:09,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:09,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:09,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:09,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:09,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:09,903 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:30:09,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:09,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:09,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:09,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:09,932 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:30:09,949 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:30:09,950 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:30:09,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:09,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:09,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:09,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:09,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:09,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:09,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:09,979 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:30:09,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:09,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:09,990 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:30:09,992 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:30:09,993 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:30:10,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:10,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:10,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:10,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:10,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:10,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:10,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:10,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:10,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:10,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:10,049 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:30:10,059 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:30:10,059 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:30:10,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:10,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:10,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:10,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:10,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:10,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:10,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:10,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-10-12 17:30:10,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:10,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:10,089 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:30:10,092 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:30:10,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:30:10,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:10,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:10,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:10,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:10,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:10,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:10,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:10,122 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:30:10,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:10,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:10,123 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:30:10,125 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:30:10,127 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:30:10,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:10,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:10,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:10,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:10,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:10,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:10,141 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:10,149 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:30:10,150 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:30:10,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:10,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:10,169 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:30:10,192 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:10,192 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:30:10,201 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:10,201 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:10,201 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2023-10-12 17:30:10,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:10,210 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:30:10,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:10,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:10,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:10,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:30:10,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:10,251 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:30:10,252 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:30:10,252 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:30:10,307 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 6 states and 294 transitions. [2023-10-12 17:30:10,307 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:10,319 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:10,319 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:30:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:30:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2023-10-12 17:30:10,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:30:10,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:10,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:30:10,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:10,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 9 letters. Loop has 4 letters. [2023-10-12 17:30:10,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:10,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 2410 transitions, 31104 flow [2023-10-12 17:30:10,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:10,629 INFO L124 PetriNetUnfolderBase]: 310/793 cut-off events. [2023-10-12 17:30:10,629 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2023-10-12 17:30:10,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4982 conditions, 793 events. 310/793 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5427 event pairs, 4 based on Foata normal form. 0/540 useless extension candidates. Maximal degree in co-relation 2884. Up to 774 conditions per place. [2023-10-12 17:30:10,630 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 45 places, 2410 transitions, 31104 flow [2023-10-12 17:30:10,659 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 45 places, 2410 transitions, 31104 flow [2023-10-12 17:30:10,659 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 2410 transitions, 31104 flow [2023-10-12 17:30:10,660 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:30:10,660 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 2410 transitions, 31104 flow [2023-10-12 17:30:10,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:10,811 INFO L124 PetriNetUnfolderBase]: 245/586 cut-off events. [2023-10-12 17:30:10,811 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2023-10-12 17:30:10,812 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:10,812 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 95#[L62, $Ultimate##0, $Ultimate##0]true [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 97#[L45-1, L62, $Ultimate##0]true [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 117#[L45-1, L62, L25-1]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 117#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 117#[L45-1, L62, L25-1]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 117#[L45-1, L62, L25-1]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 117#[L45-1, L62, L25-1]true [108] L25-1-->thread1EXIT: Formula: (and (= v_x_23 (+ v_C_12 v_x_24)) (= (select v_q_30 v_q_back_52) 0) (= v_q_back_51 (+ v_q_back_52 1)) (<= v_N_15 v_i_12)) InVars {q=v_q_30, q_back=v_q_back_52, N=v_N_15, i=v_i_12, x=v_x_24, C=v_C_12} OutVars{q=v_q_30, q_back=v_q_back_51, N=v_N_15, i=v_i_12, x=v_x_23, C=v_C_12} AuxVars[] AssignedVars[q_back, x] 141#[L45-1, L62, thread1EXIT]true [2023-10-12 17:30:10,812 INFO L750 eck$LassoCheckResult]: Loop: 141#[L45-1, L62, thread1EXIT]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 141#[L45-1, L62, thread1EXIT]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 141#[L45-1, L62, thread1EXIT]true [2023-10-12 17:30:10,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1808751019, now seen corresponding path program 5 times [2023-10-12 17:30:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:10,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990877721] [2023-10-12 17:30:10,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:10,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:10,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:10,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:10,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash 4481, now seen corresponding path program 5 times [2023-10-12 17:30:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549923583] [2023-10-12 17:30:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:10,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:10,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:10,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:10,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1252022101, now seen corresponding path program 6 times [2023-10-12 17:30:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:10,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184773160] [2023-10-12 17:30:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:10,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:10,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:10,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:11,189 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:11,190 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:11,190 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:11,190 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:11,190 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:11,190 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,190 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:11,190 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:11,190 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:30:11,190 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:11,190 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:11,194 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:30:11,200 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:30:11,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:30:11,203 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:30:11,205 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:30:11,207 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:30:11,209 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:30:11,604 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:11,604 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:11,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:11,606 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:30:11,607 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:30:11,613 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:30:11,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:11,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:11,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:11,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:11,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:11,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:11,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:11,629 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:30:11,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:11,630 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:30:11,632 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:30:11,635 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:30:11,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:11,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:11,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:11,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:11,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:11,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:11,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:11,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-10-12 17:30:11,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:11,662 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:30:11,665 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:30:11,667 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:30:11,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:11,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:11,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:11,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:11,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:11,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:11,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:11,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-10-12 17:30:11,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:11,682 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:30:11,684 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:30:11,686 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:30:11,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:11,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:11,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:11,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:11,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:11,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:11,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:11,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-10-12 17:30:11,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:11,700 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:30:11,701 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:30:11,703 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:30:11,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:11,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:11,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:11,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:11,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:11,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:11,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:11,717 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:30:11,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:11,718 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:30:11,721 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:30:11,721 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:30:11,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:11,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:11,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:11,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:11,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:11,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:11,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:11,741 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:30:11,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:11,743 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:30:11,744 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:30:11,746 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:30:11,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:11,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:11,753 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2023-10-12 17:30:11,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:11,872 INFO L401 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2023-10-12 17:30:11,872 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2023-10-12 17:30:12,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:12,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-10-12 17:30:12,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:12,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:12,076 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:30:12,079 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:30:12,081 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:30:12,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:12,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:12,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:12,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:12,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:12,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:12,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:12,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-10-12 17:30:12,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:12,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:12,096 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:30:12,097 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:30:12,099 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:30:12,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:12,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:12,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:12,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:12,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:12,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:12,122 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:12,132 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:30:12,132 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:30:12,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:12,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:12,133 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:30:12,137 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:30:12,138 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:12,159 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:12,159 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:12,159 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2023-10-12 17:30:12,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-10-12 17:30:12,166 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:30:12,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:12,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:12,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:12,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:30:12,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:12,241 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:30:12,248 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:30:12,249 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:30:12,250 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:30:12,308 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 6 states and 294 transitions. [2023-10-12 17:30:12,308 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:12,509 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:12,509 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:30:12,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:30:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2023-10-12 17:30:12,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:30:12,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:12,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:30:12,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:12,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 10 letters. Loop has 4 letters. [2023-10-12 17:30:12,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:12,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 31100 transitions, 465976 flow [2023-10-12 17:30:23,372 INFO L124 PetriNetUnfolderBase]: 571/1507 cut-off events. [2023-10-12 17:30:23,372 INFO L125 PetriNetUnfolderBase]: For 767/767 co-relation queries the response was YES. [2023-10-12 17:30:23,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11128 conditions, 1507 events. 571/1507 cut-off events. For 767/767 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 12377 event pairs, 0 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 5640. Up to 1488 conditions per place. [2023-10-12 17:30:23,373 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 57 places, 31100 transitions, 465976 flow [2023-10-12 17:30:23,798 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 57 places, 31100 transitions, 465976 flow [2023-10-12 17:30:23,798 INFO L430 stractBuchiCegarLoop]: Abstraction has has 57 places, 31100 transitions, 465976 flow [2023-10-12 17:30:23,798 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:30:23,798 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 places, 31100 transitions, 465976 flow [2023-10-12 17:30:34,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:34,095 INFO L124 PetriNetUnfolderBase]: 526/1301 cut-off events. [2023-10-12 17:30:34,095 INFO L125 PetriNetUnfolderBase]: For 736/736 co-relation queries the response was YES. [2023-10-12 17:30:34,095 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:34,095 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]true [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[L61-1, $Ultimate##0]true [90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 95#[L62, $Ultimate##0, $Ultimate##0]true [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 97#[L45-1, L62, $Ultimate##0]true [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 117#[L45-1, L62, L25-1]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 117#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 117#[L45-1, L62, L25-1]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 117#[L45-1, L62, L25-1]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 117#[L45-1, L62, L25-1]true [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 117#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 117#[L45-1, L62, L25-1]true [2023-10-12 17:30:34,095 INFO L750 eck$LassoCheckResult]: Loop: 117#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 117#[L45-1, L62, L25-1]true [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 117#[L45-1, L62, L25-1]true [2023-10-12 17:30:34,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:34,096 INFO L85 PathProgramCache]: Analyzing trace with hash 236706882, now seen corresponding path program 3 times [2023-10-12 17:30:34,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:34,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477204358] [2023-10-12 17:30:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:34,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:34,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:34,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:34,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:34,116 INFO L85 PathProgramCache]: Analyzing trace with hash 4481, now seen corresponding path program 6 times [2023-10-12 17:30:34,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:34,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845791071] [2023-10-12 17:30:34,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:34,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:34,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:34,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:34,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:34,134 INFO L85 PathProgramCache]: Analyzing trace with hash -157949566, now seen corresponding path program 4 times [2023-10-12 17:30:34,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:34,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085299445] [2023-10-12 17:30:34,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:34,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:34,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:34,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:34,555 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:34,555 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:34,555 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:34,555 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:34,555 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:34,555 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:34,555 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:34,555 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:34,555 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:30:34,555 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:34,556 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:34,557 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:30:34,559 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:30:34,561 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:30:34,563 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:30:34,564 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:30:34,566 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:30:34,666 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:30:34,946 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:34,946 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:34,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:34,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:34,948 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:30:34,978 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:30:34,980 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:30:34,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:34,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:34,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:34,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:34,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:34,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:35,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:35,015 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:30:35,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:35,025 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:30:35,065 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:30:35,065 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:30:35,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:35,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:35,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:35,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:35,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:35,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:35,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:35,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:35,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:35,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:35,104 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:30:35,106 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:30:35,108 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:30:35,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:35,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:35,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:35,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:35,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:35,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:35,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:35,123 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:30:35,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:35,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:35,124 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:30:35,126 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:30:35,128 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:30:35,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:35,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:35,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:35,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:35,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:35,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:35,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:35,155 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:30:35,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:35,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:35,157 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:30:35,158 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:30:35,160 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:30:35,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:35,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:35,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:35,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:35,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:35,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:35,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:35,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:35,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:35,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:35,189 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:30:35,191 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:30:35,192 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:30:35,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:35,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:35,200 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2023-10-12 17:30:35,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:35,264 INFO L401 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2023-10-12 17:30:35,264 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2023-10-12 17:30:35,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:35,412 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:30:35,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:35,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:35,413 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:30:35,415 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:30:35,417 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:30:35,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:35,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:35,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:35,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:35,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:35,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:35,440 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:35,451 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:30:35,451 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:30:35,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:35,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:35,452 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:30:35,454 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:30:35,455 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:35,476 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:35,476 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:35,476 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2023-10-12 17:30:35,482 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:30:35,487 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:30:35,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:35,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:35,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:35,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:30:35,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:35,531 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:30:35,531 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:30:35,532 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:30:35,581 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 6 states and 294 transitions. [2023-10-12 17:30:35,581 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:36,353 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:30:40,423 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:40,424 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:30:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:30:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2023-10-12 17:30:40,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:30:40,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:40,426 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:30:40,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:40,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:40,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:40,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:30:40,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:40,492 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:30:40,492 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:30:40,493 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:30:40,736 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 8 states and 388 transitions. [2023-10-12 17:30:40,736 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:46,441 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:46,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:30:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:30:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2023-10-12 17:30:46,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 216 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:30:46,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:46,446 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:30:46,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:46,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:46,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:46,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:30:46,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:46,498 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:30:46,499 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 2 loop predicates [2023-10-12 17:30:46,500 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:30:46,548 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 5 states and 248 transitions. [2023-10-12 17:30:46,548 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:49,870 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:49,870 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:30:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:30:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2023-10-12 17:30:49,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 171 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:30:49,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:49,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 171 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:30:49,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:49,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 171 transitions. Stem has 11 letters. Loop has 4 letters. [2023-10-12 17:30:49,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:49,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 346800 transitions, 5915712 flow Received shutdown request... [2023-10-12 17:34:02,163 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:34:02,175 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:34:02,284 WARN L144 chiPetriNetCegarLoop]: Unhandled de.uni_freiburg.informatik.ultimate.automata.AutomataOperationCanceledException: Timeout or canceled by user.occured during abstraction size reduction. Continuing with non-reduced net [2023-10-12 17:34:02,284 INFO L430 stractBuchiCegarLoop]: Abstraction has has 67 places, 346800 transitions, 5915712 flow [2023-10-12 17:34:02,284 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:34:02,284 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 67 places, 346800 transitions, 5915712 flow [2023-10-12 17:34:02,693 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:34:02,697 INFO L201 PluginConnector]: Adding new model queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:34:02 BoogieIcfgContainer [2023-10-12 17:34:02,697 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:34:02,699 INFO L158 Benchmark]: Toolchain (without parser) took 236408.54ms. Allocated memory was 189.8MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 143.3MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2023-10-12 17:34:02,699 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 189.8MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:34:02,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.26ms. Allocated memory is still 189.8MB. Free memory was 143.3MB in the beginning and 141.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:34:02,700 INFO L158 Benchmark]: Boogie Preprocessor took 14.37ms. Allocated memory is still 189.8MB. Free memory was 141.6MB in the beginning and 140.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:34:02,701 INFO L158 Benchmark]: RCFGBuilder took 292.62ms. Allocated memory is still 189.8MB. Free memory was 140.5MB in the beginning and 130.3MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:34:02,706 INFO L158 Benchmark]: BuchiAutomizer took 236079.77ms. Allocated memory was 189.8MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 130.0MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2023-10-12 17:34:02,709 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.24ms. Allocated memory is still 189.8MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.26ms. Allocated memory is still 189.8MB. Free memory was 143.3MB in the beginning and 141.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.37ms. Allocated memory is still 189.8MB. Free memory was 141.6MB in the beginning and 140.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 292.62ms. Allocated memory is still 189.8MB. Free memory was 140.5MB in the beginning and 130.3MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 236079.77ms. Allocated memory was 189.8MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 130.0MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 3.9GB. 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 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 4 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 4 locations. One nondeterministic module has affine ranking function q_back + -1 * q_front and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 5915712 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 236.0s and 8 iterations. TraceHistogramMax:0. Analysis of lassos took 5.2s. Construction of modules took 0.4s. Büchi inclusion checks took 14.7s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 541 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 535 mSDsluCounter, 509 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 215 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 553 IncrementalHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 294 mSDtfsCounter, 553 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital110 mio100 ax100 hnf100 lsp61 ukn91 mio100 lsp78 div100 bol109 ite100 ukn100 eq186 hnf91 smp100 dnf323 smp67 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 326ms VariablesStem: 11 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 32 PlacesBefore, 18 PlacesAfterwards, 27 TransitionsBefore, 13 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 12 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 172 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 129, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 129, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 163, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 129, unknown conditional: 0, unknown unconditional: 129] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown