/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/prod-cons3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:31:29,342 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:31:29,399 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:29,421 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:31:29,422 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:31:29,422 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:31:29,424 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:31:29,424 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:31:29,424 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:31:29,427 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:31:29,427 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:31:29,428 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:31:29,428 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:31:29,429 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:31:29,429 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:31:29,429 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:31:29,429 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:31:29,429 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:31:29,429 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:31:29,429 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:31:29,430 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:31:29,431 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:31:29,431 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:31:29,431 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:31:29,431 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:31:29,431 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:31:29,431 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:31:29,431 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:31:29,432 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:31:29,432 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:31:29,432 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:31:29,433 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:31:29,433 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:31:29,434 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:31:29,434 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:29,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:31:29,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:31:29,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:31:29,635 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:31:29,636 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:31:29,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl [2023-10-12 17:31:29,637 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl' [2023-10-12 17:31:29,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:31:29,665 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:31:29,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:31:29,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:31:29,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:31:29,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:29" (1/1) ... [2023-10-12 17:31:29,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:29" (1/1) ... [2023-10-12 17:31:29,684 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:31:29,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:31:29,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:31:29,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:31:29,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:31:29,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:29" (1/1) ... [2023-10-12 17:31:29,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:29" (1/1) ... [2023-10-12 17:31:29,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:29" (1/1) ... [2023-10-12 17:31:29,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:29" (1/1) ... [2023-10-12 17:31:29,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:29" (1/1) ... [2023-10-12 17:31:29,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:29" (1/1) ... [2023-10-12 17:31:29,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:29" (1/1) ... [2023-10-12 17:31:29,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:29" (1/1) ... [2023-10-12 17:31:29,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:31:29,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:31:29,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:31:29,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:31:29,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:29" (1/1) ... [2023-10-12 17:31:29,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:29,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:29,726 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:29,749 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:29,755 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:31:29,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:31:29,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:31:29,755 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:31:29,756 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:31:29,756 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:31:29,756 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:31:29,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:31:29,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:31:29,756 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:31:29,756 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:31:29,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:31:29,757 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:31:29,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:31:29,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:31:29,758 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:29,795 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:31:29,796 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:31:29,871 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:31:29,888 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:31:29,889 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:31:29,890 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:29 BoogieIcfgContainer [2023-10-12 17:31:29,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:31:29,891 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:31:29,891 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:31:29,894 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:31:29,894 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:31:29,894 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:31:29" (1/2) ... [2023-10-12 17:31:29,895 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28ed9d84 and model type prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:31:29, skipping insertion in model container [2023-10-12 17:31:29,895 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:31:29,895 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:31:29" (2/2) ... [2023-10-12 17:31:29,896 INFO L332 chiAutomizerObserver]: Analyzing ICFG prod-cons3.wvr.bpl [2023-10-12 17:31:29,968 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:31:29,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 120 flow [2023-10-12 17:31:30,012 INFO L124 PetriNetUnfolderBase]: 3/36 cut-off events. [2023-10-12 17:31:30,013 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:31:30,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 3/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2023-10-12 17:31:30,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 44 transitions, 120 flow [2023-10-12 17:31:30,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 96 flow [2023-10-12 17:31:30,022 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:31:30,031 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 36 transitions, 96 flow [2023-10-12 17:31:30,033 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 36 transitions, 96 flow [2023-10-12 17:31:30,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 96 flow [2023-10-12 17:31:30,043 INFO L124 PetriNetUnfolderBase]: 3/36 cut-off events. [2023-10-12 17:31:30,043 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:31:30,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 3/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2023-10-12 17:31:30,044 INFO L119 LiptonReduction]: Number of co-enabled transitions 342 [2023-10-12 17:31:30,420 INFO L134 LiptonReduction]: Checked pairs total: 542 [2023-10-12 17:31:30,420 INFO L136 LiptonReduction]: Total number of compositions: 17 [2023-10-12 17:31:30,431 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:31:30,431 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:31:30,431 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:31:30,432 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:31:30,432 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:31:30,432 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:31:30,432 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:31:30,433 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:31:30,434 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 places, 20 transitions, 64 flow [2023-10-12 17:31:30,438 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:30,438 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:31:30,438 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:31:30,438 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:30,440 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:31:30,440 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 places, 20 transitions, 64 flow [2023-10-12 17:31:30,441 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:30,442 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:31:30,442 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:31:30,442 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:30,448 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [2023-10-12 17:31:30,448 INFO L750 eck$LassoCheckResult]: Loop: 58#[L26, L80-1]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 58#[L26, L80-1]true [2023-10-12 17:31:30,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:30,452 INFO L85 PathProgramCache]: Analyzing trace with hash 5507, now seen corresponding path program 1 times [2023-10-12 17:31:30,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:30,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417003853] [2023-10-12 17:31:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:30,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:30,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:30,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash 173, now seen corresponding path program 1 times [2023-10-12 17:31:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:30,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224024293] [2023-10-12 17:31:30,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:30,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:30,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:30,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:30,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:30,551 INFO L85 PathProgramCache]: Analyzing trace with hash 170859, now seen corresponding path program 1 times [2023-10-12 17:31:30,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:30,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600405555] [2023-10-12 17:31:30,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:30,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:30,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:30,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:30,669 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:31:30,670 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:31:30,670 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:31:30,670 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:31:30,670 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:31:30,671 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:30,671 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:31:30,671 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:31:30,671 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:31:30,671 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:31:30,671 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:31:30,682 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:30,689 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:30,691 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:30,694 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:30,700 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:30,704 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:30,706 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:30,791 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:31:30,794 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:31:30,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:30,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:30,797 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:30,802 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:30,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:31:30,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:30,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:30,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:30,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:30,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:30,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:30,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:30,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:31:30,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:30,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:30,850 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:30,853 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:30,855 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:30,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:30,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:30,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:30,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:30,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:30,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:30,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:30,885 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:30,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:30,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:30,887 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:30,895 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:30,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:30,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:30,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:30,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:30,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:30,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:30,908 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:30,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:30,927 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:30,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:30,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:30,929 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:30,933 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:30,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:30,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:30,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:30,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:30,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:30,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:30,949 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:30,957 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:31:30,963 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:31:30,963 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:31:30,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:30,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:30,967 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:30,997 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:31:31,009 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:31,018 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:31:31,018 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:31:31,019 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(w) = 1*w Supporting invariants [] [2023-10-12 17:31:31,021 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:31,024 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:31:31,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:31,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:31:31,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:31,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:31:31,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:31,072 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:31,110 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:31,111 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:31,222 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 358 transitions. [2023-10-12 17:31:31,223 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:31:31,225 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:31:31,228 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:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2023-10-12 17:31:31,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 244 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:31:31,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:31,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 244 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:31:31,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:31,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 244 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:31:31,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:31,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 232 transitions, 1216 flow [2023-10-12 17:31:31,307 INFO L124 PetriNetUnfolderBase]: 798/1098 cut-off events. [2023-10-12 17:31:31,307 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2023-10-12 17:31:31,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 1098 events. 798/1098 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3938 event pairs, 186 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 1896. Up to 382 conditions per place. [2023-10-12 17:31:31,310 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 40 places, 232 transitions, 1216 flow [2023-10-12 17:31:31,313 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 40 places, 232 transitions, 1216 flow [2023-10-12 17:31:31,313 INFO L430 stractBuchiCegarLoop]: Abstraction has has 40 places, 232 transitions, 1216 flow [2023-10-12 17:31:31,313 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:31:31,314 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 places, 232 transitions, 1216 flow [2023-10-12 17:31:31,317 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:31,317 INFO L124 PetriNetUnfolderBase]: 18/32 cut-off events. [2023-10-12 17:31:31,317 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-10-12 17:31:31,317 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:31,318 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 103#[L26, L81, L38]true [2023-10-12 17:31:31,318 INFO L750 eck$LassoCheckResult]: Loop: 103#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 106#[L26, L39, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 103#[L26, L81, L38]true [2023-10-12 17:31:31,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash 170833, now seen corresponding path program 1 times [2023-10-12 17:31:31,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:31,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818600098] [2023-10-12 17:31:31,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:31,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:31,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:31,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:31,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:31,327 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 1 times [2023-10-12 17:31:31,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:31,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627988099] [2023-10-12 17:31:31,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:31,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:31,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:31,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:31,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash 164173722, now seen corresponding path program 1 times [2023-10-12 17:31:31,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:31,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386839906] [2023-10-12 17:31:31,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:31,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:31,376 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:31,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:31,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386839906] [2023-10-12 17:31:31,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386839906] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:31:31,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:31:31,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:31:31,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182328570] [2023-10-12 17:31:31,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:31:31,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:31,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:31:31,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:31:31,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 232 transitions, 1216 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:31,417 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:31,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:31,540 INFO L124 PetriNetUnfolderBase]: 1138/1615 cut-off events. [2023-10-12 17:31:31,540 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2023-10-12 17:31:31,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5293 conditions, 1615 events. 1138/1615 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6344 event pairs, 291 based on Foata normal form. 52/1184 useless extension candidates. Maximal degree in co-relation 3934. Up to 1122 conditions per place. [2023-10-12 17:31:31,554 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 100 selfloop transitions, 3 changer transitions 18/121 dead transitions. [2023-10-12 17:31:31,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 121 transitions, 870 flow [2023-10-12 17:31:31,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 121 transitions, 870 flow [2023-10-12 17:31:31,630 INFO L124 PetriNetUnfolderBase]: 1138/1615 cut-off events. [2023-10-12 17:31:31,630 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2023-10-12 17:31:31,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5293 conditions, 1615 events. 1138/1615 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6353 event pairs, 291 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 3934. Up to 1122 conditions per place. [2023-10-12 17:31:31,633 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 38 places, 121 transitions, 870 flow [2023-10-12 17:31:31,634 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 38 places, 121 transitions, 870 flow [2023-10-12 17:31:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:31:31,636 INFO L430 stractBuchiCegarLoop]: Abstraction has has 38 places, 121 transitions, 870 flow [2023-10-12 17:31:31,636 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:31:31,636 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 places, 121 transitions, 870 flow [2023-10-12 17:31:31,640 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:31,640 INFO L124 PetriNetUnfolderBase]: 30/56 cut-off events. [2023-10-12 17:31:31,641 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-10-12 17:31:31,641 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:31,641 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 103#[L26, L81, L38]true [2023-10-12 17:31:31,641 INFO L750 eck$LassoCheckResult]: Loop: 103#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 106#[L26, L39, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 103#[L26, L81, L38]true [2023-10-12 17:31:31,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:31,642 INFO L85 PathProgramCache]: Analyzing trace with hash 5296745, now seen corresponding path program 1 times [2023-10-12 17:31:31,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:31,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877480788] [2023-10-12 17:31:31,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:31,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:31,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:31,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:31,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 2 times [2023-10-12 17:31:31,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:31,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054538849] [2023-10-12 17:31:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:31,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:31,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:31,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:31,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:31,688 INFO L85 PathProgramCache]: Analyzing trace with hash 795207858, now seen corresponding path program 1 times [2023-10-12 17:31:31,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:31,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546828070] [2023-10-12 17:31:31,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:31,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:31,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:31:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:31,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:31,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:31,840 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:31:31,840 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:31:31,840 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:31:31,840 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:31:31,840 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:31:31,840 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:31,841 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:31:31,841 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:31:31,841 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:31:31,841 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:31:31,841 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:31:31,843 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:31,845 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:31,847 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:31,851 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:31,853 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:31,875 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:31,877 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:31,971 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:31:31,971 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:31:31,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:31,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:31,973 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:31,977 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:31,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:31,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:31,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:31,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:31,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:31,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:31,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:31:31,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:32,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:31:32,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:32,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:32,001 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:31:32,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:31:32,004 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:32,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:32,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:32,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:32,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:32,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:32,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:32,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:32,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:31:32,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:32,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:32,038 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:32,040 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:32,041 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:32,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:32,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:32,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:32,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:32,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:32,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:32,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:32,071 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:32,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:32,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:32,074 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:32,089 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:32,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:31:32,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:32,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:32,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:32,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:32,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:32,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:32,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:32,119 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:32,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:32,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:32,121 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:32,127 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:32,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:31:32,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:32,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:32,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:32,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:32,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:32,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:32,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:32,155 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:32,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:32,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:32,157 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:32,158 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:32,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:31:32,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:32,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:32,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:32,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:32,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:32,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:32,184 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:31:32,190 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:31:32,190 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:31:32,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:32,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:32,191 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:32,193 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:32,194 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:31:32,215 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:31:32,216 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:31:32,216 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(front1, back1) = -1*front1 + 1*back1 Supporting invariants [] [2023-10-12 17:31:32,220 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:32,221 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:31:32,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:32,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:31:32,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:32,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:31:32,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:32,249 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:32,250 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:32,250 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:32,310 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 409 transitions. [2023-10-12 17:31:32,310 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:31:32,317 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:31:32,317 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:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2023-10-12 17:31:32,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:31:32,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:32,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:31:32,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:32,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:31:32,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:32,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 1658 transitions, 15280 flow [2023-10-12 17:31:32,502 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:32,663 INFO L124 PetriNetUnfolderBase]: 2721/3861 cut-off events. [2023-10-12 17:31:32,663 INFO L125 PetriNetUnfolderBase]: For 862/862 co-relation queries the response was YES. [2023-10-12 17:31:32,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16516 conditions, 3861 events. 2721/3861 cut-off events. For 862/862 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 18060 event pairs, 354 based on Foata normal form. 0/2668 useless extension candidates. Maximal degree in co-relation 11940. Up to 2834 conditions per place. [2023-10-12 17:31:32,668 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 50 places, 1658 transitions, 15280 flow [2023-10-12 17:31:32,682 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 50 places, 1658 transitions, 15280 flow [2023-10-12 17:31:32,682 INFO L430 stractBuchiCegarLoop]: Abstraction has has 50 places, 1658 transitions, 15280 flow [2023-10-12 17:31:32,683 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:31:32,683 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 places, 1658 transitions, 15280 flow [2023-10-12 17:31:32,724 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:32,724 INFO L124 PetriNetUnfolderBase]: 261/405 cut-off events. [2023-10-12 17:31:32,724 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-10-12 17:31:32,724 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:32,724 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [130] L26-->thread1EXIT: Formula: (or (<= v_w_8 0) (not v_v_assert_15)) InVars {v_assert=v_v_assert_15, w=v_w_8} OutVars{v_assert=v_v_assert_15, w=v_w_8} AuxVars[] AssignedVars[] 172#[L80-1, thread1EXIT]true [116] L80-1-->L38: 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] 174#[L81, L38, thread1EXIT]true [119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 176#[L82, L38, thread1EXIT, L55]true [2023-10-12 17:31:32,724 INFO L750 eck$LassoCheckResult]: Loop: 176#[L82, L38, thread1EXIT, L55]true [105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[] 179#[L82, L38, L56, thread1EXIT]true [136] L56-->L55: Formula: (and (< v_front2_19 v_back2_20) (= (+ v_front2_19 1) v_front2_18) (= v_temp2_9 (select v_queue2_13 v_front2_19)) (= v_d2_17 (+ v_temp2_9 v_d2_18))) InVars {d2=v_d2_18, back2=v_back2_20, front2=v_front2_19, queue2=v_queue2_13} OutVars{d2=v_d2_17, back2=v_back2_20, temp2=v_temp2_9, front2=v_front2_18, queue2=v_queue2_13} AuxVars[] AssignedVars[d2, temp2, front2] 176#[L82, L38, thread1EXIT, L55]true [2023-10-12 17:31:32,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash 164187682, now seen corresponding path program 1 times [2023-10-12 17:31:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:32,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423782453] [2023-10-12 17:31:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:32,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:32,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:32,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:32,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:32,732 INFO L85 PathProgramCache]: Analyzing trace with hash 4352, now seen corresponding path program 1 times [2023-10-12 17:31:32,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:32,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258283853] [2023-10-12 17:31:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:32,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:32,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:32,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:32,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1129424159, now seen corresponding path program 1 times [2023-10-12 17:31:32,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:32,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289492685] [2023-10-12 17:31:32,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:32,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:32,752 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:32,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:32,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289492685] [2023-10-12 17:31:32,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289492685] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:31:32,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:31:32,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:31:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133296242] [2023-10-12 17:31:32,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:31:32,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:31:32,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:31:32,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 1658 transitions, 15280 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:32,772 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:32,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:33,333 INFO L124 PetriNetUnfolderBase]: 3876/5651 cut-off events. [2023-10-12 17:31:33,334 INFO L125 PetriNetUnfolderBase]: For 1486/1486 co-relation queries the response was YES. [2023-10-12 17:31:33,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29887 conditions, 5651 events. 3876/5651 cut-off events. For 1486/1486 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 29264 event pairs, 354 based on Foata normal form. 295/4184 useless extension candidates. Maximal degree in co-relation 21661. Up to 4757 conditions per place. [2023-10-12 17:31:33,362 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 398 selfloop transitions, 9 changer transitions 132/539 dead transitions. [2023-10-12 17:31:33,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 539 transitions, 5987 flow [2023-10-12 17:31:33,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 539 transitions, 5987 flow [2023-10-12 17:31:33,704 INFO L124 PetriNetUnfolderBase]: 3876/5651 cut-off events. [2023-10-12 17:31:33,705 INFO L125 PetriNetUnfolderBase]: For 1486/1486 co-relation queries the response was YES. [2023-10-12 17:31:33,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29887 conditions, 5651 events. 3876/5651 cut-off events. For 1486/1486 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 29269 event pairs, 354 based on Foata normal form. 0/3889 useless extension candidates. Maximal degree in co-relation 21661. Up to 4757 conditions per place. [2023-10-12 17:31:33,713 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 50 places, 539 transitions, 5987 flow [2023-10-12 17:31:33,718 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 50 places, 539 transitions, 5987 flow [2023-10-12 17:31:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:31:33,719 INFO L430 stractBuchiCegarLoop]: Abstraction has has 50 places, 539 transitions, 5987 flow [2023-10-12 17:31:33,719 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:31:33,719 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 places, 539 transitions, 5987 flow [2023-10-12 17:31:33,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:33,784 INFO L124 PetriNetUnfolderBase]: 801/1174 cut-off events. [2023-10-12 17:31:33,784 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2023-10-12 17:31:33,784 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:33,785 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 103#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 106#[L26, L39, L81]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 106#[L26, L39, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 103#[L26, L81, L38]true [2023-10-12 17:31:33,785 INFO L750 eck$LassoCheckResult]: Loop: 103#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 106#[L26, L39, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 103#[L26, L81, L38]true [2023-10-12 17:31:33,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:33,785 INFO L85 PathProgramCache]: Analyzing trace with hash 794418288, now seen corresponding path program 2 times [2023-10-12 17:31:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:33,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915951385] [2023-10-12 17:31:33,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:33,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:33,790 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:33,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:33,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:33,795 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 3 times [2023-10-12 17:31:33,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:33,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10395545] [2023-10-12 17:31:33,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:33,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:33,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:33,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:33,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:33,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1068200711, now seen corresponding path program 3 times [2023-10-12 17:31:33,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:33,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149759430] [2023-10-12 17:31:33,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:33,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:31:33,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:31:33,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149759430] [2023-10-12 17:31:33,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149759430] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:31:33,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625758956] [2023-10-12 17:31:33,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-10-12 17:31:33,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:31:33,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:33,842 INFO L229 MonitoredProcess]: Starting monitored process 14 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:33,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-10-12 17:31:33,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-10-12 17:31:33,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:31:33,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:31:33,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:31:33,898 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:31:33,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625758956] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:31:33,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:31:33,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:31:33,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333021356] [2023-10-12 17:31:33,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:31:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:31:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:31:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:31:33,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 539 transitions, 5987 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:33,926 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:31:33,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:31:34,703 INFO L124 PetriNetUnfolderBase]: 7613/11062 cut-off events. [2023-10-12 17:31:34,704 INFO L125 PetriNetUnfolderBase]: For 2750/2750 co-relation queries the response was YES. [2023-10-12 17:31:34,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69517 conditions, 11062 events. 7613/11062 cut-off events. For 2750/2750 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 63160 event pairs, 412 based on Foata normal form. 130/7744 useless extension candidates. Maximal degree in co-relation 50384. Up to 10168 conditions per place. [2023-10-12 17:31:34,754 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 707 selfloop transitions, 27 changer transitions 263/997 dead transitions. [2023-10-12 17:31:34,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 997 transitions, 13068 flow [2023-10-12 17:31:34,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 997 transitions, 13068 flow [2023-10-12 17:31:35,822 INFO L124 PetriNetUnfolderBase]: 7613/11062 cut-off events. [2023-10-12 17:31:35,822 INFO L125 PetriNetUnfolderBase]: For 2750/2750 co-relation queries the response was YES. [2023-10-12 17:31:35,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69517 conditions, 11062 events. 7613/11062 cut-off events. For 2750/2750 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 63107 event pairs, 412 based on Foata normal form. 0/7614 useless extension candidates. Maximal degree in co-relation 50384. Up to 10168 conditions per place. [2023-10-12 17:31:35,831 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 53 places, 997 transitions, 13068 flow [2023-10-12 17:31:35,841 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 53 places, 997 transitions, 13068 flow [2023-10-12 17:31:35,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:31:35,842 INFO L430 stractBuchiCegarLoop]: Abstraction has has 53 places, 997 transitions, 13068 flow [2023-10-12 17:31:35,842 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:31:35,842 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 53 places, 997 transitions, 13068 flow [2023-10-12 17:31:36,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:36,096 INFO L124 PetriNetUnfolderBase]: 1781/2556 cut-off events. [2023-10-12 17:31:36,096 INFO L125 PetriNetUnfolderBase]: For 517/517 co-relation queries the response was YES. [2023-10-12 17:31:36,096 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:36,097 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 103#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 106#[L26, L39, L81]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 106#[L26, L39, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 103#[L26, L81, L38]true [2023-10-12 17:31:36,097 INFO L750 eck$LassoCheckResult]: Loop: 103#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 106#[L26, L39, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 103#[L26, L81, L38]true [2023-10-12 17:31:36,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1118359976, now seen corresponding path program 4 times [2023-10-12 17:31:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134430057] [2023-10-12 17:31:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:36,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:36,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:36,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:36,107 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 4 times [2023-10-12 17:31:36,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:36,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792331484] [2023-10-12 17:31:36,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:36,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:36,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:36,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:36,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:36,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1002109727, now seen corresponding path program 5 times [2023-10-12 17:31:36,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:36,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625750927] [2023-10-12 17:31:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:36,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:36,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:36,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:36,315 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:31:36,315 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:31:36,315 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:31:36,315 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:31:36,315 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:31:36,315 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:36,315 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:31:36,315 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:31:36,315 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:31:36,315 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:31:36,316 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:31:36,317 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:36,371 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:36,375 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:36,378 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:36,380 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:36,382 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:36,384 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:36,512 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:31:36,512 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:31:36,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:36,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:36,514 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:31:36,516 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:31:36,519 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:36,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:36,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:36,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:36,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:36,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:36,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:36,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:36,554 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:31:36,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:36,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:36,555 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:31:36,564 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:36,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:36,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:36,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:36,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:36,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:36,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:36,577 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:31:36,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:31:36,592 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:31:36,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:36,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:36,594 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:31:36,596 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:31:36,597 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:36,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:31:36,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:31:36,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:31:36,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:31:36,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:31:36,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:31:36,617 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:31:36,624 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:31:36,625 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:31:36,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:31:36,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:31:36,639 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:31:36,645 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:31:36,660 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:31:36,662 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:31:36,662 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:31:36,662 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(front1, back1) = -1*front1 + 1*back1 Supporting invariants [] [2023-10-12 17:31:36,667 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:31:36,669 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:31:36,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:36,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:31:36,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:31:36,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:31:36,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:31:36,704 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:36,705 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:36,705 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:36,760 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 409 transitions. [2023-10-12 17:31:36,760 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:31:36,834 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:31:36,835 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:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:31:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2023-10-12 17:31:36,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:31:36,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:36,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:31:36,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:36,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:31:36,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:31:36,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 13754 transitions, 208012 flow [2023-10-12 17:31:37,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:31:55,306 INFO L124 PetriNetUnfolderBase]: 13903/19736 cut-off events. [2023-10-12 17:31:55,306 INFO L125 PetriNetUnfolderBase]: For 4780/4780 co-relation queries the response was YES. [2023-10-12 17:31:55,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143632 conditions, 19736 events. 13903/19736 cut-off events. For 4780/4780 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 117028 event pairs, 450 based on Foata normal form. 0/13023 useless extension candidates. Maximal degree in co-relation 102729. Up to 18842 conditions per place. [2023-10-12 17:31:55,321 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 65 places, 13754 transitions, 208012 flow [2023-10-12 17:31:55,507 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 65 places, 13754 transitions, 208012 flow [2023-10-12 17:31:55,508 INFO L430 stractBuchiCegarLoop]: Abstraction has has 65 places, 13754 transitions, 208012 flow [2023-10-12 17:31:55,508 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:31:55,508 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65 places, 13754 transitions, 208012 flow [2023-10-12 17:31:59,828 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:31:59,828 INFO L124 PetriNetUnfolderBase]: 2733/3852 cut-off events. [2023-10-12 17:31:59,828 INFO L125 PetriNetUnfolderBase]: For 777/777 co-relation queries the response was YES. [2023-10-12 17:31:59,828 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:31:59,829 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 103#[L26, L81, L38]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 103#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 106#[L26, L39, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 103#[L26, L81, L38]true [119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 306#[L26, L38, L82, L55]true [2023-10-12 17:31:59,829 INFO L750 eck$LassoCheckResult]: Loop: 306#[L26, L38, L82, L55]true [105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[] 309#[L26, L38, L82, L56]true [136] L56-->L55: Formula: (and (< v_front2_19 v_back2_20) (= (+ v_front2_19 1) v_front2_18) (= v_temp2_9 (select v_queue2_13 v_front2_19)) (= v_d2_17 (+ v_temp2_9 v_d2_18))) InVars {d2=v_d2_18, back2=v_back2_20, front2=v_front2_19, queue2=v_queue2_13} OutVars{d2=v_d2_17, back2=v_back2_20, temp2=v_temp2_9, front2=v_front2_18, queue2=v_queue2_13} AuxVars[] AssignedVars[d2, temp2, front2] 306#[L26, L38, L82, L55]true [2023-10-12 17:31:59,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:59,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1141597039, now seen corresponding path program 1 times [2023-10-12 17:31:59,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:59,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795897701] [2023-10-12 17:31:59,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:59,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:59,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:59,838 INFO L85 PathProgramCache]: Analyzing trace with hash 4352, now seen corresponding path program 2 times [2023-10-12 17:31:59,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:59,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756851997] [2023-10-12 17:31:59,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:31:59,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:31:59,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1858090608, now seen corresponding path program 1 times [2023-10-12 17:31:59,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:31:59,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629582935] [2023-10-12 17:31:59,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:31:59,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:31:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:31:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:31:59,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:32:00,011 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:32:00,011 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:32:00,011 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:32:00,011 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:32:00,011 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:32:00,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:00,012 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:32:00,012 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:32:00,012 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:32:00,012 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:32:00,012 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:32:00,014 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:00,016 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:00,017 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:00,021 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:00,023 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:00,075 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:00,078 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:00,080 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:00,082 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:00,224 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:32:00,224 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:32:00,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:00,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:00,229 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:00,231 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:00,259 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:00,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:00,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:00,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:00,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:00,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:00,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:00,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:00,301 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:00,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:00,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:00,302 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:00,305 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:00,306 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:00,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:00,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:00,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:00,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:00,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:00,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:00,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:00,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:00,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:00,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:00,337 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:00,343 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:00,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:00,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:00,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:00,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:00,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:00,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:00,356 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:00,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:00,375 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:00,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:00,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:00,376 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:32:00,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:32:00,380 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:00,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:00,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:00,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:00,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:00,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:00,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:00,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:00,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:00,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:00,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:00,548 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:32:00,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:32:00,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:00,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:00,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:00,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:00,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:00,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:00,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:00,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:00,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:00,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:00,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:00,585 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:32:00,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:32:00,588 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:00,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:00,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:00,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:00,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:00,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:00,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:00,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:32:00,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:00,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:00,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:00,603 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:32:00,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:32:00,656 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:00,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:32:00,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:32:00,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:32:00,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:32:00,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:32:00,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:32:00,684 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:32:00,700 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:32:00,700 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:32:00,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:32:00,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:32:00,702 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:32:00,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:32:00,705 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:32:00,726 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:32:00,726 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:32:00,726 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back2, front2) = 1*back2 - 1*front2 Supporting invariants [] [2023-10-12 17:32:00,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:32:00,735 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:32:00,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:32:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:00,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:32:00,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:32:00,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:32:00,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:32:00,766 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:32:00,766 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:32:00,766 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) 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:32:00,818 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) 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) Result 6 states and 411 transitions. [2023-10-12 17:32:00,819 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:32:02,603 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:32:02,604 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:02,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) 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:32:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2023-10-12 17:32:02,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:32:02,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:02,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:32:02,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:02,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:32:02,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:32:02,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 189100 transitions, 3241984 flow [2023-10-12 17:32:09,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 Received shutdown request... [2023-10-12 17:35:09,045 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:35:09,045 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:09,069 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:09,069 INFO L430 stractBuchiCegarLoop]: Abstraction has has 77 places, 189100 transitions, 3241984 flow [2023-10-12 17:35:09,069 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:35:09,069 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 places, 189100 transitions, 3241984 flow [2023-10-12 17:35:09,184 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:35:09,188 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:35:09 BoogieIcfgContainer [2023-10-12 17:35:09,188 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:35:09,188 INFO L158 Benchmark]: Toolchain (without parser) took 219523.06ms. Allocated memory was 221.2MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 178.3MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2023-10-12 17:35:09,189 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 221.2MB. Free memory is still 179.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:35:09,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.42ms. Allocated memory is still 221.2MB. Free memory was 178.1MB in the beginning and 176.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:35:09,189 INFO L158 Benchmark]: Boogie Preprocessor took 12.97ms. Allocated memory is still 221.2MB. Free memory was 176.7MB in the beginning and 175.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:35:09,189 INFO L158 Benchmark]: RCFGBuilder took 191.70ms. Allocated memory is still 221.2MB. Free memory was 175.5MB in the beginning and 164.3MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:35:09,189 INFO L158 Benchmark]: BuchiAutomizer took 219296.90ms. Allocated memory was 221.2MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 164.3MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2023-10-12 17:35:09,190 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.17ms. Allocated memory is still 221.2MB. Free memory is still 179.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.42ms. Allocated memory is still 221.2MB. Free memory was 178.1MB in the beginning and 176.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.97ms. Allocated memory is still 221.2MB. Free memory was 176.7MB in the beginning and 175.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 191.70ms. Allocated memory is still 221.2MB. Free memory was 175.5MB in the beginning and 164.3MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 219296.90ms. Allocated memory was 221.2MB in the beginning and 5.5GB in the end (delta: 5.3GB). Free memory was 164.3MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 2.5GB. 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, 4 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function w and consists of 4 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 4 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 4 locations. One deterministic module has affine ranking function back2 + -1 * front2 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 3241984 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 219.2s and 8 iterations. TraceHistogramMax:0. Analysis of lassos took 2.9s. Construction of modules took 0.2s. Büchi inclusion checks took 5.2s. 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 372 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 449 IncrementalHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 247 mSDtfsCounter, 449 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp62 ukn97 mio100 lsp65 div100 bol100 ite100 ukn100 eq206 hnf88 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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, 46 PlacesBefore, 30 PlacesAfterwards, 36 TransitionsBefore, 20 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 3 FixpointIterations, 8 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 542 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 332, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 231, independent: 215, independent conditional: 0, independent unconditional: 215, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 231, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 332, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 231, unknown conditional: 0, unknown unconditional: 231] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, 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:09,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 Completed graceful shutdown