/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-bad/buffer-mult-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:25:18,461 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:25:18,537 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:25:18,564 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:25:18,564 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:25:18,565 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:25:18,566 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:25:18,566 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:25:18,567 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:25:18,570 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:25:18,570 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:25:18,570 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:25:18,571 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:25:18,572 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:25:18,572 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:25:18,572 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:25:18,572 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:25:18,573 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:25:18,573 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:25:18,573 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:25:18,573 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:25:18,574 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:25:18,574 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:25:18,574 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:25:18,574 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:25:18,574 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:25:18,574 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:25:18,575 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:25:18,575 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:25:18,575 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:25:18,576 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:25:18,576 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:25:18,576 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:25:18,578 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:25:18,578 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:25:18,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:25:18,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:25:18,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:25:18,832 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:25:18,833 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:25:18,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl [2023-10-12 17:25:18,835 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl' [2023-10-12 17:25:18,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:25:18,871 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:25:18,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:25:18,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:25:18,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:25:18,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:18" (1/1) ... [2023-10-12 17:25:18,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:18" (1/1) ... [2023-10-12 17:25:18,901 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:25:18,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:25:18,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:25:18,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:25:18,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:25:18,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:18" (1/1) ... [2023-10-12 17:25:18,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:18" (1/1) ... [2023-10-12 17:25:18,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:18" (1/1) ... [2023-10-12 17:25:18,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:18" (1/1) ... [2023-10-12 17:25:18,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:18" (1/1) ... [2023-10-12 17:25:18,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:18" (1/1) ... [2023-10-12 17:25:18,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:18" (1/1) ... [2023-10-12 17:25:18,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:18" (1/1) ... [2023-10-12 17:25:18,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:25:18,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:25:18,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:25:18,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:25:18,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:18" (1/1) ... [2023-10-12 17:25:18,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:18,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:18,958 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:25:18,986 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:25:19,003 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:25:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:25:19,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:25:19,004 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:25:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:25:19,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:25:19,004 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:25:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:25:19,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:25:19,005 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:25:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:25:19,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:25:19,005 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:25:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:25:19,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:25:19,006 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:25:19,047 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:25:19,049 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:25:19,160 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:25:19,188 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:25:19,188 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:25:19,190 INFO L201 PluginConnector]: Adding new model buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:25:19 BoogieIcfgContainer [2023-10-12 17:25:19,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:25:19,191 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:25:19,191 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:25:19,209 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:25:19,209 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:25:19,209 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:18" (1/2) ... [2023-10-12 17:25:19,210 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bf97193 and model type buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:25:19, skipping insertion in model container [2023-10-12 17:25:19,210 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:25:19,211 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:25:19" (2/2) ... [2023-10-12 17:25:19,212 INFO L332 chiAutomizerObserver]: Analyzing ICFG buffer-mult-alt.wvr.bpl [2023-10-12 17:25:19,268 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:25:19,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:25:19,311 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:25:19,312 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:25:19,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:25:19,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:25:19,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2023-10-12 17:25:19,324 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:25:19,336 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:25:19,338 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:25:19,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 86 flow [2023-10-12 17:25:19,347 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:25:19,347 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:25:19,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:25:19,350 INFO L119 LiptonReduction]: Number of co-enabled transitions 350 [2023-10-12 17:25:19,549 INFO L134 LiptonReduction]: Checked pairs total: 553 [2023-10-12 17:25:19,549 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:25:19,561 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:25:19,561 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:25:19,561 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:25:19,561 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:25:19,561 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:25:19,561 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:25:19,561 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:25:19,562 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:25:19,562 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:25:19,566 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:19,567 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:25:19,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:25:19,567 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:19,569 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:25:19,569 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:25:19,571 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:19,571 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:25:19,571 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:25:19,571 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:19,575 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [2023-10-12 17:25:19,576 INFO L750 eck$LassoCheckResult]: Loop: 52#[L74-1, L25]true [126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back] 55#[L74-1, L26-1]true [90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i] 52#[L74-1, L25]true [2023-10-12 17:25:19,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:19,580 INFO L85 PathProgramCache]: Analyzing trace with hash 3454, now seen corresponding path program 1 times [2023-10-12 17:25:19,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:19,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511911718] [2023-10-12 17:25:19,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:19,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:19,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:19,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:19,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash 4957, now seen corresponding path program 1 times [2023-10-12 17:25:19,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:19,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269399211] [2023-10-12 17:25:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:19,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:19,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:19,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:19,745 INFO L85 PathProgramCache]: Analyzing trace with hash 3323290, now seen corresponding path program 1 times [2023-10-12 17:25:19,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:19,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377421894] [2023-10-12 17:25:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:19,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:19,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:19,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:19,919 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:19,920 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:19,921 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:19,921 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:19,921 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:19,921 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:19,921 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:19,921 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:19,921 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:25:19,921 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:19,921 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:19,937 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:25:19,951 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:25:19,967 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:25:19,971 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:25:19,973 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:19,977 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:25:20,069 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:20,072 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:20,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:20,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:20,081 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:25:20,085 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:25:20,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:25:20,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:20,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:20,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:20,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:20,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:20,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:20,131 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:20,163 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:25:20,163 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:25:20,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:20,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:20,168 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:25:20,174 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:20,182 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:25:20,198 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:25:20,199 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:20,200 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:25:20,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:25:20,212 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:25:20,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:20,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:25:20,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:20,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:20,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:20,290 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:25:20,321 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:25:20,322 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:20,514 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 370 transitions. [2023-10-12 17:25:20,516 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:20,525 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:25:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-10-12 17:25:20,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:25:20,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:20,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:25:20,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:20,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:25:20,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:20,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:20,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:25:20,773 INFO L124 PetriNetUnfolderBase]: 1684/2258 cut-off events. [2023-10-12 17:25:20,773 INFO L125 PetriNetUnfolderBase]: For 377/377 co-relation queries the response was YES. [2023-10-12 17:25:20,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4958 conditions, 2258 events. 1684/2258 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 8623 event pairs, 265 based on Foata normal form. 0/1441 useless extension candidates. Maximal degree in co-relation 3866. Up to 568 conditions per place. [2023-10-12 17:25:20,778 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:20,784 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:20,786 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:20,786 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:25:20,786 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 places, 356 transitions, 1808 flow [2023-10-12 17:25:20,791 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:20,791 INFO L124 PetriNetUnfolderBase]: 18/35 cut-off events. [2023-10-12 17:25:20,791 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:25:20,791 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:20,791 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [109] L74-1-->L37: 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] 109#[L75, L37, L25]true [2023-10-12 17:25:20,792 INFO L750 eck$LassoCheckResult]: Loop: 109#[L75, L37, L25]true [122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back] 112#[L75, L38-1, L25]true [95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j] 109#[L75, L37, L25]true [2023-10-12 17:25:20,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash 107183, now seen corresponding path program 1 times [2023-10-12 17:25:20,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:20,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277273990] [2023-10-12 17:25:20,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:20,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:20,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:20,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:20,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash 4838, now seen corresponding path program 1 times [2023-10-12 17:25:20,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:20,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960477540] [2023-10-12 17:25:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:20,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:20,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:20,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:20,814 INFO L85 PathProgramCache]: Analyzing trace with hash 103006740, now seen corresponding path program 1 times [2023-10-12 17:25:20,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:20,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347518977] [2023-10-12 17:25:20,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:20,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:20,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:20,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:20,912 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:20,912 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:20,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:20,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:20,912 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:20,912 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:20,912 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:20,912 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:20,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:25:20,913 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:20,913 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:20,914 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:25:20,924 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:25:20,927 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:20,929 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:25:20,938 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:25:20,940 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:25:20,943 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:25:20,945 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:25:21,036 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:21,036 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:21,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:21,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:21,038 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:25:21,041 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:25:21,044 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:25:21,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:21,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:21,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:21,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:21,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:21,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:21,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:21,093 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:25:21,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:21,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:21,095 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:25:21,099 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:25:21,102 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:25:21,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:21,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:21,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:21,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:21,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:21,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:21,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:21,141 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:25:21,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:21,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:21,143 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:25:21,155 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:25:21,156 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:25:21,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:21,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:21,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:21,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:21,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:21,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:21,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:21,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:21,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:21,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:21,298 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:25:21,300 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:25:21,303 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:25:21,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:21,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:21,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:21,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:21,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:21,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:21,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:21,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:21,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:21,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:21,342 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:25:21,344 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:25:21,346 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:25:21,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:21,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:21,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:21,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:21,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:21,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:21,391 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:21,403 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:25:21,403 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:25:21,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:21,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:21,405 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:25:21,408 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:25:21,433 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:21,451 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:25:21,451 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:21,451 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:25:21,459 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:25:21,460 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:25:21,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:21,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:25:21,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:21,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:21,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:21,522 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:25:21,522 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:25:21,522 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:25:21,661 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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) Result 7 states and 370 transitions. [2023-10-12 17:25:21,662 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:21,713 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:21,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:25:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:25:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-10-12 17:25:21,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:25:21,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:21,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:25:21,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:21,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:25:21,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:21,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:21,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:25:22,787 INFO L124 PetriNetUnfolderBase]: 5333/7066 cut-off events. [2023-10-12 17:25:22,787 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2023-10-12 17:25:22,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22518 conditions, 7066 events. 5333/7066 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 30970 event pairs, 308 based on Foata normal form. 0/4051 useless extension candidates. Maximal degree in co-relation 17407. Up to 1825 conditions per place. [2023-10-12 17:25:22,798 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:22,877 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:22,877 INFO L430 stractBuchiCegarLoop]: Abstraction has has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:22,878 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:25:22,878 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 places, 5540 transitions, 39384 flow [2023-10-12 17:25:22,963 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:22,964 INFO L124 PetriNetUnfolderBase]: 217/321 cut-off events. [2023-10-12 17:25:22,964 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-10-12 17:25:22,964 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:22,966 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [109] L74-1-->L37: 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] 109#[L75, L37, L25]true [112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 164#[L50-1, L37, L76, L25]true [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 166#[L37, L50, L76, L25]true [125] L25-->thread1EXIT: Formula: (<= v_N_20 v_i_26) InVars {N=v_N_20, i=v_i_26} OutVars{N=v_N_20, i=v_i_26} AuxVars[] AssignedVars[] 168#[L37, L50, thread1EXIT, L76]true [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 170#[L50-1, L37, thread1EXIT, L76]true [2023-10-12 17:25:22,966 INFO L750 eck$LassoCheckResult]: Loop: 170#[L50-1, L37, thread1EXIT, L76]true [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 168#[L37, L50, thread1EXIT, L76]true [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 170#[L50-1, L37, thread1EXIT, L76]true [2023-10-12 17:25:22,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:22,967 INFO L85 PathProgramCache]: Analyzing trace with hash 204937318, now seen corresponding path program 1 times [2023-10-12 17:25:22,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:22,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907065837] [2023-10-12 17:25:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:22,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:23,048 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:25:23,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:23,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907065837] [2023-10-12 17:25:23,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907065837] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:23,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:23,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:25:23,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179577599] [2023-10-12 17:25:23,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:23,052 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:25:23,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2023-10-12 17:25:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:23,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313580131] [2023-10-12 17:25:23,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:23,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:23,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:23,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:23,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:23,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:25:23,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:25:23,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 5540 transitions, 39384 flow. Second operand has 4 states, 4 states have (on average 1.75) 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:25:23,093 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:23,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:24,791 INFO L124 PetriNetUnfolderBase]: 5439/7191 cut-off events. [2023-10-12 17:25:24,792 INFO L125 PetriNetUnfolderBase]: For 1116/1116 co-relation queries the response was YES. [2023-10-12 17:25:24,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30091 conditions, 7191 events. 5439/7191 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 30555 event pairs, 68 based on Foata normal form. 74/4290 useless extension candidates. Maximal degree in co-relation 25659. Up to 4947 conditions per place. [2023-10-12 17:25:24,838 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 633 selfloop transitions, 64 changer transitions 157/854 dead transitions. [2023-10-12 17:25:24,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 854 transitions, 7450 flow [2023-10-12 17:25:24,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 854 transitions, 7450 flow [2023-10-12 17:25:25,371 INFO L124 PetriNetUnfolderBase]: 5439/7191 cut-off events. [2023-10-12 17:25:25,371 INFO L125 PetriNetUnfolderBase]: For 1116/1116 co-relation queries the response was YES. [2023-10-12 17:25:25,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30091 conditions, 7191 events. 5439/7191 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 30561 event pairs, 68 based on Foata normal form. 0/4216 useless extension candidates. Maximal degree in co-relation 25659. Up to 4947 conditions per place. [2023-10-12 17:25:25,381 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 58 places, 854 transitions, 7450 flow [2023-10-12 17:25:25,391 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 58 places, 854 transitions, 7450 flow [2023-10-12 17:25:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:25:25,392 INFO L430 stractBuchiCegarLoop]: Abstraction has has 58 places, 854 transitions, 7450 flow [2023-10-12 17:25:25,392 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:25:25,392 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 58 places, 854 transitions, 7450 flow [2023-10-12 17:25:25,426 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:25,427 INFO L124 PetriNetUnfolderBase]: 244/362 cut-off events. [2023-10-12 17:25:25,427 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-10-12 17:25:25,427 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:25,428 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [109] L74-1-->L37: 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] 109#[L75, L37, L25]true [126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back] 188#[L75, L37, L26-1]true [112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 190#[L50-1, L37, L26-1, L76]true [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 192#[L37, L26-1, L50, L76]true [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 190#[L50-1, L37, L26-1, L76]true [2023-10-12 17:25:25,428 INFO L750 eck$LassoCheckResult]: Loop: 190#[L50-1, L37, L26-1, L76]true [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 192#[L37, L26-1, L50, L76]true [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 190#[L50-1, L37, L26-1, L76]true [2023-10-12 17:25:25,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash 205367939, now seen corresponding path program 1 times [2023-10-12 17:25:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:25,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778812387] [2023-10-12 17:25:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:25,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:25,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:25,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 2 times [2023-10-12 17:25:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:25,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870501909] [2023-10-12 17:25:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:25,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:25,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:25,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:25,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:25,452 INFO L85 PathProgramCache]: Analyzing trace with hash -209903131, now seen corresponding path program 2 times [2023-10-12 17:25:25,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:25,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400751631] [2023-10-12 17:25:25,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:25,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:25,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400751631] [2023-10-12 17:25:25,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400751631] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:25,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:25,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:25:25,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939242873] [2023-10-12 17:25:25,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:25,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:25:25,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:25:25,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 854 transitions, 7450 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:25,541 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:25,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:27,208 INFO L124 PetriNetUnfolderBase]: 15003/20065 cut-off events. [2023-10-12 17:25:27,208 INFO L125 PetriNetUnfolderBase]: For 3811/3811 co-relation queries the response was YES. [2023-10-12 17:25:27,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104002 conditions, 20065 events. 15003/20065 cut-off events. For 3811/3811 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 101465 event pairs, 238 based on Foata normal form. 492/12009 useless extension candidates. Maximal degree in co-relation 79769. Up to 14977 conditions per place. [2023-10-12 17:25:27,344 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 1580 selfloop transitions, 221 changer transitions 475/2276 dead transitions. [2023-10-12 17:25:27,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 2276 transitions, 24419 flow [2023-10-12 17:25:27,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 2276 transitions, 24419 flow [2023-10-12 17:25:29,755 INFO L124 PetriNetUnfolderBase]: 15003/20065 cut-off events. [2023-10-12 17:25:29,756 INFO L125 PetriNetUnfolderBase]: For 3811/3811 co-relation queries the response was YES. [2023-10-12 17:25:29,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104002 conditions, 20065 events. 15003/20065 cut-off events. For 3811/3811 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 101430 event pairs, 238 based on Foata normal form. 0/11517 useless extension candidates. Maximal degree in co-relation 79769. Up to 14977 conditions per place. [2023-10-12 17:25:29,775 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 62 places, 2276 transitions, 24419 flow [2023-10-12 17:25:29,802 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 62 places, 2276 transitions, 24419 flow [2023-10-12 17:25:29,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:25:29,803 INFO L430 stractBuchiCegarLoop]: Abstraction has has 62 places, 2276 transitions, 24419 flow [2023-10-12 17:25:29,803 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:25:29,803 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 62 places, 2276 transitions, 24419 flow [2023-10-12 17:25:29,943 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:29,944 INFO L124 PetriNetUnfolderBase]: 677/953 cut-off events. [2023-10-12 17:25:29,944 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2023-10-12 17:25:29,944 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:29,945 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back] 55#[L74-1, L26-1]true [109] L74-1-->L37: 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] 188#[L75, L37, L26-1]true [112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 190#[L50-1, L37, L26-1, L76]true [115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 214#[L50-1, L37, L26-1, L62-1, L77]true [2023-10-12 17:25:29,945 INFO L750 eck$LassoCheckResult]: Loop: 214#[L50-1, L37, L26-1, L62-1, L77]true [101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 217#[L62, L50-1, L37, L26-1, L77]true [103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front] 214#[L50-1, L37, L26-1, L62-1, L77]true [2023-10-12 17:25:29,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1101263760, now seen corresponding path program 1 times [2023-10-12 17:25:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:29,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57167608] [2023-10-12 17:25:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:29,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:29,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:29,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:29,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:29,967 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2023-10-12 17:25:29,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:29,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685219132] [2023-10-12 17:25:29,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:29,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:29,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:29,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:29,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1752515310, now seen corresponding path program 1 times [2023-10-12 17:25:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:29,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680188965] [2023-10-12 17:25:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:29,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:30,017 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:25:30,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:30,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680188965] [2023-10-12 17:25:30,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680188965] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:30,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:30,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:25:30,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335337853] [2023-10-12 17:25:30,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:30,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:30,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:25:30,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:25:30,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 2276 transitions, 24419 flow. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:30,043 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:30,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:33,870 INFO L124 PetriNetUnfolderBase]: 20717/28043 cut-off events. [2023-10-12 17:25:33,871 INFO L125 PetriNetUnfolderBase]: For 5290/5290 co-relation queries the response was YES. [2023-10-12 17:25:33,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173580 conditions, 28043 events. 20717/28043 cut-off events. For 5290/5290 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 151855 event pairs, 27 based on Foata normal form. 588/16718 useless extension candidates. Maximal degree in co-relation 154966. Up to 21072 conditions per place. [2023-10-12 17:25:34,032 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 2365 selfloop transitions, 96 changer transitions 612/3073 dead transitions. [2023-10-12 17:25:34,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 3073 transitions, 39204 flow [2023-10-12 17:25:34,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 3073 transitions, 39204 flow [2023-10-12 17:25:38,790 INFO L124 PetriNetUnfolderBase]: 20717/28043 cut-off events. [2023-10-12 17:25:38,790 INFO L125 PetriNetUnfolderBase]: For 5290/5290 co-relation queries the response was YES. [2023-10-12 17:25:38,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173580 conditions, 28043 events. 20717/28043 cut-off events. For 5290/5290 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 151895 event pairs, 27 based on Foata normal form. 0/16130 useless extension candidates. Maximal degree in co-relation 154966. Up to 21072 conditions per place. [2023-10-12 17:25:38,825 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 64 places, 3073 transitions, 39204 flow [2023-10-12 17:25:38,861 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 64 places, 3073 transitions, 39204 flow [2023-10-12 17:25:38,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:25:38,862 INFO L430 stractBuchiCegarLoop]: Abstraction has has 64 places, 3073 transitions, 39204 flow [2023-10-12 17:25:38,862 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:25:38,862 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 64 places, 3073 transitions, 39204 flow [2023-10-12 17:25:39,089 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:39,090 INFO L124 PetriNetUnfolderBase]: 801/1139 cut-off events. [2023-10-12 17:25:39,090 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2023-10-12 17:25:39,090 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:39,091 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [109] L74-1-->L37: 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] 109#[L75, L37, L25]true [112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 164#[L50-1, L37, L76, L25]true [115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 233#[L50-1, L37, L62-1, L77, L25]true [122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back] 235#[L38-1, L50-1, L62-1, L77, L25]true [2023-10-12 17:25:39,091 INFO L750 eck$LassoCheckResult]: Loop: 235#[L38-1, L50-1, L62-1, L77, L25]true [101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 238#[L62, L38-1, L50-1, L77, L25]true [103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front] 235#[L38-1, L50-1, L62-1, L77, L25]true [2023-10-12 17:25:39,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:39,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1101767224, now seen corresponding path program 1 times [2023-10-12 17:25:39,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:39,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924159746] [2023-10-12 17:25:39,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:39,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:39,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:39,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:39,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:39,122 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 2 times [2023-10-12 17:25:39,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:39,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460130682] [2023-10-12 17:25:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:39,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:39,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:39,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:39,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2058623082, now seen corresponding path program 1 times [2023-10-12 17:25:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:39,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378805214] [2023-10-12 17:25:39,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:39,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:39,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:39,367 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:39,367 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:39,367 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:39,367 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:39,367 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:39,367 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:39,367 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:39,367 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:39,367 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:25:39,367 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:39,368 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:39,369 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:25:39,372 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:25:39,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:25:39,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:25:39,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:25:39,383 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:25:39,385 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:25:39,388 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:25:39,391 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:25:39,393 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:25:39,395 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:25:39,398 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:25:39,400 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:25:39,402 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:25:39,406 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:25:39,574 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:39,574 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:39,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:39,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:39,575 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:25:39,578 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:25:39,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:25:39,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:39,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:39,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:39,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:39,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:39,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:39,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:39,689 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:25:39,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:39,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:39,690 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:25:39,699 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:25:39,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:39,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:39,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:39,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:39,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:39,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:39,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:39,724 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:25:39,732 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:25:39,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:39,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:39,734 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:25:39,738 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:25:39,739 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:25:39,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:39,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:39,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:39,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:39,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:39,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:39,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:39,776 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:25:39,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:39,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:39,779 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:25:39,787 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:25:39,787 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:25:39,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:39,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:39,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:39,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:39,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:39,798 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:39,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:39,819 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:25:39,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:39,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:39,821 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:39,832 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:25:39,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:39,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:39,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:39,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:39,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:39,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:39,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:25:39,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:39,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:39,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:39,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:39,869 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:25:39,873 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:25:39,875 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:25:39,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:39,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:39,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:39,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:39,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:39,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:39,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:39,909 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:25:39,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:39,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:39,911 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:25:39,920 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:25:39,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:39,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:39,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:39,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:39,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:39,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:39,932 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:25:39,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:39,951 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:25:39,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:39,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:39,953 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:25:39,958 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:25:39,960 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:25:39,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:39,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:39,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:39,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:39,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:39,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:39,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:39,997 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:25:39,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:39,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:39,998 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:25:40,003 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:25:40,005 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:25:40,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:40,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:40,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:40,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:40,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:40,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:40,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:40,037 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:25:40,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:40,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:40,039 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:25:40,041 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:25:40,043 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:25:40,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:40,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:40,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:40,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:40,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:40,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:40,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:40,083 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:25:40,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:40,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:40,085 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:25:40,094 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:25:40,094 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:25:40,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:40,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:40,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:40,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:40,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:40,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:40,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:40,125 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:25:40,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:40,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:40,126 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:25:40,129 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:25:40,130 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:25:40,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:40,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:40,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:40,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:40,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:40,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:40,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:40,154 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:25:40,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:40,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:40,156 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:25:40,158 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:25:40,159 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:25:40,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:40,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:40,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:40,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:40,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:40,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:40,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:40,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-10-12 17:25:40,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:40,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:40,187 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:25:40,188 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:25:40,190 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:25:40,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:40,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:40,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:40,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:40,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:40,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:40,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:40,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-10-12 17:25:40,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:40,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:40,219 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:25:40,223 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:25:40,224 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:25:40,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:40,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:40,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:40,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:40,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:40,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:40,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:40,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-10-12 17:25:40,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:40,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:40,251 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:25:40,261 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:25:40,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:40,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:40,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:40,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:40,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:40,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:40,279 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:25:40,289 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:40,297 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:25:40,297 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:25:40,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:40,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:40,301 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:25:40,309 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:40,318 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:25:40,341 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:25:40,341 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:40,342 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2023-10-12 17:25:40,348 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:25:40,349 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:25:40,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:40,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:25:40,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:40,383 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:40,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:40,385 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:25:40,386 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:25:40,386 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:25:40,439 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 324 transitions. [2023-10-12 17:25:40,439 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:40,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:40,910 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:40,911 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:25:40,911 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:25:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:25:40,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:25:40,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:40,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:25:40,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:40,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:25:40,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:40,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 41226 transitions, 609756 flow Received shutdown request... [2023-10-12 17:29:56,146 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:29:56,234 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:29:56,235 INFO L430 stractBuchiCegarLoop]: Abstraction has has 76 places, 41226 transitions, 609756 flow [2023-10-12 17:29:56,235 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:29:56,235 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 places, 41226 transitions, 609756 flow [2023-10-12 17:29:56,266 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:29:56,270 INFO L201 PluginConnector]: Adding new model buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:29:56 BoogieIcfgContainer [2023-10-12 17:29:56,270 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:29:56,270 INFO L158 Benchmark]: Toolchain (without parser) took 277399.37ms. Allocated memory was 191.9MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 143.5MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2023-10-12 17:29:56,270 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 191.9MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:29:56,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.96ms. Allocated memory is still 191.9MB. Free memory was 143.3MB in the beginning and 141.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:29:56,271 INFO L158 Benchmark]: Boogie Preprocessor took 27.33ms. Allocated memory is still 191.9MB. Free memory was 141.8MB in the beginning and 140.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:29:56,271 INFO L158 Benchmark]: RCFGBuilder took 259.17ms. Allocated memory is still 191.9MB. Free memory was 140.6MB in the beginning and 129.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:29:56,271 INFO L158 Benchmark]: BuchiAutomizer took 277078.79ms. Allocated memory was 191.9MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 129.4MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2023-10-12 17:29:56,272 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19ms. Allocated memory is still 191.9MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.96ms. Allocated memory is still 191.9MB. Free memory was 143.3MB in the beginning and 141.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.33ms. Allocated memory is still 191.9MB. Free memory was 141.8MB in the beginning and 140.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 259.17ms. Allocated memory is still 191.9MB. Free memory was 140.6MB in the beginning and 129.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 277078.79ms. Allocated memory was 191.9MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 129.4MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 5 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 609756 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 276.9s and 7 iterations. TraceHistogramMax:0. Analysis of lassos took 2.9s. Construction of modules took 0.3s. Büchi inclusion checks took 16.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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 443 mSDsluCounter, 351 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 488 IncrementalHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 193 mSDtfsCounter, 488 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital61 mio100 ax100 hnf100 lsp40 ukn97 mio100 lsp84 div100 bol100 ite100 ukn100 eq168 hnf92 smp100 dnf100 smp100 tf100 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 126ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - 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.2s, 40 PlacesBefore, 32 PlacesAfterwards, 31 TransitionsBefore, 23 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 553 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 410, independent: 386, independent conditional: 0, independent unconditional: 386, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 223, independent: 214, independent conditional: 0, independent unconditional: 214, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 223, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 410, independent: 172, independent conditional: 0, independent unconditional: 172, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 223, unknown conditional: 0, unknown unconditional: 223] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown