/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/queue-add-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:31:37,969 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:31:38,044 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:31:38,074 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:31:38,075 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:31:38,075 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:31:38,077 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:31:38,077 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:31:38,077 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:31:38,081 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:31:38,081 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:31:38,081 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:31:38,082 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:31:38,083 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:31:38,083 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:31:38,084 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:31:38,084 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:31:38,084 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:31:38,084 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:31:38,084 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:31:38,085 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:31:38,086 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:31:38,086 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:31:38,086 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:31:38,087 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:31:38,087 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:31:38,087 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:31:38,087 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:31:38,087 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:31:38,088 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:31:38,089 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:31:38,089 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:31:38,089 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:31:38,090 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:31:38,091 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:31:38,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:31:38,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:31:38,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:31:38,346 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:31:38,347 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:31:38,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-2.wvr.bpl [2023-10-12 17:31:38,349 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-2.wvr.bpl' [2023-10-12 17:31:38,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:31:38,380 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:31:38,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:31:38,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:31:38,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:31:38,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:38" (1/1) ... [2023-10-12 17:31:38,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:38" (1/1) ... [2023-10-12 17:31:38,405 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:31:38,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:31:38,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:31:38,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:31:38,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:31:38,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:38" (1/1) ... [2023-10-12 17:31:38,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:38" (1/1) ... [2023-10-12 17:31:38,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:38" (1/1) ... [2023-10-12 17:31:38,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:38" (1/1) ... [2023-10-12 17:31:38,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:38" (1/1) ... [2023-10-12 17:31:38,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:38" (1/1) ... [2023-10-12 17:31:38,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:38" (1/1) ... [2023-10-12 17:31:38,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:38" (1/1) ... [2023-10-12 17:31:38,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:31:38,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:31:38,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:31:38,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:31:38,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:38" (1/1) ... [2023-10-12 17:31:38,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:38,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:38,462 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:31:38,468 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:31:38,509 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:31:38,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:31:38,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:31:38,509 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:31:38,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:31:38,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:31:38,510 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:31:38,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:31:38,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:31:38,511 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:31:38,556 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:31:38,558 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:31:38,673 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:31:38,702 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:31:38,702 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:31:38,704 INFO L201 PluginConnector]: Adding new model queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:38 BoogieIcfgContainer [2023-10-12 17:31:38,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:31:38,705 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:31:38,706 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:31:38,709 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:31:38,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:31:38,710 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:38" (1/2) ... [2023-10-12 17:31:38,712 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72cb20bf and model type queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:31:38, skipping insertion in model container [2023-10-12 17:31:38,712 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:31:38,713 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:38" (2/2) ... [2023-10-12 17:31:38,724 INFO L332 chiAutomizerObserver]: Analyzing ICFG queue-add-2.wvr.bpl [2023-10-12 17:31:38,781 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:31:38,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 72 flow [2023-10-12 17:31:38,819 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2023-10-12 17:31:38,820 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:31:38,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 2/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:31:38,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 72 flow [2023-10-12 17:31:38,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 24 transitions, 60 flow [2023-10-12 17:31:38,829 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:31:38,841 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 24 transitions, 60 flow [2023-10-12 17:31:38,843 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 24 transitions, 60 flow [2023-10-12 17:31:38,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 60 flow [2023-10-12 17:31:38,850 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2023-10-12 17:31:38,851 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:31:38,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 2/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:31:38,852 INFO L119 LiptonReduction]: Number of co-enabled transitions 142 [2023-10-12 17:31:39,213 INFO L134 LiptonReduction]: Checked pairs total: 132 [2023-10-12 17:31:39,214 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:31:39,225 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:31:39,225 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:31:39,225 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:31:39,225 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:31:39,225 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:31:39,225 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:31:39,226 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:31:39,226 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:31:39,226 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:31:39,230 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:39,230 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:31:39,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:31:39,230 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:39,233 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:31:39,233 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:31:39,234 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:39,234 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:31:39,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:31:39,234 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:39,239 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 41#[L22-1, L55-1]true [2023-10-12 17:31:39,239 INFO L750 eck$LassoCheckResult]: Loop: 41#[L22-1, L55-1]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 41#[L22-1, L55-1]true [2023-10-12 17:31:39,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:39,244 INFO L85 PathProgramCache]: Analyzing trace with hash 89065, now seen corresponding path program 1 times [2023-10-12 17:31:39,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:39,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432743004] [2023-10-12 17:31:39,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:39,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:39,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:39,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:39,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash 126, now seen corresponding path program 1 times [2023-10-12 17:31:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:39,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833074155] [2023-10-12 17:31:39,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:39,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:39,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:39,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:39,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2761110, now seen corresponding path program 1 times [2023-10-12 17:31:39,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:39,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453304855] [2023-10-12 17:31:39,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:39,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:39,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:39,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:39,465 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:31:39,466 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:31:39,466 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:31:39,467 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:31:39,467 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:31:39,467 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:39,467 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:31:39,467 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:31:39,467 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:31:39,467 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:31:39,467 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:31:39,481 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:31:39,498 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:31:39,501 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:31:39,559 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:31:39,562 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:31:39,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:39,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:39,569 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:31:39,578 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:31:39,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:39,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:39,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:39,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:39,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:39,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:39,600 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:31:39,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:39,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:31:39,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:39,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:39,621 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:31:39,624 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:31:39,626 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:31:39,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:39,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:31:39,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:39,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:39,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:39,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:31:39,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:31:39,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:39,653 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:31:39,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:39,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:39,655 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:31:39,657 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:31:39,659 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:31:39,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:39,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:39,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:39,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:39,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:39,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:39,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:39,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:31:39,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:39,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:39,695 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:31:39,699 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:31:39,700 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:31:39,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:39,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:39,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:39,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:39,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:39,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:39,733 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:31:39,744 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:31:39,744 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:31:39,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:39,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:39,747 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:39,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:31:39,786 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:31:39,804 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:31:39,804 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:31:39,805 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:31:39,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:31:39,814 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:31:39,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:39,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:31:39,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:39,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:31:39,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:39,863 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:31:39,899 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:31:39,902 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:31:40,014 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 270 transitions. [2023-10-12 17:31:40,015 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:31:40,018 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:31:40,019 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:31:40,023 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:31:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:31:40,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:31:40,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:40,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:31:40,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:40,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:31:40,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:40,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 170 transitions, 848 flow [2023-10-12 17:31:40,046 INFO L124 PetriNetUnfolderBase]: 55/104 cut-off events. [2023-10-12 17:31:40,047 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-10-12 17:31:40,047 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 288 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:31:40,047 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 30 places, 170 transitions, 848 flow [2023-10-12 17:31:40,051 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 30 places, 170 transitions, 848 flow [2023-10-12 17:31:40,051 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 170 transitions, 848 flow [2023-10-12 17:31:40,052 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:31:40,052 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 places, 170 transitions, 848 flow [2023-10-12 17:31:40,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:40,059 INFO L124 PetriNetUnfolderBase]: 23/40 cut-off events. [2023-10-12 17:31:40,059 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:31:40,060 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:40,060 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 92#[$Ultimate##0, L56, $Ultimate##0]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 94#[L22-1, $Ultimate##0, L56]true [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 96#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 96#[L22-1, L56, L40-1]true [2023-10-12 17:31:40,061 INFO L750 eck$LassoCheckResult]: Loop: 96#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 96#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 96#[L22-1, L56, L40-1]true [2023-10-12 17:31:40,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:40,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1640971576, now seen corresponding path program 1 times [2023-10-12 17:31:40,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:40,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230268496] [2023-10-12 17:31:40,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:40,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:40,118 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:31:40,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:40,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230268496] [2023-10-12 17:31:40,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230268496] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:31:40,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:31:40,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:31:40,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813303041] [2023-10-12 17:31:40,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:31:40,121 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:31:40,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash 4097, now seen corresponding path program 1 times [2023-10-12 17:31:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:40,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761240114] [2023-10-12 17:31:40,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:40,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:40,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:40,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:40,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:40,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:31:40,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:31:40,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 170 transitions, 848 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:40,265 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:40,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:40,324 INFO L124 PetriNetUnfolderBase]: 62/117 cut-off events. [2023-10-12 17:31:40,324 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-10-12 17:31:40,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 117 events. 62/117 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 336 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:31:40,328 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 45 selfloop transitions, 8 changer transitions 10/63 dead transitions. [2023-10-12 17:31:40,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 63 transitions, 420 flow [2023-10-12 17:31:40,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 63 transitions, 420 flow [2023-10-12 17:31:40,350 INFO L124 PetriNetUnfolderBase]: 62/117 cut-off events. [2023-10-12 17:31:40,351 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-10-12 17:31:40,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 117 events. 62/117 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 334 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:31:40,351 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 26 places, 63 transitions, 420 flow [2023-10-12 17:31:40,354 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 26 places, 63 transitions, 420 flow [2023-10-12 17:31:40,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:31:40,355 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 63 transitions, 420 flow [2023-10-12 17:31:40,355 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:31:40,355 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 places, 63 transitions, 420 flow [2023-10-12 17:31:40,365 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:40,365 INFO L124 PetriNetUnfolderBase]: 36/66 cut-off events. [2023-10-12 17:31:40,365 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:31:40,365 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:40,366 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 92#[$Ultimate##0, L56, $Ultimate##0]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 94#[L22-1, $Ultimate##0, L56]true [96] L22-1-->thread1EXIT: Formula: (and (= (+ v_q_back_54 1) v_q_back_53) (= (select v_q_30 v_q_back_54) 0) (<= v_N_15 v_i_18)) InVars {q=v_q_30, q_back=v_q_back_54, N=v_N_15, i=v_i_18} OutVars{q=v_q_30, q_back=v_q_back_53, N=v_N_15, i=v_i_18} AuxVars[] AssignedVars[q_back] 113#[$Ultimate##0, L56, thread1EXIT]true [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 115#[L56, L40-1, thread1EXIT]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 115#[L56, L40-1, thread1EXIT]true [2023-10-12 17:31:40,366 INFO L750 eck$LassoCheckResult]: Loop: 115#[L56, L40-1, thread1EXIT]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 115#[L56, L40-1, thread1EXIT]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 115#[L56, L40-1, thread1EXIT]true [2023-10-12 17:31:40,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash 669491522, now seen corresponding path program 1 times [2023-10-12 17:31:40,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:40,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29263011] [2023-10-12 17:31:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:40,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:40,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:40,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:40,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash 4097, now seen corresponding path program 2 times [2023-10-12 17:31:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:40,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76578970] [2023-10-12 17:31:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:40,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:40,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:40,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:40,437 INFO L85 PathProgramCache]: Analyzing trace with hash -863738622, now seen corresponding path program 2 times [2023-10-12 17:31:40,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:40,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920644296] [2023-10-12 17:31:40,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:40,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:40,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:40,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920644296] [2023-10-12 17:31:40,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920644296] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:31:40,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418989673] [2023-10-12 17:31:40,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:31:40,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:31:40,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:40,557 INFO L229 MonitoredProcess]: Starting monitored process 7 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:31:40,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-10-12 17:31:40,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:31:40,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:31:40,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:31:40,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:40,637 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:31:40,637 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:31:40,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418989673] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:31:40,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:31:40,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-10-12 17:31:40,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528883660] [2023-10-12 17:31:40,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:31:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:40,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:31:40,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:31:40,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 63 transitions, 420 flow. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:31:40,784 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:40,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:40,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:31:40,857 INFO L124 PetriNetUnfolderBase]: 103/220 cut-off events. [2023-10-12 17:31:40,857 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-10-12 17:31:40,860 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 30. Compared 907 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:31:40,863 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 71 selfloop transitions, 21 changer transitions 22/114 dead transitions. [2023-10-12 17:31:40,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 114 transitions, 1002 flow [2023-10-12 17:31:40,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 114 transitions, 1002 flow [2023-10-12 17:31:40,884 INFO L124 PetriNetUnfolderBase]: 103/220 cut-off events. [2023-10-12 17:31:40,884 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-10-12 17:31:40,885 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 30. Compared 911 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:31:40,885 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 29 places, 114 transitions, 1002 flow [2023-10-12 17:31:40,888 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 29 places, 114 transitions, 1002 flow [2023-10-12 17:31:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:31:40,889 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 114 transitions, 1002 flow [2023-10-12 17:31:40,889 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:31:40,889 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 29 places, 114 transitions, 1002 flow [2023-10-12 17:31:40,903 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:40,903 INFO L124 PetriNetUnfolderBase]: 69/134 cut-off events. [2023-10-12 17:31:40,903 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-10-12 17:31:40,903 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:40,904 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 92#[$Ultimate##0, L56, $Ultimate##0]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 94#[L22-1, $Ultimate##0, L56]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 94#[L22-1, $Ultimate##0, L56]true [96] L22-1-->thread1EXIT: Formula: (and (= (+ v_q_back_54 1) v_q_back_53) (= (select v_q_30 v_q_back_54) 0) (<= v_N_15 v_i_18)) InVars {q=v_q_30, q_back=v_q_back_54, N=v_N_15, i=v_i_18} OutVars{q=v_q_30, q_back=v_q_back_53, N=v_N_15, i=v_i_18} AuxVars[] AssignedVars[q_back] 113#[$Ultimate##0, L56, thread1EXIT]true [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 115#[L56, L40-1, thread1EXIT]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 115#[L56, L40-1, thread1EXIT]true [2023-10-12 17:31:40,904 INFO L750 eck$LassoCheckResult]: Loop: 115#[L56, L40-1, thread1EXIT]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 115#[L56, L40-1, thread1EXIT]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 115#[L56, L40-1, thread1EXIT]true [2023-10-12 17:31:40,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:40,905 INFO L85 PathProgramCache]: Analyzing trace with hash -720626263, now seen corresponding path program 1 times [2023-10-12 17:31:40,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:40,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472784550] [2023-10-12 17:31:40,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:40,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:40,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:40,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:40,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:40,923 INFO L85 PathProgramCache]: Analyzing trace with hash 4097, now seen corresponding path program 3 times [2023-10-12 17:31:40,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:40,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42638289] [2023-10-12 17:31:40,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:40,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:40,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:40,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:40,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1032100951, now seen corresponding path program 2 times [2023-10-12 17:31:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:40,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888612374] [2023-10-12 17:31:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:40,988 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:31:40,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:40,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888612374] [2023-10-12 17:31:40,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888612374] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:31:40,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123739851] [2023-10-12 17:31:40,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:31:40,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:31:40,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:40,990 INFO L229 MonitoredProcess]: Starting monitored process 8 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:31:41,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-10-12 17:31:41,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:31:41,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:31:41,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:31:41,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:41,049 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:31:41,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:31:41,079 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:31:41,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123739851] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:31:41,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:31:41,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-10-12 17:31:41,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758679764] [2023-10-12 17:31:41,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:31:41,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:41,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-10-12 17:31:41,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-10-12 17:31:41,197 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:31:41,197 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:41,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:41,282 INFO L124 PetriNetUnfolderBase]: 166/371 cut-off events. [2023-10-12 17:31:41,282 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-10-12 17:31:41,283 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 1844 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:31:41,285 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 107 selfloop transitions, 44 changer transitions 40/191 dead transitions. [2023-10-12 17:31:41,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 191 transitions, 2066 flow [2023-10-12 17:31:41,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 191 transitions, 2066 flow [2023-10-12 17:31:41,317 INFO L124 PetriNetUnfolderBase]: 166/371 cut-off events. [2023-10-12 17:31:41,317 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-10-12 17:31:41,318 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 1841 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:31:41,318 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 33 places, 191 transitions, 2066 flow [2023-10-12 17:31:41,321 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 33 places, 191 transitions, 2066 flow [2023-10-12 17:31:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:31:41,322 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 191 transitions, 2066 flow [2023-10-12 17:31:41,322 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:31:41,322 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 places, 191 transitions, 2066 flow [2023-10-12 17:31:41,343 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:41,343 INFO L124 PetriNetUnfolderBase]: 108/216 cut-off events. [2023-10-12 17:31:41,343 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-10-12 17:31:41,343 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:41,344 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 41#[L22-1, L55-1]true [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 94#[L22-1, $Ultimate##0, L56]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 94#[L22-1, $Ultimate##0, L56]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 94#[L22-1, $Ultimate##0, L56]true [96] L22-1-->thread1EXIT: Formula: (and (= (+ v_q_back_54 1) v_q_back_53) (= (select v_q_30 v_q_back_54) 0) (<= v_N_15 v_i_18)) InVars {q=v_q_30, q_back=v_q_back_54, N=v_N_15, i=v_i_18} OutVars{q=v_q_30, q_back=v_q_back_53, N=v_N_15, i=v_i_18} AuxVars[] AssignedVars[q_back] 113#[$Ultimate##0, L56, thread1EXIT]true [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 115#[L56, L40-1, thread1EXIT]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 115#[L56, L40-1, thread1EXIT]true [2023-10-12 17:31:41,344 INFO L750 eck$LassoCheckResult]: Loop: 115#[L56, L40-1, thread1EXIT]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 115#[L56, L40-1, thread1EXIT]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 115#[L56, L40-1, thread1EXIT]true [2023-10-12 17:31:41,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash -862226054, now seen corresponding path program 3 times [2023-10-12 17:31:41,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:41,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030250028] [2023-10-12 17:31:41,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:41,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:41,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:41,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:41,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash 4097, now seen corresponding path program 4 times [2023-10-12 17:31:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:41,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338114112] [2023-10-12 17:31:41,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:41,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:41,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:41,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:41,366 INFO L85 PathProgramCache]: Analyzing trace with hash 329453370, now seen corresponding path program 4 times [2023-10-12 17:31:41,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:41,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508894152] [2023-10-12 17:31:41,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:41,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:41,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:41,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:41,675 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:31:41,675 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:31:41,675 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:31:41,675 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:31:41,675 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:31:41,675 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:41,675 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:31:41,675 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:31:41,676 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:31:41,676 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:31:41,676 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:31:41,678 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:31:41,787 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:31:41,789 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:31:41,794 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:31:41,796 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:31:41,799 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:31:42,134 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:31:42,134 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:31:42,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:42,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:42,139 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:31:42,148 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:31:42,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:42,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:42,157 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2023-10-12 17:31:42,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:42,169 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:31:42,272 INFO L401 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2023-10-12 17:31:42,272 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2023-10-12 17:31:42,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:42,447 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:31:42,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:42,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:42,450 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:31:42,451 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:31:42,453 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:31:42,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:42,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:42,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:42,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:42,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:42,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:42,477 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:31:42,488 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:31:42,489 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:31:42,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:42,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:42,495 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:31:42,496 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:31:42,497 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:31:42,519 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:31:42,519 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:31:42,519 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_front, q_back) = -1*q_front + 1*q_back Supporting invariants [] [2023-10-12 17:31:42,528 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:31:42,530 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:31:42,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:42,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:31:42,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:42,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:31:42,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:42,575 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:31:42,576 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:31:42,576 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:31:42,644 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 254 transitions. [2023-10-12 17:31:42,644 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:31:42,660 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:31:42,661 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:31:42,662 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:31:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2023-10-12 17:31:42,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:31:42,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:42,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:31:42,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:42,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 9 letters. Loop has 4 letters. [2023-10-12 17:31:42,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:42,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 2410 transitions, 31104 flow [2023-10-12 17:31:42,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:31:43,046 INFO L124 PetriNetUnfolderBase]: 310/793 cut-off events. [2023-10-12 17:31:43,047 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2023-10-12 17:31:43,048 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 104. Compared 5419 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:31:43,048 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 45 places, 2410 transitions, 31104 flow [2023-10-12 17:31:43,093 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 45 places, 2410 transitions, 31104 flow [2023-10-12 17:31:43,093 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 2410 transitions, 31104 flow [2023-10-12 17:31:43,093 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:31:43,093 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 2410 transitions, 31104 flow [2023-10-12 17:31:43,328 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:43,328 INFO L124 PetriNetUnfolderBase]: 248/598 cut-off events. [2023-10-12 17:31:43,328 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-10-12 17:31:43,328 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:43,329 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 92#[$Ultimate##0, L56, $Ultimate##0]true [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 315#[L56, $Ultimate##0, L40-1]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 96#[L22-1, L56, L40-1]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 96#[L22-1, L56, L40-1]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 96#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 96#[L22-1, L56, L40-1]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 96#[L22-1, L56, L40-1]true [96] L22-1-->thread1EXIT: Formula: (and (= (+ v_q_back_54 1) v_q_back_53) (= (select v_q_30 v_q_back_54) 0) (<= v_N_15 v_i_18)) InVars {q=v_q_30, q_back=v_q_back_54, N=v_N_15, i=v_i_18} OutVars{q=v_q_30, q_back=v_q_back_53, N=v_N_15, i=v_i_18} AuxVars[] AssignedVars[q_back] 115#[L56, L40-1, thread1EXIT]true [2023-10-12 17:31:43,329 INFO L750 eck$LassoCheckResult]: Loop: 115#[L56, L40-1, thread1EXIT]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 115#[L56, L40-1, thread1EXIT]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 115#[L56, L40-1, thread1EXIT]true [2023-10-12 17:31:43,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1952665693, now seen corresponding path program 5 times [2023-10-12 17:31:43,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:43,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783853166] [2023-10-12 17:31:43,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:43,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:43,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:43,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:43,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash 4097, now seen corresponding path program 5 times [2023-10-12 17:31:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:43,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927519534] [2023-10-12 17:31:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:43,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:43,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:43,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash 388980515, now seen corresponding path program 6 times [2023-10-12 17:31:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:43,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482925355] [2023-10-12 17:31:43,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:43,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:43,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:43,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:43,649 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:31:43,649 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:31:43,649 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:31:43,649 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:31:43,649 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:31:43,649 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:43,649 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:31:43,649 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:31:43,649 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:31:43,649 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:31:43,649 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:31:43,651 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:31:43,654 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:31:43,761 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:31:43,765 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:31:43,767 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:31:43,769 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:31:44,089 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:31:44,089 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:31:44,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:44,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:44,091 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:31:44,104 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:31:44,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:44,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:44,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:44,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:44,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:44,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:44,117 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:31:44,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:44,135 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:31:44,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:44,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:44,137 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:31:44,145 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:31:44,146 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:31:44,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:44,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:44,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:44,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:44,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:44,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:44,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:31:44,177 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:31:44,177 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:31:44,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:44,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:44,179 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:31:44,181 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:31:44,183 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:31:44,200 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:31:44,200 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:31:44,200 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:31:44,204 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:31:44,210 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:31:44,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:44,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:31:44,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:44,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:31:44,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:44,255 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:31:44,256 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:31:44,257 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:31:44,313 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 254 transitions. [2023-10-12 17:31:44,314 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:31:44,557 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:31:44,558 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:31:44,558 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:31:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2023-10-12 17:31:44,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:31:44,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:44,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:31:44,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:44,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 10 letters. Loop has 4 letters. [2023-10-12 17:31:44,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:44,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 31100 transitions, 465976 flow [2023-10-12 17:31:45,117 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:31:56,690 INFO L124 PetriNetUnfolderBase]: 571/1507 cut-off events. [2023-10-12 17:31:56,691 INFO L125 PetriNetUnfolderBase]: For 767/767 co-relation queries the response was YES. [2023-10-12 17:31:56,692 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 196. Compared 12350 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:31:56,692 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 57 places, 31100 transitions, 465976 flow [2023-10-12 17:31:57,121 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 57 places, 31100 transitions, 465976 flow [2023-10-12 17:31:57,121 INFO L430 stractBuchiCegarLoop]: Abstraction has has 57 places, 31100 transitions, 465976 flow [2023-10-12 17:31:57,121 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:31:57,121 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 places, 31100 transitions, 465976 flow [2023-10-12 17:32:07,592 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:32:07,592 INFO L124 PetriNetUnfolderBase]: 533/1326 cut-off events. [2023-10-12 17:32:07,592 INFO L125 PetriNetUnfolderBase]: For 738/738 co-relation queries the response was YES. [2023-10-12 17:32:07,592 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:32:07,593 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]true [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]true [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]true [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 92#[$Ultimate##0, L56, $Ultimate##0]true [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 315#[L56, $Ultimate##0, L40-1]true [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 96#[L22-1, L56, L40-1]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 96#[L22-1, L56, L40-1]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 96#[L22-1, L56, L40-1]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 96#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 96#[L22-1, L56, L40-1]true [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 96#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 96#[L22-1, L56, L40-1]true [2023-10-12 17:32:07,593 INFO L750 eck$LassoCheckResult]: Loop: 96#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 96#[L22-1, L56, L40-1]true [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 96#[L22-1, L56, L40-1]true [2023-10-12 17:32:07,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash -403180762, now seen corresponding path program 1 times [2023-10-12 17:32:07,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:07,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866684116] [2023-10-12 17:32:07,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:07,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:07,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:07,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:07,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash 4097, now seen corresponding path program 6 times [2023-10-12 17:32:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:07,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219766690] [2023-10-12 17:32:07,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:07,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:07,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:07,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:07,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:07,625 INFO L85 PathProgramCache]: Analyzing trace with hash -909652506, now seen corresponding path program 2 times [2023-10-12 17:32:07,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:32:07,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051123032] [2023-10-12 17:32:07,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:32:07,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:32:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:07,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:32:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:32:07,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:07,950 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:32:07,950 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:32:07,950 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:32:07,950 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:32:07,950 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:32:07,950 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:07,951 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:32:07,951 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:32:07,951 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:32:07,951 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:32:07,951 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:32:07,954 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:32:07,957 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:32:07,959 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:32:07,961 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:32:07,963 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:32:07,965 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:32:08,360 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:32:08,360 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:32:08,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:08,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:08,364 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:32:08,365 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:32:08,371 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:32:08,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:08,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:08,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:08,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:08,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:08,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:08,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:08,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:08,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:08,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:08,423 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:32:08,436 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:32:08,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:08,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:08,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:08,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:08,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:08,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:08,448 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:32:08,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:08,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:08,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:08,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:08,476 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:32:08,478 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:32:08,480 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:32:08,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:08,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:08,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:08,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:08,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:08,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:08,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:08,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:08,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:08,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:08,510 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:32:08,512 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:32:08,513 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:32:08,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:08,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:08,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:08,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:08,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:08,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:08,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:08,543 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:32:08,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:08,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:08,544 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:32:08,551 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:32:08,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:08,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:08,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:08,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:08,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:08,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:08,563 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:32:08,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:08,576 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:32:08,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:08,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:08,577 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:32:08,587 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:32:08,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:08,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:08,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:08,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:08,597 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:32:08,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:08,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:08,602 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:32:08,610 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:32:08,610 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:32:08,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:08,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:08,613 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:32:08,615 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:32:08,617 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:32:08,623 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:32:08,623 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:32:08,624 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_front, q_back) = -1*q_front + 1*q_back Supporting invariants [] [2023-10-12 17:32:08,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-10-12 17:32:08,629 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:32:08,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:08,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:32:08,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:08,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:32:08,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:08,679 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:32:08,679 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:32:08,679 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:32:08,731 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 254 transitions. [2023-10-12 17:32:08,731 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:32:09,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:14,261 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:32:14,262 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:32:14,262 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:32:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2023-10-12 17:32:14,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 148 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:32:14,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:14,263 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:32:14,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:14,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:32:14,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:14,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:32:14,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:14,311 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:32:14,311 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:32:14,311 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:32:14,380 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 336 transitions. [2023-10-12 17:32:14,380 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:32:20,457 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:32:20,457 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:32:20,458 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:32:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2023-10-12 17:32:20,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 188 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:32:20,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:20,459 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:32:20,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:20,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:32:20,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:20,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:32:20,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:20,503 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:32:20,503 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:32:20,503 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:32:20,556 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 214 transitions. [2023-10-12 17:32:20,556 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:32:24,770 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:32:24,770 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:32:24,771 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:32:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2023-10-12 17:32:24,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 149 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:32:24,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:24,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 149 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:32:24,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:24,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 149 transitions. Stem has 11 letters. Loop has 4 letters. [2023-10-12 17:32:24,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:24,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 346800 transitions, 5915712 flow Received shutdown request... [2023-10-12 17:35:41,261 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:35:41,261 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:35:41,262 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:35:41,304 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:35:41,304 INFO L430 stractBuchiCegarLoop]: Abstraction has has 67 places, 346800 transitions, 5915712 flow [2023-10-12 17:35:41,305 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:35:41,305 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 67 places, 346800 transitions, 5915712 flow [2023-10-12 17:35:41,533 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:35:41,538 INFO L201 PluginConnector]: Adding new model queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:35:41 BoogieIcfgContainer [2023-10-12 17:35:41,538 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:35:41,538 INFO L158 Benchmark]: Toolchain (without parser) took 243158.41ms. Allocated memory was 202.4MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 151.5MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 6.6GB. Max. memory is 8.0GB. [2023-10-12 17:35:41,540 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.29ms. Allocated memory is still 202.4MB. Free memory was 152.7MB in the beginning and 152.6MB in the end (delta: 113.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:35:41,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.46ms. Allocated memory is still 202.4MB. Free memory was 151.4MB in the beginning and 149.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:35:41,541 INFO L158 Benchmark]: Boogie Preprocessor took 19.36ms. Allocated memory is still 202.4MB. Free memory was 149.8MB in the beginning and 148.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:35:41,541 INFO L158 Benchmark]: RCFGBuilder took 275.87ms. Allocated memory is still 202.4MB. Free memory was 148.8MB in the beginning and 170.0MB in the end (delta: -21.2MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2023-10-12 17:35:41,541 INFO L158 Benchmark]: BuchiAutomizer took 242832.29ms. Allocated memory was 202.4MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 169.9MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 6.6GB. Max. memory is 8.0GB. [2023-10-12 17:35:41,543 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.29ms. Allocated memory is still 202.4MB. Free memory was 152.7MB in the beginning and 152.6MB in the end (delta: 113.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.46ms. Allocated memory is still 202.4MB. Free memory was 151.4MB in the beginning and 149.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.36ms. Allocated memory is still 202.4MB. Free memory was 149.8MB in the beginning and 148.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 275.87ms. Allocated memory is still 202.4MB. Free memory was 148.8MB in the beginning and 170.0MB in the end (delta: -21.2MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 242832.29ms. Allocated memory was 202.4MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 169.9MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 6.6GB. 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 242.7s and 8 iterations. TraceHistogramMax:0. Analysis of lassos took 4.5s. Construction of modules took 0.3s. Büchi inclusion checks took 16.8s. 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, 461 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 455 mSDsluCounter, 440 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 502 IncrementalHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 255 mSDtfsCounter, 502 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp75 ukn91 mio100 lsp77 div100 bol109 ite100 ukn100 eq186 hnf91 smp100 dnf323 smp67 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 302ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - 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.4s, 29 PlacesBefore, 18 PlacesAfterwards, 24 TransitionsBefore, 13 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 132 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 92, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 92, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 92, unknown conditional: 0, unknown unconditional: 92] , 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 [2023-10-12 17:35:41,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 Completed graceful shutdown