/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-more/sorted.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:40:43,685 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:40:43,760 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:40:43,791 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:40:43,791 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:40:43,792 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:40:43,794 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:40:43,794 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:40:43,794 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:40:43,798 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:40:43,798 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:40:43,799 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:40:43,799 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:40:43,800 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:40:43,802 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:40:43,802 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:40:43,802 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:40:43,802 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:40:43,802 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:40:43,803 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:40:43,803 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:40:43,803 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:40:43,803 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:40:43,804 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:40:43,804 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:40:43,804 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:40:43,804 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:40:43,804 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:40:43,804 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:40:43,805 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:40:43,806 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:40:43,806 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:40:43,806 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:40:43,807 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:40:43,808 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:40:44,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:40:44,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:40:44,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:40:44,059 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:40:44,060 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:40:44,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sorted.wvr.bpl [2023-10-12 17:40:44,062 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sorted.wvr.bpl' [2023-10-12 17:40:44,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:40:44,094 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:40:44,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:44,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:40:44,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:40:44,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:44" (1/1) ... [2023-10-12 17:40:44,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:44" (1/1) ... [2023-10-12 17:40:44,117 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:40:44,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:44,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:40:44,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:40:44,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:40:44,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:44" (1/1) ... [2023-10-12 17:40:44,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:44" (1/1) ... [2023-10-12 17:40:44,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:44" (1/1) ... [2023-10-12 17:40:44,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:44" (1/1) ... [2023-10-12 17:40:44,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:44" (1/1) ... [2023-10-12 17:40:44,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:44" (1/1) ... [2023-10-12 17:40:44,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:44" (1/1) ... [2023-10-12 17:40:44,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:44" (1/1) ... [2023-10-12 17:40:44,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:40:44,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:40:44,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:40:44,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:40:44,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:44" (1/1) ... [2023-10-12 17:40:44,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:44,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:44,167 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:40:44,189 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:40:44,209 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:40:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:40:44,209 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:40:44,209 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:40:44,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:40:44,210 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:40:44,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:40:44,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:40:44,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:40:44,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:40:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:40:44,211 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:40:44,212 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:40:44,262 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:40:44,264 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:40:44,395 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:40:44,428 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:40:44,428 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:40:44,430 INFO L201 PluginConnector]: Adding new model sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:44 BoogieIcfgContainer [2023-10-12 17:40:44,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:40:44,431 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:40:44,431 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:40:44,438 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:40:44,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:44,439 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:44" (1/2) ... [2023-10-12 17:40:44,441 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@356c2992 and model type sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:40:44, skipping insertion in model container [2023-10-12 17:40:44,441 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:44,441 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:44" (2/2) ... [2023-10-12 17:40:44,442 INFO L332 chiAutomizerObserver]: Analyzing ICFG sorted.wvr.bpl [2023-10-12 17:40:44,536 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:40:44,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:40:44,601 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:40:44,601 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:44,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:40:44,606 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:40:44,609 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2023-10-12 17:40:44,616 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:40:44,632 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:40:44,635 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:40:44,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 76 flow [2023-10-12 17:40:44,660 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:40:44,660 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:44,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:40:44,661 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:40:45,234 INFO L134 LiptonReduction]: Checked pairs total: 142 [2023-10-12 17:40:45,235 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:40:45,249 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:40:45,249 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:40:45,249 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:40:45,249 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:40:45,249 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:40:45,249 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:40:45,250 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:40:45,250 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:40:45,251 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:40:45,254 ERROR L47 etriNetUnfolderRabin]: [1:1A:[111] $Ultimate##0-->L62: Formula: (and v_sorted3_17 v_sorted2_23 v_sorted1_23 (<= 0 v_M_18) (< v_M_18 v_N_20) (= v_i_23 v_j_23) (= v_M_18 v_k_21) (= v_i_23 0)) InVars {N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} OutVars{N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} AuxVars[] AssignedVars[][14], 2:2A:[87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5]][3:3A:[102] L23-1-->L23-1: Formula: (let ((.cse0 (+ v_i_16 1))) (and (= v_i_15 .cse0) (< .cse0 v_N_10) (let ((.cse2 (select v_A_12 v_i_16)) (.cse1 (select v_A_12 .cse0))) (or (and (or (not v_sorted1_12) (<= .cse1 .cse2)) (not v_sorted1_11)) (and v_sorted1_11 v_sorted1_12 (< .cse2 .cse1)))))) InVars {A=v_A_12, N=v_N_10, i=v_i_16, sorted1=v_sorted1_12} OutVars{A=v_A_12, N=v_N_10, i=v_i_15, sorted1=v_sorted1_11} AuxVars[] AssignedVars[i, sorted1][6]] [2023-10-12 17:40:45,259 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:45,259 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:45,260 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:45,260 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:45,264 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:40:45,264 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:40:45,266 ERROR L47 etriNetUnfolderRabin]: [1:1A:[111] $Ultimate##0-->L62: Formula: (and v_sorted3_17 v_sorted2_23 v_sorted1_23 (<= 0 v_M_18) (< v_M_18 v_N_20) (= v_i_23 v_j_23) (= v_M_18 v_k_21) (= v_i_23 0)) InVars {N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} OutVars{N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} AuxVars[] AssignedVars[][14], 2:2A:[87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5]][3:3A:[102] L23-1-->L23-1: Formula: (let ((.cse0 (+ v_i_16 1))) (and (= v_i_15 .cse0) (< .cse0 v_N_10) (let ((.cse2 (select v_A_12 v_i_16)) (.cse1 (select v_A_12 .cse0))) (or (and (or (not v_sorted1_12) (<= .cse1 .cse2)) (not v_sorted1_11)) (and v_sorted1_11 v_sorted1_12 (< .cse2 .cse1)))))) InVars {A=v_A_12, N=v_N_10, i=v_i_16, sorted1=v_sorted1_12} OutVars{A=v_A_12, N=v_N_10, i=v_i_15, sorted1=v_sorted1_11} AuxVars[] AssignedVars[i, sorted1][6]] [2023-10-12 17:40:45,267 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:45,268 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:45,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:45,268 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:45,272 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [111] $Ultimate##0-->L62: Formula: (and v_sorted3_17 v_sorted2_23 v_sorted1_23 (<= 0 v_M_18) (< v_M_18 v_N_20) (= v_i_23 v_j_23) (= v_M_18 v_k_21) (= v_i_23 0)) InVars {N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} OutVars{N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} AuxVars[] AssignedVars[] 45#[L62]true [87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 47#[L62-1, L23-1]true [2023-10-12 17:40:45,273 INFO L750 eck$LassoCheckResult]: Loop: 47#[L62-1, L23-1]true [102] L23-1-->L23-1: Formula: (let ((.cse0 (+ v_i_16 1))) (and (= v_i_15 .cse0) (< .cse0 v_N_10) (let ((.cse2 (select v_A_12 v_i_16)) (.cse1 (select v_A_12 .cse0))) (or (and (or (not v_sorted1_12) (<= .cse1 .cse2)) (not v_sorted1_11)) (and v_sorted1_11 v_sorted1_12 (< .cse2 .cse1)))))) InVars {A=v_A_12, N=v_N_10, i=v_i_16, sorted1=v_sorted1_12} OutVars{A=v_A_12, N=v_N_10, i=v_i_15, sorted1=v_sorted1_11} AuxVars[] AssignedVars[i, sorted1] 47#[L62-1, L23-1]true [2023-10-12 17:40:45,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,278 INFO L85 PathProgramCache]: Analyzing trace with hash 4489, now seen corresponding path program 1 times [2023-10-12 17:40:45,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255751124] [2023-10-12 17:40:45,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash 133, now seen corresponding path program 1 times [2023-10-12 17:40:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673572655] [2023-10-12 17:40:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,399 INFO L85 PathProgramCache]: Analyzing trace with hash 139261, now seen corresponding path program 1 times [2023-10-12 17:40:45,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151331062] [2023-10-12 17:40:45,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,592 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:45,593 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:45,593 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:45,593 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:45,593 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:45,593 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,593 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:45,593 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:45,593 INFO L133 ssoRankerPreferences]: Filename of dumped script: sorted.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:40:45,594 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:45,594 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:45,612 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:40:45,622 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:40:45,626 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:40:45,690 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:40:45,693 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:40:45,820 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:45,824 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:45,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,830 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:40:45,833 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:40:45,839 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:40:45,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:45,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:45,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:45,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:45,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:45,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:45,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:45,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:45,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,902 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:40:45,904 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:40:45,906 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:40:45,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:45,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:45,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:45,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:45,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:45,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:45,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:45,939 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:40:45,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,941 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:40:45,952 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:40:45,952 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:40:45,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:45,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:45,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:45,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:45,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:45,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:45,981 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:46,004 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-10-12 17:40:46,004 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:40:46,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,129 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:40:46,130 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:40:46,132 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:46,139 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:46,140 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:46,141 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:40:46,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:40:46,151 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:40:46,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:46,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:46,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:46,216 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:46,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:46,217 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:40:46,263 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:40:46,368 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:40:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:40:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:40:46,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:40:46,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:46,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:46,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:46,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:40:46,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:46,387 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 60 transitions, 312 flow [2023-10-12 17:40:46,392 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:40:46,392 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 60 transitions, 312 flow [2023-10-12 17:40:46,395 ERROR L47 etriNetUnfolderRabin]: [1:1A:[111] $Ultimate##0-->L62: Formula: (and v_sorted3_17 v_sorted2_23 v_sorted1_23 (<= 0 v_M_18) (< v_M_18 v_N_20) (= v_i_23 v_j_23) (= v_M_18 v_k_21) (= v_i_23 0)) InVars {N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} OutVars{N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} AuxVars[] AssignedVars[][59], 2:2A:[87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[90] L62-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][14]][5:4A:[100] L34-1-->L34-1: Formula: (let ((.cse0 (+ v_j_16 1))) (and (= v_j_15 .cse0) (let ((.cse2 (select v_A_10 .cse0)) (.cse1 (select v_A_10 v_j_16))) (or (and (< .cse1 .cse2) v_sorted2_11 v_sorted2_12) (and (or (<= .cse2 .cse1) (not v_sorted2_12)) (not v_sorted2_11)))) (< v_j_16 v_M_10))) InVars {A=v_A_10, M=v_M_10, j=v_j_16, sorted2=v_sorted2_12} OutVars{A=v_A_10, M=v_M_10, j=v_j_15, sorted2=v_sorted2_11} AuxVars[] AssignedVars[j, sorted2][28]] [2023-10-12 17:40:46,396 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:46,396 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:40:46,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:46,396 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:46,396 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [111] $Ultimate##0-->L62: Formula: (and v_sorted3_17 v_sorted2_23 v_sorted1_23 (<= 0 v_M_18) (< v_M_18 v_N_20) (= v_i_23 v_j_23) (= v_M_18 v_k_21) (= v_i_23 0)) InVars {N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} OutVars{N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} AuxVars[] AssignedVars[] 45#[L62]true [87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 47#[L62-1, L23-1]true [90] L62-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 86#[L23-1, L63, L34-1]true [2023-10-12 17:40:46,396 INFO L750 eck$LassoCheckResult]: Loop: 86#[L23-1, L63, L34-1]true [100] L34-1-->L34-1: Formula: (let ((.cse0 (+ v_j_16 1))) (and (= v_j_15 .cse0) (let ((.cse2 (select v_A_10 .cse0)) (.cse1 (select v_A_10 v_j_16))) (or (and (< .cse1 .cse2) v_sorted2_11 v_sorted2_12) (and (or (<= .cse2 .cse1) (not v_sorted2_12)) (not v_sorted2_11)))) (< v_j_16 v_M_10))) InVars {A=v_A_10, M=v_M_10, j=v_j_16, sorted2=v_sorted2_12} OutVars{A=v_A_10, M=v_M_10, j=v_j_15, sorted2=v_sorted2_11} AuxVars[] AssignedVars[j, sorted2] 86#[L23-1, L63, L34-1]true [2023-10-12 17:40:46,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:46,398 INFO L85 PathProgramCache]: Analyzing trace with hash 139249, now seen corresponding path program 1 times [2023-10-12 17:40:46,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:46,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150579376] [2023-10-12 17:40:46,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:46,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:46,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:46,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:46,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:46,414 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 1 times [2023-10-12 17:40:46,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:46,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765641090] [2023-10-12 17:40:46,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:46,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:46,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:46,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:46,422 INFO L85 PathProgramCache]: Analyzing trace with hash 4316819, now seen corresponding path program 1 times [2023-10-12 17:40:46,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:46,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606920982] [2023-10-12 17:40:46,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:46,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:46,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:46,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:46,553 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:46,553 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:46,553 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:46,553 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:46,553 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:46,553 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,553 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:46,553 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:46,553 INFO L133 ssoRankerPreferences]: Filename of dumped script: sorted.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:40:46,554 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:46,554 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:46,555 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:40:46,558 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:40:46,560 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:40:46,609 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:40:46,612 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:40:46,615 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:40:46,617 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:40:46,749 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:46,750 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:46,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:46,764 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:40:46,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:40:46,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:46,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:46,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,793 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:40:46,800 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:40:46,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,800 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:40:46,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:46,837 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:40:46,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,838 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:40:46,848 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:40:46,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,868 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:40:46,880 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:46,898 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2023-10-12 17:40:46,898 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:40:46,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,901 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:40:46,903 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:40:46,904 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:46,930 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:46,931 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:46,931 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:40:46,938 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:40:46,941 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:40:46,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:46,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:46,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:46,972 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:46,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:46,973 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:40:46,974 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:40:47,066 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:40:47,068 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:40:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:40:47,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:47,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:47,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:47,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:47,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:40:47,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:47,076 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 240 transitions, 1728 flow [2023-10-12 17:40:47,076 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:40:47,076 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 240 transitions, 1728 flow [2023-10-12 17:40:47,080 ERROR L47 etriNetUnfolderRabin]: [1:1A:[111] $Ultimate##0-->L62: Formula: (and v_sorted3_17 v_sorted2_23 v_sorted1_23 (<= 0 v_M_18) (< v_M_18 v_N_20) (= v_i_23 v_j_23) (= v_M_18 v_k_21) (= v_i_23 0)) InVars {N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} OutVars{N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} AuxVars[] AssignedVars[][238], 2:2A:[87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][94], 4:3A:[90] L62-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][58], 7:4A:[93] L63-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][0]][8:5A:[106] L45-1-->L45-1: Formula: (let ((.cse0 (+ v_k_14 1))) (and (= v_k_13 .cse0) (let ((.cse2 (select v_A_14 v_k_14)) (.cse1 (select v_A_14 .cse0))) (or (and (or (<= .cse1 .cse2) (not v_sorted3_12)) (not v_sorted3_11)) (and v_sorted3_11 v_sorted3_12 (< .cse2 .cse1)))) (< .cse0 v_N_14))) InVars {A=v_A_14, N=v_N_14, k=v_k_14, sorted3=v_sorted3_12} OutVars{A=v_A_14, N=v_N_14, k=v_k_13, sorted3=v_sorted3_11} AuxVars[] AssignedVars[k, sorted3][161]] [2023-10-12 17:40:47,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:47,081 INFO L124 PetriNetUnfolderBase]: 2/7 cut-off events. [2023-10-12 17:40:47,081 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:40:47,081 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:47,081 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [111] $Ultimate##0-->L62: Formula: (and v_sorted3_17 v_sorted2_23 v_sorted1_23 (<= 0 v_M_18) (< v_M_18 v_N_20) (= v_i_23 v_j_23) (= v_M_18 v_k_21) (= v_i_23 0)) InVars {N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} OutVars{N=v_N_20, M=v_M_18, k=v_k_21, j=v_j_23, sorted1=v_sorted1_23, i=v_i_23, sorted2=v_sorted2_23, sorted3=v_sorted3_17} AuxVars[] AssignedVars[] 45#[L62]true [87] L62-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 47#[L62-1, L23-1]true [90] L62-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 86#[L23-1, L63, L34-1]true [93] L63-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 124#[L23-1, L64, L34-1, L45-1]true [2023-10-12 17:40:47,082 INFO L750 eck$LassoCheckResult]: Loop: 124#[L23-1, L64, L34-1, L45-1]true [106] L45-1-->L45-1: Formula: (let ((.cse0 (+ v_k_14 1))) (and (= v_k_13 .cse0) (let ((.cse2 (select v_A_14 v_k_14)) (.cse1 (select v_A_14 .cse0))) (or (and (or (<= .cse1 .cse2) (not v_sorted3_12)) (not v_sorted3_11)) (and v_sorted3_11 v_sorted3_12 (< .cse2 .cse1)))) (< .cse0 v_N_14))) InVars {A=v_A_14, N=v_N_14, k=v_k_14, sorted3=v_sorted3_12} OutVars{A=v_A_14, N=v_N_14, k=v_k_13, sorted3=v_sorted3_11} AuxVars[] AssignedVars[k, sorted3] 124#[L23-1, L64, L34-1, L45-1]true [2023-10-12 17:40:47,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash 4316812, now seen corresponding path program 1 times [2023-10-12 17:40:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:47,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240988460] [2023-10-12 17:40:47,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:47,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:47,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:47,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:47,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:47,111 INFO L85 PathProgramCache]: Analyzing trace with hash 137, now seen corresponding path program 1 times [2023-10-12 17:40:47,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:47,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112889491] [2023-10-12 17:40:47,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:47,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:47,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:47,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:47,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:47,119 INFO L85 PathProgramCache]: Analyzing trace with hash 133821278, now seen corresponding path program 1 times [2023-10-12 17:40:47,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:47,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113569091] [2023-10-12 17:40:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:47,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:47,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:47,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:47,296 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:47,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:47,297 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:47,297 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:47,297 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:47,297 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,297 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:47,297 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:47,297 INFO L133 ssoRankerPreferences]: Filename of dumped script: sorted.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:40:47,297 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:47,297 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:47,299 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:40:47,302 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:40:47,304 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:40:47,307 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:40:47,309 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:40:47,312 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:40:47,358 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:40:47,360 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:40:47,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:40:47,364 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:40:47,368 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:40:47,517 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:40:47,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:47,554 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:47,554 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:47,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:47,556 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:40:47,572 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:40:47,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:47,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:47,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:47,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:47,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:47,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:47,584 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:40:47,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:47,603 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:40:47,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:47,604 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:40:47,618 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:40:47,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:40:47,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:47,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:47,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:47,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:47,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:47,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:47,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:47,677 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:40:47,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:47,678 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:40:47,680 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:40:47,682 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:40:47,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:47,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:47,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:47,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:47,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:47,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:47,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:47,715 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:40:47,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:47,717 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:40:47,720 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:40:47,722 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:40:47,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:47,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:47,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:47,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:47,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:47,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:47,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:47,763 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:40:47,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:47,765 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:40:47,767 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:40:47,769 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:40:47,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:47,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:47,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:47,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:47,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:47,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:47,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:47,807 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:40:47,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:47,809 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:40:47,813 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:40:47,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:47,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:47,821 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:40:47,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:47,835 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:40:47,835 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:40:47,837 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:40:47,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:47,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:40:47,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:47,871 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:40:47,883 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:40:47,883 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:40:47,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:47,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:47,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:47,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:47,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:47,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:47,911 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:47,925 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:40:47,926 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:40:47,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:47,929 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:40:47,934 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:47,942 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:40:47,952 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:47,952 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:47,952 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:40:47,959 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:40:47,961 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:40:47,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:47,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:47,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:47,987 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:47,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:47,987 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:40:47,988 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:40:48,064 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:40:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 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:40:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:40:48,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:48,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:48,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:40:48,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:48,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:40:48,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:48,068 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 960 transitions, 8832 flow [2023-10-12 17:40:48,068 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:40:48,068 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 960 transitions, 8832 flow [2023-10-12 17:40:48,120 INFO L124 PetriNetUnfolderBase]: 90/133 cut-off events. [2023-10-12 17:40:48,120 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:40:48,120 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:40:48,126 INFO L201 PluginConnector]: Adding new model sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:40:48 BoogieIcfgContainer [2023-10-12 17:40:48,126 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:40:48,130 INFO L158 Benchmark]: Toolchain (without parser) took 4033.37ms. Allocated memory was 203.4MB in the beginning and 335.5MB in the end (delta: 132.1MB). Free memory was 154.6MB in the beginning and 257.0MB in the end (delta: -102.4MB). Peak memory consumption was 30.3MB. Max. memory is 8.0GB. [2023-10-12 17:40:48,131 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 203.4MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:40:48,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.77ms. Allocated memory is still 203.4MB. Free memory was 154.6MB in the beginning and 153.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:48,132 INFO L158 Benchmark]: Boogie Preprocessor took 16.29ms. Allocated memory is still 203.4MB. Free memory was 153.1MB in the beginning and 152.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:48,133 INFO L158 Benchmark]: RCFGBuilder took 292.85ms. Allocated memory is still 203.4MB. Free memory was 152.0MB in the beginning and 141.2MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:40:48,138 INFO L158 Benchmark]: BuchiAutomizer took 3695.65ms. Allocated memory was 203.4MB in the beginning and 335.5MB in the end (delta: 132.1MB). Free memory was 141.2MB in the beginning and 257.0MB in the end (delta: -115.8MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2023-10-12 17:40:48,139 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.27ms. Allocated memory is still 203.4MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.77ms. Allocated memory is still 203.4MB. Free memory was 154.6MB in the beginning and 153.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.29ms. Allocated memory is still 203.4MB. Free memory was 153.1MB in the beginning and 152.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 292.85ms. Allocated memory is still 203.4MB. Free memory was 152.0MB in the beginning and 141.2MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 3695.65ms. Allocated memory was 203.4MB in the beginning and 335.5MB in the end (delta: 132.1MB). Free memory was 141.2MB in the beginning and 257.0MB in the end (delta: -115.8MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 276 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 231 IncrementalHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 132 mSDtfsCounter, 231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital67 mio100 ax100 hnf100 lsp109 ukn59 mio100 lsp52 div100 bol136 ite100 ukn100 eq117 hnf94 smp100 dnf265 smp50 tf100 neg100 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms VariablesStem: 1 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 36 PlacesBefore, 22 PlacesAfterwards, 29 TransitionsBefore, 15 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 142 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 142, independent conditional: 0, independent unconditional: 142, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 82, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 82, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 82, unknown conditional: 0, unknown unconditional: 82] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:40:48,161 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:40:48,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...