/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 RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:42:15,331 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:42:15,410 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:42:15,448 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:42:15,448 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:42:15,449 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:42:15,450 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:42:15,450 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:42:15,451 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:42:15,454 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:42:15,455 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:42:15,455 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:42:15,455 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:42:15,456 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:42:15,457 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:42:15,457 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:42:15,457 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:42:15,457 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:42:15,457 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:42:15,458 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:42:15,458 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:42:15,459 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:42:15,460 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:42:15,460 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:42:15,460 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:42:15,460 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:42:15,460 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:42:15,461 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:42:15,461 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:42:15,461 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:42:15,462 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:42:15,462 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:42:15,462 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:42:15,464 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:42:15,464 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 -> RABIN_PETRI_NET [2023-10-12 17:42:15,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:42:15,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:42:15,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:42:15,693 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:42:15,694 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:42:15,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl [2023-10-12 17:42:15,695 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl' [2023-10-12 17:42:15,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:42:15,740 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:42:15,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:15,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:42:15,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:42:15,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,767 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:42:15,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:15,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:42:15,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:42:15,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:42:15,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:42:15,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:42:15,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:42:15,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:42:15,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/1) ... [2023-10-12 17:42:15,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:15,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:15,833 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:42:15,855 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:42:15,884 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:42:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:42:15,884 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:42:15,884 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:42:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:42:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:42:15,885 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:42:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:42:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:42:15,885 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:42:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:42:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:42:15,886 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:42:15,935 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:42:15,937 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:42:16,037 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:42:16,060 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:42:16,060 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:42:16,067 INFO L201 PluginConnector]: Adding new model queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:16 BoogieIcfgContainer [2023-10-12 17:42:16,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:42:16,068 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:42:16,068 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:42:16,071 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:42:16,072 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:16,072 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:15" (1/2) ... [2023-10-12 17:42:16,078 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b928829 and model type queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:42:16, skipping insertion in model container [2023-10-12 17:42:16,079 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:16,079 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:16" (2/2) ... [2023-10-12 17:42:16,080 INFO L332 chiAutomizerObserver]: Analyzing ICFG queue-add-3.wvr.bpl [2023-10-12 17:42:16,147 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:42:16,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 106 flow [2023-10-12 17:42:16,192 INFO L124 PetriNetUnfolderBase]: 3/35 cut-off events. [2023-10-12 17:42:16,192 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:42:16,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-10-12 17:42:16,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 41 transitions, 106 flow [2023-10-12 17:42:16,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 35 transitions, 88 flow [2023-10-12 17:42:16,204 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:42:16,216 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 88 flow [2023-10-12 17:42:16,219 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 88 flow [2023-10-12 17:42:16,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 88 flow [2023-10-12 17:42:16,228 INFO L124 PetriNetUnfolderBase]: 3/35 cut-off events. [2023-10-12 17:42:16,228 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:42:16,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-10-12 17:42:16,230 INFO L119 LiptonReduction]: Number of co-enabled transitions 478 [2023-10-12 17:42:16,924 INFO L134 LiptonReduction]: Checked pairs total: 397 [2023-10-12 17:42:16,925 INFO L136 LiptonReduction]: Total number of compositions: 18 [2023-10-12 17:42:16,939 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:42:16,940 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:42:16,940 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:42:16,940 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:42:16,940 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:42:16,940 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:42:16,940 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:42:16,940 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:42:16,941 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:42:16,945 ERROR L47 etriNetUnfolderRabin]: [1:1A:[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[][6], 2:2A:[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][4], 4:3A:[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][7]][5:4A:[145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back][13]] [2023-10-12 17:42:16,947 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:16,947 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:42:16,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:16,948 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:16,955 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:42:16,956 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:42:16,958 ERROR L47 etriNetUnfolderRabin]: [1:1A:[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[][6], 2:2A:[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][4], 4:3A:[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][7]][5:4A:[145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back][13]] [2023-10-12 17:42:16,959 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:16,960 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:42:16,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:16,960 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:16,964 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 55#[L81-1, L28-1]true [2023-10-12 17:42:16,964 INFO L750 eck$LassoCheckResult]: Loop: 55#[L81-1, L28-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 55#[L81-1, L28-1]true [2023-10-12 17:42:16,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,969 INFO L85 PathProgramCache]: Analyzing trace with hash 123135, now seen corresponding path program 1 times [2023-10-12 17:42:16,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:16,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733299767] [2023-10-12 17:42:16,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:16,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:17,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:17,088 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 1 times [2023-10-12 17:42:17,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:17,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475898622] [2023-10-12 17:42:17,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:17,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:17,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:17,131 INFO L85 PathProgramCache]: Analyzing trace with hash 3817330, now seen corresponding path program 1 times [2023-10-12 17:42:17,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:17,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280424488] [2023-10-12 17:42:17,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:17,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:17,248 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:17,249 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:17,249 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:17,249 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:17,250 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:17,250 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,250 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:17,250 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:17,250 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:42:17,250 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:17,250 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:17,265 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:42:17,278 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:42:17,280 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:42:17,289 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:42:17,363 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:17,367 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:17,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:17,373 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:42:17,385 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:42:17,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:17,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:17,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:17,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:17,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:17,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:17,406 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:42:17,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:17,421 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:42:17,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:17,423 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:42:17,434 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:42:17,434 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:42:17,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:17,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:17,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:17,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:17,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:17,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:17,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:17,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:17,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:17,477 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:42:17,479 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:42:17,481 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:42:17,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:17,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:17,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:17,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:17,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:17,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:17,505 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:17,516 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:42:17,517 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:42:17,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:17,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:17,533 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:42:17,562 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:17,562 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:42:17,601 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:17,601 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:17,602 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:42:17,608 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:42:17,611 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:17,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:17,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:17,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:17,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:17,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:17,671 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:42:17,711 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:42:17,832 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:42:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2023-10-12 17:42:17,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 234 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:42:17,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:17,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 234 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:42:17,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:17,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 234 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:42:17,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:17,851 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 90 transitions, 450 flow [2023-10-12 17:42:17,852 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:42:17,855 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 90 transitions, 450 flow [2023-10-12 17:42:17,863 ERROR L47 etriNetUnfolderRabin]: [1:1A:[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[][34], 2:2A:[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][24], 3:3A:[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0][4], 14:4A:[143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][49]][16:5A:[149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][89]] [2023-10-12 17:42:17,863 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:17,863 INFO L124 PetriNetUnfolderBase]: 7/15 cut-off events. [2023-10-12 17:42:17,863 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:42:17,863 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:17,864 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 95#[$Ultimate##0, L82, $Ultimate##0]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 97#[L82, L46-1, $Ultimate##0]true [2023-10-12 17:42:17,865 INFO L750 eck$LassoCheckResult]: Loop: 97#[L82, L46-1, $Ultimate##0]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 97#[L82, L46-1, $Ultimate##0]true [2023-10-12 17:42:17,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash 3818320, now seen corresponding path program 1 times [2023-10-12 17:42:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495798834] [2023-10-12 17:42:17,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:17,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:17,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:17,883 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 1 times [2023-10-12 17:42:17,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:17,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979285809] [2023-10-12 17:42:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:17,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:17,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:17,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash 118368069, now seen corresponding path program 1 times [2023-10-12 17:42:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:17,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85964132] [2023-10-12 17:42:17,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:42:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:42:17,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85964132] [2023-10-12 17:42:17,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85964132] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:42:17,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:42:17,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:42:17,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879241462] [2023-10-12 17:42:17,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:42:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:42:18,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:42:18,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:42:18,099 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 30 places, 90 transitions, 450 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:18,099 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:42:18,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:42:18,199 INFO L124 PetriNetUnfolderBase]: 195/286 cut-off events. [2023-10-12 17:42:18,199 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-10-12 17:42:18,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 286 events. 195/286 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 752 event pairs, 6 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 818. Up to 210 conditions per place. [2023-10-12 17:42:18,207 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 46 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-10-12 17:42:18,207 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 29 places, 51 transitions, 345 flow [2023-10-12 17:42:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:42:18,209 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 51 transitions, 345 flow [2023-10-12 17:42:18,210 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:42:18,210 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 51 transitions, 345 flow [2023-10-12 17:42:18,219 ERROR L47 etriNetUnfolderRabin]: [1:1A:[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[][0], 2:2A:[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][1], 4:3A:[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0][3], 16:4A:[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0][7], 44:5A:[140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t][19]][45:6A:[148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front][31]] [2023-10-12 17:42:18,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:18,220 INFO L124 PetriNetUnfolderBase]: 25/44 cut-off events. [2023-10-12 17:42:18,220 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:42:18,220 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:18,220 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 95#[$Ultimate##0, L82, $Ultimate##0]true [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 113#[$Ultimate##0, L83, $Ultimate##0, $Ultimate##0]true [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 115#[$Ultimate##0, L66-1, L83, $Ultimate##0]true [2023-10-12 17:42:18,221 INFO L750 eck$LassoCheckResult]: Loop: 115#[$Ultimate##0, L66-1, L83, $Ultimate##0]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 115#[$Ultimate##0, L66-1, L83, $Ultimate##0]true [2023-10-12 17:42:18,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash 118367409, now seen corresponding path program 1 times [2023-10-12 17:42:18,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017650583] [2023-10-12 17:42:18,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash 179, now seen corresponding path program 1 times [2023-10-12 17:42:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418964825] [2023-10-12 17:42:18,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash -625577469, now seen corresponding path program 1 times [2023-10-12 17:42:18,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021777608] [2023-10-12 17:42:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:18,270 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:42:18,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:42:18,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021777608] [2023-10-12 17:42:18,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021777608] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:42:18,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:42:18,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:42:18,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866125226] [2023-10-12 17:42:18,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:42:18,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:42:18,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:42:18,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:42:18,345 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 29 places, 51 transitions, 345 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:18,345 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:42:18,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:42:18,416 INFO L124 PetriNetUnfolderBase]: 244/370 cut-off events. [2023-10-12 17:42:18,417 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-10-12 17:42:18,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 370 events. 244/370 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1101 event pairs, 6 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 1403. Up to 303 conditions per place. [2023-10-12 17:42:18,427 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 63 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-10-12 17:42:18,427 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 31 places, 66 transitions, 582 flow [2023-10-12 17:42:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:42:18,429 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 66 transitions, 582 flow [2023-10-12 17:42:18,429 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:42:18,429 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 31 places, 66 transitions, 582 flow [2023-10-12 17:42:18,447 ERROR L47 etriNetUnfolderRabin]: [1:1A:[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[][0], 2:2A:[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][1], 4:3A:[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0][3], 17:4A:[143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][8], 25:5A:[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][2], 49:6A:[146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back][4], 104:7A:[149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][34]][105:8A:[149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][43]] [2023-10-12 17:42:18,447 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:18,447 INFO L124 PetriNetUnfolderBase]: 64/104 cut-off events. [2023-10-12 17:42:18,447 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-10-12 17:42:18,448 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:18,449 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 95#[$Ultimate##0, L82, $Ultimate##0]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 97#[L82, L46-1, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 132#[L28-1, L82, L46-1]true [146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back] 134#[thread1EXIT, L82, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 134#[thread1EXIT, L82, L46-1]true [2023-10-12 17:42:18,449 INFO L750 eck$LassoCheckResult]: Loop: 134#[thread1EXIT, L82, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 134#[thread1EXIT, L82, L46-1]true [2023-10-12 17:42:18,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2082518355, now seen corresponding path program 1 times [2023-10-12 17:42:18,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73286760] [2023-10-12 17:42:18,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 2 times [2023-10-12 17:42:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602088341] [2023-10-12 17:42:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,508 INFO L85 PathProgramCache]: Analyzing trace with hash 133559714, now seen corresponding path program 2 times [2023-10-12 17:42:18,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235057365] [2023-10-12 17:42:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:42:18,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:42:18,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235057365] [2023-10-12 17:42:18,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235057365] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:42:18,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985917731] [2023-10-12 17:42:18,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:42:18,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:42:18,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:18,597 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:42:18,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-10-12 17:42:18,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:42:18,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:42:18,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:18,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:42:18,676 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:42:18,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985917731] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:42:18,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:42:18,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-10-12 17:42:18,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261955055] [2023-10-12 17:42:18,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:42:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:42:18,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:42:18,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:42:18,753 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 31 places, 66 transitions, 582 flow. Second operand has 4 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:42:18,753 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:42:18,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:42:18,870 INFO L124 PetriNetUnfolderBase]: 441/680 cut-off events. [2023-10-12 17:42:18,870 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-10-12 17:42:18,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3562 conditions, 680 events. 441/680 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2481 event pairs, 6 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 3189. Up to 613 conditions per place. [2023-10-12 17:42:18,878 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 100 selfloop transitions, 19 changer transitions 0/119 dead transitions. [2023-10-12 17:42:18,878 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 34 places, 119 transitions, 1292 flow [2023-10-12 17:42:18,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:42:18,880 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 119 transitions, 1292 flow [2023-10-12 17:42:18,880 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:42:18,880 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 119 transitions, 1292 flow [2023-10-12 17:42:18,910 ERROR L47 etriNetUnfolderRabin]: [1:1A:[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[][0], 2:2A:[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][1], 4:3A:[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0][3], 14:4A:[143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][7], 19:5A:[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][2], 52:6A:[145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back][5], 115:7A:[146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back][13], 223:8A:[149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][54]][224:9A:[149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][66]] [2023-10-12 17:42:18,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:18,912 INFO L124 PetriNetUnfolderBase]: 141/223 cut-off events. [2023-10-12 17:42:18,912 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-10-12 17:42:18,912 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:18,913 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 95#[$Ultimate##0, L82, $Ultimate##0]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 97#[L82, L46-1, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 132#[L28-1, L82, L46-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 132#[L28-1, L82, L46-1]true [146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back] 134#[thread1EXIT, L82, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 134#[thread1EXIT, L82, L46-1]true [2023-10-12 17:42:18,913 INFO L750 eck$LassoCheckResult]: Loop: 134#[thread1EXIT, L82, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 134#[thread1EXIT, L82, L46-1]true [2023-10-12 17:42:18,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash 133558660, now seen corresponding path program 1 times [2023-10-12 17:42:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901419514] [2023-10-12 17:42:18,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,940 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 3 times [2023-10-12 17:42:18,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760646268] [2023-10-12 17:42:18,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:42:18,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:18,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:18,964 INFO L85 PathProgramCache]: Analyzing trace with hash -154648687, now seen corresponding path program 2 times [2023-10-12 17:42:18,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:18,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497567865] [2023-10-12 17:42:18,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:18,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:18,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:19,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:19,259 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:19,259 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:19,259 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:19,259 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:19,259 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:19,260 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:19,260 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:19,260 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:19,260 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:42:19,260 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:19,260 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:19,262 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:42:19,265 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:42:19,267 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:42:19,271 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:42:19,273 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:42:19,346 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:19,595 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:19,595 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:19,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:19,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:19,596 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:42:19,608 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:42:19,609 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:42:19,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:19,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:19,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:19,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:19,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:19,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:19,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:19,647 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:42:19,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:19,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:19,648 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:42:19,654 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:42:19,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:42:19,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:19,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:19,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:19,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:19,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:19,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:19,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:19,687 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:42:19,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:19,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:19,689 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:42:19,691 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:42:19,693 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:42:19,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:19,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:19,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:19,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:19,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:19,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:19,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:19,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:19,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:19,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:19,726 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:42:19,729 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:42:19,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:42:19,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:19,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:19,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:19,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:19,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:19,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:19,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:19,756 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:42:19,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:19,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:19,757 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:42:19,768 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:42:19,773 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:42:19,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:19,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:19,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:19,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:19,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:19,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:19,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:19,799 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:42:19,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:19,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:19,801 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:42:19,803 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:42:19,805 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:42:19,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:19,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:19,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:19,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:19,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:19,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:19,837 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:19,853 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:42:19,853 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:42:19,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:19,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:19,856 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:42:19,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:42:19,859 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:19,880 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:19,880 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:19,881 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:42:19,888 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:42:19,893 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:42:19,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:19,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:19,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:19,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:19,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:19,938 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:42:19,939 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:42:20,024 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:42:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:20,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2023-10-12 17:42:20,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 224 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:42:20,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:20,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 224 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:42:20,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:20,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 224 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:42:20,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:20,028 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 595 transitions, 7650 flow [2023-10-12 17:42:20,028 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:42:20,028 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 595 transitions, 7650 flow [2023-10-12 17:42:20,075 ERROR L47 etriNetUnfolderRabin]: [1:1A:[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[][0], 2:2A:[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][5], 4:3A:[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0][15], 14:4A:[143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][35], 44:5A:[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0][40], 72:6A:[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][10], 104:7A:[146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back][20], 185:8A:[149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][180], 303:9A:[140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t][322]][305:10A:[148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front][414]] [2023-10-12 17:42:20,075 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:20,075 INFO L124 PetriNetUnfolderBase]: 194/304 cut-off events. [2023-10-12 17:42:20,076 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-10-12 17:42:20,076 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:20,077 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 95#[$Ultimate##0, L82, $Ultimate##0]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 97#[L82, L46-1, $Ultimate##0]true [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 238#[L83, L46-1, $Ultimate##0, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 240#[L28-1, L83, L46-1, $Ultimate##0]true [146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back] 242#[thread1EXIT, L83, L46-1, $Ultimate##0]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 242#[thread1EXIT, L83, L46-1, $Ultimate##0]true [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 245#[thread1EXIT, L66-1, L83, L46-1]true [2023-10-12 17:42:20,077 INFO L750 eck$LassoCheckResult]: Loop: 245#[thread1EXIT, L66-1, L83, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 245#[thread1EXIT, L66-1, L83, L46-1]true [2023-10-12 17:42:20,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:20,077 INFO L85 PathProgramCache]: Analyzing trace with hash -132096909, now seen corresponding path program 1 times [2023-10-12 17:42:20,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:20,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163831608] [2023-10-12 17:42:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:20,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:20,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:20,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:20,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash 179, now seen corresponding path program 2 times [2023-10-12 17:42:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:20,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329700235] [2023-10-12 17:42:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:20,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:20,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:20,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:20,110 INFO L85 PathProgramCache]: Analyzing trace with hash 199963265, now seen corresponding path program 1 times [2023-10-12 17:42:20,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:20,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631628579] [2023-10-12 17:42:20,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:20,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:20,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:20,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:20,394 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:20,394 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:20,394 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:20,394 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:20,394 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:20,394 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,394 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:20,394 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:20,395 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:42:20,395 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:20,395 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:20,397 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:42:20,399 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:42:20,401 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:42:20,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:42:20,408 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:42:20,410 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:42:20,412 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:20,414 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:42:20,417 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:42:20,419 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:42:20,552 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:42:20,793 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:20,794 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:20,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,795 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:42:20,800 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:42:20,826 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:42:20,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:20,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:20,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:20,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:20,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:20,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:20,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:20,840 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:42:20,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,841 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:42:20,842 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:42:20,849 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:42:20,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:20,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:20,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:20,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:20,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:20,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:20,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:20,885 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:42:20,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,887 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:42:20,891 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:42:20,893 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:42:20,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:20,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:20,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:20,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:20,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:20,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:20,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:20,931 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:42:20,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,933 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:42:20,940 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:42:20,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:20,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:20,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:20,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:20,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:20,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:20,952 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:42:20,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:20,972 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:42:20,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:21,139 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:42:21,140 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:42:21,142 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:42:21,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:21,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:21,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:21,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:21,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:21,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:21,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:21,154 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:42:21,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:21,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:21,155 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:42:21,156 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:42:21,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:42:21,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:21,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:21,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:21,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:21,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:21,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:21,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:21,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-10-12 17:42:21,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:21,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:21,173 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:42:21,174 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:42:21,178 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:42:21,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:21,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:21,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:21,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:21,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:21,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:21,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:21,189 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:42:21,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:21,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:21,190 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:42:21,192 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:42:21,203 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:42:21,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:21,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:21,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:21,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:21,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:21,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:21,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:21,252 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:42:21,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:21,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:21,254 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:42:21,255 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:42:21,257 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:42:21,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:21,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:21,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:21,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:21,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:21,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:21,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:21,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:21,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:21,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:21,313 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:42:21,316 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:42:21,318 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:42:21,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:21,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:21,326 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:42:21,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:21,367 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:42:21,367 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:42:21,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:21,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:21,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:21,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:21,428 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:42:21,430 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:42:21,432 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:42:21,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:21,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:21,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:21,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:21,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:21,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:21,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:21,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:21,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:21,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:21,465 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:42:21,467 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:42:21,468 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:42:21,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:21,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:21,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:21,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:21,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:21,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:21,505 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:21,514 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:42:21,514 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:42:21,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:21,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:21,517 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:42:21,520 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:42:21,521 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:21,554 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:21,554 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:21,554 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2023-10-12 17:42:21,561 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:42:21,564 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:42:21,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:21,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:21,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:21,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:21,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:21,605 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:42:21,606 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:42:21,698 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:42:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2023-10-12 17:42:21,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 228 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:42:21,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:21,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 228 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:42:21,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:21,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 228 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:42:21,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:21,703 INFO L430 stractBuchiCegarLoop]: Abstraction has has 44 places, 2975 transitions, 44200 flow [2023-10-12 17:42:21,703 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:42:21,703 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 44 places, 2975 transitions, 44200 flow [2023-10-12 17:42:21,913 ERROR L47 etriNetUnfolderRabin]: [1:1A:[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[][1], 2:2A:[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][26], 4:3A:[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0][76], 14:4A:[143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][176], 19:5A:[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][51], 52:6A:[145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back][126], 129:7A:[145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back][351], 272:8A:[149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][1401], 428:9A:[146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back][1736]][430:10A:[149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][1666]] [2023-10-12 17:42:21,914 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:21,914 INFO L124 PetriNetUnfolderBase]: 275/429 cut-off events. [2023-10-12 17:42:21,914 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-10-12 17:42:21,914 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:21,915 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 95#[$Ultimate##0, L82, $Ultimate##0]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 97#[L82, L46-1, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 132#[L28-1, L82, L46-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 132#[L28-1, L82, L46-1]true [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 132#[L28-1, L82, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 132#[L28-1, L82, L46-1]true [146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back] 134#[thread1EXIT, L82, L46-1]true [2023-10-12 17:42:21,915 INFO L750 eck$LassoCheckResult]: Loop: 134#[thread1EXIT, L82, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 134#[thread1EXIT, L82, L46-1]true [2023-10-12 17:42:21,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash -154649651, now seen corresponding path program 3 times [2023-10-12 17:42:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093342054] [2023-10-12 17:42:21,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:21,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:21,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:21,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:21,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 4 times [2023-10-12 17:42:21,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:21,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001344035] [2023-10-12 17:42:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:21,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:21,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:21,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:21,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:21,942 INFO L85 PathProgramCache]: Analyzing trace with hash -499171736, now seen corresponding path program 4 times [2023-10-12 17:42:21,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:21,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381181161] [2023-10-12 17:42:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:21,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:21,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:22,014 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:42:22,258 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:22,258 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:22,258 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:22,258 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:22,258 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:22,258 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:22,259 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:22,259 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:22,259 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:42:22,259 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:22,259 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:22,260 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:22,263 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:42:22,353 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:42:22,357 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:42:22,359 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:42:22,362 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:42:22,605 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:22,605 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:22,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:22,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:22,609 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:22,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:42:22,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:42:22,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:22,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:22,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:22,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:22,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:22,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:22,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:22,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:22,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:22,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:22,631 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:22,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:42:22,634 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:42:22,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:22,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:22,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:22,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:22,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:22,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:22,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:22,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-10-12 17:42:22,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:22,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:22,647 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:22,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-10-12 17:42:22,650 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:42:22,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:22,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:22,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:22,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:22,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:22,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:22,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:22,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:22,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:22,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:22,667 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:22,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-10-12 17:42:22,670 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:42:22,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:22,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:22,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:22,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:22,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:22,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:22,682 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:22,687 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:42:22,688 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:42:22,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:22,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:22,689 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:22,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-10-12 17:42:22,692 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:22,698 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:22,698 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:22,698 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:42:22,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-10-12 17:42:22,705 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:42:22,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:22,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:22,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:22,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:22,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:22,754 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:42:22,754 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:42:22,939 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:42:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2023-10-12 17:42:22,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 224 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:42:22,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:22,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 224 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:42:22,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:22,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 224 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:42:22,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:22,941 INFO L430 stractBuchiCegarLoop]: Abstraction has has 49 places, 14875 transitions, 250750 flow [2023-10-12 17:42:22,941 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:42:22,941 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 49 places, 14875 transitions, 250750 flow [2023-10-12 17:42:23,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:24,465 ERROR L47 etriNetUnfolderRabin]: [1:1A:[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[][8], 2:2A:[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][133], 4:3A:[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0][383], 13:4A:[143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][883], 43:5A:[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0][1008], 104:6A:[140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t][2508], 112:7A:[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][253], 205:8A:[146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back][523], 339:9A:[149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][4524], 515:10A:[141] L46-1-->thread2EXIT: Formula: (not v_f_5) InVars {f=v_f_5} OutVars{f=v_f_5} AuxVars[] AssignedVars[][6439]][518:11A:[148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front][10362]] [2023-10-12 17:42:24,465 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:24,466 INFO L124 PetriNetUnfolderBase]: 329/517 cut-off events. [2023-10-12 17:42:24,466 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-10-12 17:42:24,466 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:24,466 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 95#[$Ultimate##0, L82, $Ultimate##0]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 97#[L82, L46-1, $Ultimate##0]true [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 238#[L83, L46-1, $Ultimate##0, $Ultimate##0]true [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 373#[L66-1, L83, L46-1, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 375#[L66-1, L83, L28-1, L46-1]true [146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back] 245#[thread1EXIT, L66-1, L83, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 245#[thread1EXIT, L66-1, L83, L46-1]true [141] L46-1-->thread2EXIT: Formula: (not v_f_5) InVars {f=v_f_5} OutVars{f=v_f_5} AuxVars[] AssignedVars[] 379#[thread1EXIT, L66-1, L83, thread2EXIT]true [2023-10-12 17:42:24,466 INFO L750 eck$LassoCheckResult]: Loop: 379#[thread1EXIT, L66-1, L83, thread2EXIT]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 379#[thread1EXIT, L66-1, L83, thread2EXIT]true [2023-10-12 17:42:24,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash 239106028, now seen corresponding path program 1 times [2023-10-12 17:42:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:24,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366997261] [2023-10-12 17:42:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:24,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:24,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:24,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:24,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:24,476 INFO L85 PathProgramCache]: Analyzing trace with hash 179, now seen corresponding path program 3 times [2023-10-12 17:42:24,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:24,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380909098] [2023-10-12 17:42:24,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:24,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:24,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:24,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:24,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:24,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1177647576, now seen corresponding path program 1 times [2023-10-12 17:42:24,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:24,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074840094] [2023-10-12 17:42:24,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:24,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:24,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:24,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:24,741 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:24,741 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:24,742 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:24,742 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:24,742 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:24,742 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:24,742 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:24,742 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:24,742 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:42:24,742 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:24,742 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:24,744 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:42:24,749 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:42:24,751 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:42:24,753 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:42:24,754 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:42:24,760 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:42:24,762 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:42:24,764 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:42:24,766 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:42:24,793 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:42:24,816 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:42:24,818 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:42:24,820 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:42:25,046 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:25,046 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:25,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,049 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:25,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-10-12 17:42:25,055 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:42:25,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:25,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:25,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:25,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:25,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:25,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:25,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:25,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:25,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,077 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:25,085 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:42:25,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:25,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:25,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:25,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:25,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:25,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:25,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-10-12 17:42:25,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:25,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:25,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,120 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:25,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-10-12 17:42:25,123 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:42:25,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:25,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:25,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:25,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:25,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:25,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:25,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:25,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:25,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,154 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:25,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-10-12 17:42:25,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:42:25,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:25,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:25,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:25,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:25,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:25,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:25,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:25,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:25,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,190 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:25,197 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:42:25,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:25,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:25,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:25,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:25,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:25,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:25,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-10-12 17:42:25,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:25,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:25,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,228 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:25,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-10-12 17:42:25,232 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:42:25,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:25,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:25,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:25,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:25,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:25,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:25,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:25,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:25,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,266 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:25,269 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:42:25,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:25,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:25,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:25,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:25,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:25,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:25,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-10-12 17:42:25,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:25,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:25,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,295 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:25,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-10-12 17:42:25,298 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:42:25,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:25,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:25,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:25,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:25,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:25,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:25,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:25,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2023-10-12 17:42:25,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,319 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:25,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-10-12 17:42:25,323 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:42:25,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:25,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:25,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:25,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:25,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:25,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:25,343 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:25,353 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:42:25,353 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:42:25,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,357 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:25,365 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:25,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-10-12 17:42:25,386 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:25,386 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:25,386 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:42:25,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:25,389 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:25,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:25,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:25,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:25,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:25,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:25,432 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:42:25,433 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:42:25,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:26,285 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:42:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:42:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2023-10-12 17:42:26,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 228 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:42:26,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:26,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 228 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:42:26,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:26,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 228 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:42:26,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:26,320 INFO L430 stractBuchiCegarLoop]: Abstraction has has 54 places, 74375 transitions, 1402500 flow [2023-10-12 17:42:26,320 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:42:26,320 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 54 places, 74375 transitions, 1402500 flow [2023-10-12 17:42:37,233 ERROR L47 etriNetUnfolderRabin]: [1:1A:[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[][41], 2:2A:[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][666], 4:3A:[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0][1916], 13:4A:[143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][4416], 43:5A:[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0][5041], 102:6A:[140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t][12541], 113:7A:[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][1266], 207:8A:[146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back][2616], 343:9A:[149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][22621], 530:10A:[129] thread1EXIT-->L84: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_4 1) InVars {thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][40946]][532:11A:[148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front][51811]] [2023-10-12 17:42:37,234 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:37,234 INFO L124 PetriNetUnfolderBase]: 333/531 cut-off events. [2023-10-12 17:42:37,234 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-10-12 17:42:37,234 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:37,235 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 95#[$Ultimate##0, L82, $Ultimate##0]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 97#[L82, L46-1, $Ultimate##0]true [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 238#[L83, L46-1, $Ultimate##0, $Ultimate##0]true [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 373#[L66-1, L83, L46-1, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 375#[L66-1, L83, L28-1, L46-1]true [146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back] 245#[thread1EXIT, L66-1, L83, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 245#[thread1EXIT, L66-1, L83, L46-1]true [129] thread1EXIT-->L84: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_4 1) InVars {thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] 441#[L84, L66-1, L46-1]true [2023-10-12 17:42:37,235 INFO L750 eck$LassoCheckResult]: Loop: 441#[L84, L66-1, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 441#[L84, L66-1, L46-1]true [2023-10-12 17:42:37,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:37,235 INFO L85 PathProgramCache]: Analyzing trace with hash 239106016, now seen corresponding path program 1 times [2023-10-12 17:42:37,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:37,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290813855] [2023-10-12 17:42:37,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:37,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:37,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:37,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:37,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:37,245 INFO L85 PathProgramCache]: Analyzing trace with hash 179, now seen corresponding path program 4 times [2023-10-12 17:42:37,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:37,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848103729] [2023-10-12 17:42:37,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:37,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:37,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:37,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:37,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1177647948, now seen corresponding path program 1 times [2023-10-12 17:42:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:37,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864624732] [2023-10-12 17:42:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:37,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:37,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:37,528 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:37,528 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:37,528 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:37,528 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:37,528 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:37,528 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:37,528 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:37,528 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:37,528 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:42:37,529 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:37,529 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:37,530 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:42:37,533 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:37,535 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:37,537 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:37,540 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:42:37,545 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:42:37,547 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:42:37,550 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:42:37,553 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:42:37,556 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:42:37,897 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:37,898 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:37,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:37,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:37,899 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:37,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-10-12 17:42:37,911 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:42:37,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:37,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:37,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:37,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:37,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:37,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:37,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:37,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:37,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:37,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:37,926 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:37,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-10-12 17:42:37,939 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:42:37,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:37,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:37,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:37,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:37,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:37,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:37,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:37,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-10-12 17:42:37,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:37,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:37,952 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:37,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-10-12 17:42:37,955 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:42:37,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:37,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:37,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:37,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:37,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:37,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:37,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:37,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:37,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:37,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:37,969 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:37,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-10-12 17:42:37,972 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:42:37,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:37,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:37,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:37,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:37,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:37,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:37,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:37,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-10-12 17:42:37,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:37,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:37,985 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:37,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-10-12 17:42:37,989 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:42:37,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:37,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:37,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:37,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:37,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:37,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:38,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:38,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:38,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:38,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:38,004 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:38,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-10-12 17:42:38,007 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:42:38,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:38,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:38,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:38,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:38,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:38,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:38,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:38,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:38,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:38,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:38,022 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:38,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-10-12 17:42:38,025 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:42:38,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:38,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:38,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:38,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:38,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:38,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:38,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:38,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:38,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:38,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:38,039 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:38,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:42:38,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-10-12 17:42:38,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:38,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:38,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:38,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:38,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:38,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:38,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:38,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:38,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:38,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:38,070 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:38,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-10-12 17:42:38,074 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:42:38,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:38,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:38,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:38,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:38,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:38,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:38,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:38,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:38,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:38,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:38,094 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:38,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-10-12 17:42:38,097 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:42:38,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:38,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:38,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:38,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:38,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:38,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:38,134 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:38,138 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:42:38,138 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:42:38,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:38,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:38,139 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:38,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-10-12 17:42:38,143 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:38,149 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:38,150 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:38,150 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:42:38,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:38,155 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:42:38,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:38,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:38,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:38,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:38,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:38,196 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:42:38,196 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:42:38,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:42,498 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:42:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:42:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2023-10-12 17:42:42,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 228 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:42:42,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:42,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 228 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:42:42,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:42,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 228 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:42:42,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:42,499 INFO L430 stractBuchiCegarLoop]: Abstraction has has 59 places, 371875 transitions, 7756250 flow [2023-10-12 17:42:42,499 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:42:42,499 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 59 places, 371875 transitions, 7756250 flow [2023-10-12 17:43:47,572 ERROR L47 etriNetUnfolderRabin]: [1:1A:[93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[][205], 2:2A:[125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0][3330], 4:3A:[128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0][9580], 13:4A:[143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s][22080], 43:5A:[122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0][25205], 102:6A:[140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t][62705], 113:7A:[96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][6330], 206:8A:[146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back][13080], 343:9A:[149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s][113105], 535:10A:[148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front][257855]][538:11A:[148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front][259055]] [2023-10-12 17:43:47,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:43:47,573 INFO L124 PetriNetUnfolderBase]: 334/537 cut-off events. [2023-10-12 17:43:47,573 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2023-10-12 17:43:47,573 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:43:47,573 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]true [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[L81-1, $Ultimate##0]true [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 95#[$Ultimate##0, L82, $Ultimate##0]true [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 97#[L82, L46-1, $Ultimate##0]true [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 238#[L83, L46-1, $Ultimate##0, $Ultimate##0]true [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 373#[L66-1, L83, L46-1, $Ultimate##0]true [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 375#[L66-1, L83, L28-1, L46-1]true [146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back] 245#[thread1EXIT, L66-1, L83, L46-1]true [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 245#[thread1EXIT, L66-1, L83, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 245#[thread1EXIT, L66-1, L83, L46-1]true [2023-10-12 17:43:47,574 INFO L750 eck$LassoCheckResult]: Loop: 245#[thread1EXIT, L66-1, L83, L46-1]true [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 245#[thread1EXIT, L66-1, L83, L46-1]true [2023-10-12 17:43:47,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:43:47,574 INFO L85 PathProgramCache]: Analyzing trace with hash 239106035, now seen corresponding path program 2 times [2023-10-12 17:43:47,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:43:47,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19648556] [2023-10-12 17:43:47,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:43:47,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:43:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:43:47,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:43:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:43:47,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:43:47,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:43:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash 179, now seen corresponding path program 5 times [2023-10-12 17:43:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:43:47,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023459904] [2023-10-12 17:43:47,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:43:47,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:43:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:43:47,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:43:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:43:47,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:43:47,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:43:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1177647359, now seen corresponding path program 3 times [2023-10-12 17:43:47,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:43:47,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461753196] [2023-10-12 17:43:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:43:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:43:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:43:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:43:47,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:43:47,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461753196] [2023-10-12 17:43:47,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461753196] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:43:47,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540710524] [2023-10-12 17:43:47,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-10-12 17:43:47,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:43:47,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:43:47,645 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:43:47,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2023-10-12 17:43:47,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-10-12 17:43:47,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:43:47,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:43:47,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:43:47,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:43:47,707 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:43:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540710524] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:43:47,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:43:47,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2023-10-12 17:43:47,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063041116] [2023-10-12 17:43:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:43:47,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:43:47,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:43:47,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-10-12 17:43:47,762 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 59 places, 371875 transitions, 7756250 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:43:47,762 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:43:47,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-10-12 17:46:01,554 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: clock still running: AutomataDifference at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopStatisticsGenerator.getValue(CegarLoopStatisticsGenerator.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmarkGenerator.getValue(BuchiCegarLoopBenchmarkGenerator.java:131) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.aggregateBenchmarkData(StatisticsData.java:60) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.(BuchiAutomizerTimingBenchmark.java:39) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:341) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-10-12 17:46:01,561 INFO L158 Benchmark]: Toolchain (without parser) took 225820.78ms. Allocated memory was 204.5MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 158.9MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2023-10-12 17:46:01,561 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 204.5MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:46:01,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.16ms. Allocated memory is still 204.5MB. Free memory was 158.8MB in the beginning and 157.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:46:01,562 INFO L158 Benchmark]: Boogie Preprocessor took 29.96ms. Allocated memory is still 204.5MB. Free memory was 157.2MB in the beginning and 156.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:46:01,562 INFO L158 Benchmark]: RCFGBuilder took 266.77ms. Allocated memory is still 204.5MB. Free memory was 156.1MB in the beginning and 171.4MB in the end (delta: -15.3MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2023-10-12 17:46:01,562 INFO L158 Benchmark]: BuchiAutomizer took 225492.74ms. Allocated memory was 204.5MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 171.4MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2023-10-12 17:46:01,563 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 204.5MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.16ms. Allocated memory is still 204.5MB. Free memory was 158.8MB in the beginning and 157.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.96ms. Allocated memory is still 204.5MB. Free memory was 157.2MB in the beginning and 156.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 266.77ms. Allocated memory is still 204.5MB. Free memory was 156.1MB in the beginning and 171.4MB in the end (delta: -15.3MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 225492.74ms. Allocated memory was 204.5MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 171.4MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Decomposition not yet finished * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 42 PlacesBefore, 25 PlacesAfterwards, 35 TransitionsBefore, 18 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 18 TotalNumberOfCompositions, 397 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 381, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 301, independent: 295, independent conditional: 0, independent unconditional: 295, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 301, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 381, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 301, unknown conditional: 0, unknown unconditional: 301] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: AssertionError: clock still running: AutomataDifference de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: clock still running: AutomataDifference: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopStatisticsGenerator.getValue(CegarLoopStatisticsGenerator.java:146) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown