/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/parray-copy.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:30:04,218 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:30:04,292 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:30:04,322 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:30:04,323 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:30:04,324 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:30:04,325 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:30:04,325 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:30:04,326 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:30:04,330 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:30:04,330 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:30:04,330 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:30:04,330 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:30:04,331 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:30:04,332 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:30:04,332 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:30:04,333 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:30:04,333 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:30:04,333 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:30:04,333 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:30:04,333 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:30:04,334 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:30:04,334 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:30:04,334 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:30:04,335 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:30:04,335 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:30:04,335 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:30:04,335 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:30:04,335 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:30:04,336 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:30:04,337 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:30:04,337 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:30:04,337 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:30:04,339 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:30:04,339 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:30:04,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:30:04,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:30:04,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:30:04,605 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:30:04,606 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:30:04,608 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/parray-copy.wvr.bpl [2023-10-12 17:30:04,608 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/parray-copy.wvr.bpl' [2023-10-12 17:30:04,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:30:04,638 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:30:04,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:30:04,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:30:04,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:30:04,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:04" (1/1) ... [2023-10-12 17:30:04,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:04" (1/1) ... [2023-10-12 17:30:04,662 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:30:04,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:30:04,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:30:04,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:30:04,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:30:04,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:04" (1/1) ... [2023-10-12 17:30:04,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:04" (1/1) ... [2023-10-12 17:30:04,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:04" (1/1) ... [2023-10-12 17:30:04,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:04" (1/1) ... [2023-10-12 17:30:04,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:04" (1/1) ... [2023-10-12 17:30:04,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:04" (1/1) ... [2023-10-12 17:30:04,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:04" (1/1) ... [2023-10-12 17:30:04,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:04" (1/1) ... [2023-10-12 17:30:04,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:30:04,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:30:04,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:30:04,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:30:04,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:04" (1/1) ... [2023-10-12 17:30:04,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:04,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:04,718 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:30:04,729 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:30:04,758 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:30:04,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:30:04,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:30:04,762 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:30:04,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:30:04,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:30:04,763 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:30:04,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:30:04,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:30:04,764 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:30:04,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:30:04,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:30:04,765 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:30:04,811 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:30:04,813 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:30:04,917 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:30:04,930 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:30:04,931 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:30:04,933 INFO L201 PluginConnector]: Adding new model parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:30:04 BoogieIcfgContainer [2023-10-12 17:30:04,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:30:04,934 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:30:04,934 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:30:04,937 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:30:04,938 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:30:04,938 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:30:04" (1/2) ... [2023-10-12 17:30:04,939 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41011911 and model type parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:30:04, skipping insertion in model container [2023-10-12 17:30:04,939 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:30:04,939 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:30:04" (2/2) ... [2023-10-12 17:30:04,941 INFO L332 chiAutomizerObserver]: Analyzing ICFG parray-copy.wvr.bpl [2023-10-12 17:30:04,990 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:30:05,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 34 transitions, 92 flow [2023-10-12 17:30:05,034 INFO L124 PetriNetUnfolderBase]: 3/28 cut-off events. [2023-10-12 17:30:05,035 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:30:05,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 3/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2023-10-12 17:30:05,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 34 transitions, 92 flow [2023-10-12 17:30:05,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 74 flow [2023-10-12 17:30:05,058 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:30:05,080 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 74 flow [2023-10-12 17:30:05,087 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 74 flow [2023-10-12 17:30:05,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 74 flow [2023-10-12 17:30:05,098 INFO L124 PetriNetUnfolderBase]: 3/28 cut-off events. [2023-10-12 17:30:05,098 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:30:05,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 3/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2023-10-12 17:30:05,099 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:30:05,423 INFO L134 LiptonReduction]: Checked pairs total: 124 [2023-10-12 17:30:05,424 INFO L136 LiptonReduction]: Total number of compositions: 14 [2023-10-12 17:30:05,437 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:30:05,438 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:30:05,438 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:30:05,438 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:30:05,438 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:30:05,438 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:30:05,438 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:30:05,438 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:30:05,440 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:30:05,445 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:05,446 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:30:05,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:30:05,448 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:05,454 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:30:05,454 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:30:05,456 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:05,456 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:30:05,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:30:05,456 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:05,461 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [108] $Ultimate##0-->L60: Formula: (and (<= 0 v_M_16) (= v_i_21 v_j_21) (< v_M_16 v_N_21) (= v_M_16 v_k_21) (< v_l_12 v_N_21) (<= 0 v_l_12) (= v_i_21 0)) InVars {N=v_N_21, M=v_M_16, l=v_l_12, k=v_k_21, j=v_j_21, i=v_i_21} OutVars{N=v_N_21, M=v_M_16, l=v_l_12, k=v_k_21, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 44#[L60]true [85] L60-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L22-1, L60-1]true [2023-10-12 17:30:05,461 INFO L750 eck$LassoCheckResult]: Loop: 46#[L22-1, L60-1]true [103] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_B_28 (store v_B_29 v_i_16 (select v_A_15 v_i_16))) (< v_i_16 v_N_15)) InVars {A=v_A_15, N=v_N_15, i=v_i_16, B=v_B_29} OutVars{A=v_A_15, N=v_N_15, i=v_i_15, B=v_B_28} AuxVars[] AssignedVars[i, B] 46#[L22-1, L60-1]true [2023-10-12 17:30:05,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:05,470 INFO L85 PathProgramCache]: Analyzing trace with hash 4394, now seen corresponding path program 1 times [2023-10-12 17:30:05,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:05,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558877621] [2023-10-12 17:30:05,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:05,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:05,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:05,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:05,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash 134, now seen corresponding path program 1 times [2023-10-12 17:30:05,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:05,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59970046] [2023-10-12 17:30:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:05,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:05,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:05,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:05,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:05,620 INFO L85 PathProgramCache]: Analyzing trace with hash 136317, now seen corresponding path program 1 times [2023-10-12 17:30:05,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:05,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401306722] [2023-10-12 17:30:05,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:05,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:05,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:05,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:05,751 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:05,752 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:05,753 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:05,753 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:05,753 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:05,753 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:05,753 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:05,753 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:05,753 INFO L133 ssoRankerPreferences]: Filename of dumped script: parray-copy.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:30:05,753 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:05,754 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:05,768 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:30:05,778 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:30:05,782 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:30:05,880 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:05,884 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:05,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:05,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:05,897 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:30:05,906 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:30:05,909 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:30:05,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:05,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:05,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:05,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:05,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:05,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:05,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:05,945 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:30:05,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:05,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:05,947 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:30:05,956 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:30:05,959 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:30:05,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:05,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:05,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:05,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:05,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:05,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:05,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:05,995 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:30:05,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:05,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:05,997 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:30:05,999 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:30:06,002 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:30:06,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:06,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:06,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:06,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:06,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:06,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:06,030 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:06,044 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:30:06,045 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:30:06,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:06,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:06,057 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:30:06,058 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:30:06,059 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:06,070 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:06,071 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:06,071 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:30:06,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:06,079 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:30:06,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:06,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:06,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:06,122 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:30:06,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:06,122 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:30:06,154 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:30:06,155 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:06,291 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 280 transitions. [2023-10-12 17:30:06,292 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:06,296 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:06,298 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:30:06,302 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:30:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2023-10-12 17:30:06,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 192 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:30:06,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:06,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 192 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:30:06,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:06,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 192 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:30:06,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:06,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:06,337 INFO L124 PetriNetUnfolderBase]: 135/207 cut-off events. [2023-10-12 17:30:06,337 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-10-12 17:30:06,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 207 events. 135/207 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 552 event pairs, 10 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 344. Up to 71 conditions per place. [2023-10-12 17:30:06,338 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:06,342 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:06,342 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:06,342 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:30:06,342 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:30:06,349 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:06,349 INFO L124 PetriNetUnfolderBase]: 26/40 cut-off events. [2023-10-12 17:30:06,349 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:30:06,349 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:06,350 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [108] $Ultimate##0-->L60: Formula: (and (<= 0 v_M_16) (= v_i_21 v_j_21) (< v_M_16 v_N_21) (= v_M_16 v_k_21) (< v_l_12 v_N_21) (<= 0 v_l_12) (= v_i_21 0)) InVars {N=v_N_21, M=v_M_16, l=v_l_12, k=v_k_21, j=v_j_21, i=v_i_21} OutVars{N=v_N_21, M=v_M_16, l=v_l_12, k=v_k_21, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 44#[L60]true [85] L60-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L22-1, L60-1]true [88] L60-1-->L33-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] 91#[L22-1, L61, L33-1]true [2023-10-12 17:30:06,350 INFO L750 eck$LassoCheckResult]: Loop: 91#[L22-1, L61, L33-1]true [101] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= v_B_24 (store v_B_25 v_j_16 (select v_A_13 v_j_16))) (< v_j_16 v_M_10)) InVars {A=v_A_13, M=v_M_10, j=v_j_16, B=v_B_25} OutVars{A=v_A_13, M=v_M_10, j=v_j_15, B=v_B_24} AuxVars[] AssignedVars[j, B] 91#[L22-1, L61, L33-1]true [101] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= v_B_24 (store v_B_25 v_j_16 (select v_A_13 v_j_16))) (< v_j_16 v_M_10)) InVars {A=v_A_13, M=v_M_10, j=v_j_16, B=v_B_25} OutVars{A=v_A_13, M=v_M_10, j=v_j_15, B=v_B_24} AuxVars[] AssignedVars[j, B] 91#[L22-1, L61, L33-1]true [2023-10-12 17:30:06,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash 136302, now seen corresponding path program 1 times [2023-10-12 17:30:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:06,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224479580] [2023-10-12 17:30:06,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:06,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:06,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:06,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:06,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash 4193, now seen corresponding path program 1 times [2023-10-12 17:30:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908927853] [2023-10-12 17:30:06,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:06,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:06,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:06,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:06,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:06,384 INFO L85 PathProgramCache]: Analyzing trace with hash 130989454, now seen corresponding path program 1 times [2023-10-12 17:30:06,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:06,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835134516] [2023-10-12 17:30:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:06,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:06,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:06,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:06,537 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:06,537 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:06,538 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:06,538 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:06,538 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:06,538 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:06,538 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:06,538 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:06,538 INFO L133 ssoRankerPreferences]: Filename of dumped script: parray-copy.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:30:06,538 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:06,538 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:06,540 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:06,543 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:30:06,545 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:30:06,578 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:30:06,581 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:30:06,675 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:06,676 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:06,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:06,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:06,681 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:30:06,685 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:30:06,687 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:30:06,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:06,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:06,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:06,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:06,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:06,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:06,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:06,720 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:30:06,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:06,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:06,725 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:30:06,729 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:30:06,730 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:30:06,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:06,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:06,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:06,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:06,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:06,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:06,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:06,767 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:30:06,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:06,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:06,769 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:30:06,773 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:30:06,776 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:30:06,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:06,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:30:06,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:06,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:06,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:06,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:30:06,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:30:06,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:06,805 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:30:06,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:06,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:06,807 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:30:06,815 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:30:06,815 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:30:06,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:06,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:06,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:06,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:06,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:06,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:06,849 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:06,867 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:30:06,867 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:30:06,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:06,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:06,910 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:30:06,912 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:30:06,949 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:06,963 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:06,963 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:06,963 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:30:06,972 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:30:06,977 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:30:06,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:06,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:06,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:07,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:30:07,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:07,023 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:30:07,023 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:07,168 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:30:07,175 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:30:07,177 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 370 transitions. [2023-10-12 17:30:07,177 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:07,207 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:30:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-10-12 17:30:07,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:30:07,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:07,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:30:07,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:07,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:30:07,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:07,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:07,305 INFO L124 PetriNetUnfolderBase]: 383/568 cut-off events. [2023-10-12 17:30:07,305 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-10-12 17:30:07,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1875 conditions, 568 events. 383/568 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1997 event pairs, 16 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 1278. Up to 202 conditions per place. [2023-10-12 17:30:07,307 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:07,346 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:07,347 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:07,347 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:30:07,347 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:30:07,396 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:07,396 INFO L124 PetriNetUnfolderBase]: 223/306 cut-off events. [2023-10-12 17:30:07,396 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-10-12 17:30:07,396 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:07,397 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [108] $Ultimate##0-->L60: Formula: (and (<= 0 v_M_16) (= v_i_21 v_j_21) (< v_M_16 v_N_21) (= v_M_16 v_k_21) (< v_l_12 v_N_21) (<= 0 v_l_12) (= v_i_21 0)) InVars {N=v_N_21, M=v_M_16, l=v_l_12, k=v_k_21, j=v_j_21, i=v_i_21} OutVars{N=v_N_21, M=v_M_16, l=v_l_12, k=v_k_21, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 44#[L60]true [85] L60-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L22-1, L60-1]true [102] L22-1-->thread1EXIT: Formula: (<= v_N_13 v_i_13) InVars {N=v_N_13, i=v_i_13} OutVars{N=v_N_13, i=v_i_13} AuxVars[] AssignedVars[] 148#[L60-1, thread1EXIT]true [88] L60-1-->L33-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] 150#[L61, L33-1, thread1EXIT]true [91] L61-->L44-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] 152#[L62, L33-1, L44-1, thread1EXIT]true [2023-10-12 17:30:07,397 INFO L750 eck$LassoCheckResult]: Loop: 152#[L62, L33-1, L44-1, thread1EXIT]true [98] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_B_20 (store v_B_21 v_k_16 (select v_A_11 v_k_16))) (< v_k_16 v_N_11)) InVars {A=v_A_11, N=v_N_11, k=v_k_16, B=v_B_21} OutVars{A=v_A_11, N=v_N_11, k=v_k_15, B=v_B_20} AuxVars[] AssignedVars[k, B] 152#[L62, L33-1, L44-1, thread1EXIT]true [98] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_B_20 (store v_B_21 v_k_16 (select v_A_11 v_k_16))) (< v_k_16 v_N_11)) InVars {A=v_A_11, N=v_N_11, k=v_k_16, B=v_B_21} OutVars{A=v_A_11, N=v_N_11, k=v_k_15, B=v_B_20} AuxVars[] AssignedVars[k, B] 152#[L62, L33-1, L44-1, thread1EXIT]true [2023-10-12 17:30:07,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:07,398 INFO L85 PathProgramCache]: Analyzing trace with hash 131002495, now seen corresponding path program 1 times [2023-10-12 17:30:07,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:07,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218081758] [2023-10-12 17:30:07,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:07,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:07,441 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:30:07,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:30:07,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218081758] [2023-10-12 17:30:07,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218081758] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:30:07,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:30:07,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:30:07,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167291603] [2023-10-12 17:30:07,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:30:07,445 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:30:07,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:07,445 INFO L85 PathProgramCache]: Analyzing trace with hash 4097, now seen corresponding path program 1 times [2023-10-12 17:30:07,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:07,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173553671] [2023-10-12 17:30:07,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:07,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:30:07,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:30:07,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:30:07,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 2608 transitions, 19104 flow. Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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:30:07,487 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:30:07,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:30:07,678 INFO L124 PetriNetUnfolderBase]: 455/686 cut-off events. [2023-10-12 17:30:07,678 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-10-12 17:30:07,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 686 events. 455/686 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2524 event pairs, 2 based on Foata normal form. 34/418 useless extension candidates. Maximal degree in co-relation 2172. Up to 578 conditions per place. [2023-10-12 17:30:07,689 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 169 selfloop transitions, 6 changer transitions 45/220 dead transitions. [2023-10-12 17:30:07,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 220 transitions, 1964 flow [2023-10-12 17:30:07,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 220 transitions, 1964 flow [2023-10-12 17:30:07,745 INFO L124 PetriNetUnfolderBase]: 455/686 cut-off events. [2023-10-12 17:30:07,745 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-10-12 17:30:07,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 686 events. 455/686 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2521 event pairs, 2 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 2172. Up to 578 conditions per place. [2023-10-12 17:30:07,747 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 38 places, 220 transitions, 1964 flow [2023-10-12 17:30:07,750 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 38 places, 220 transitions, 1964 flow [2023-10-12 17:30:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:30:07,752 INFO L430 stractBuchiCegarLoop]: Abstraction has has 38 places, 220 transitions, 1964 flow [2023-10-12 17:30:07,752 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:30:07,752 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 places, 220 transitions, 1964 flow [2023-10-12 17:30:07,781 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:30:07,782 INFO L124 PetriNetUnfolderBase]: 181/264 cut-off events. [2023-10-12 17:30:07,782 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-10-12 17:30:07,782 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:30:07,782 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [108] $Ultimate##0-->L60: Formula: (and (<= 0 v_M_16) (= v_i_21 v_j_21) (< v_M_16 v_N_21) (= v_M_16 v_k_21) (< v_l_12 v_N_21) (<= 0 v_l_12) (= v_i_21 0)) InVars {N=v_N_21, M=v_M_16, l=v_l_12, k=v_k_21, j=v_j_21, i=v_i_21} OutVars{N=v_N_21, M=v_M_16, l=v_l_12, k=v_k_21, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 44#[L60]true [85] L60-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L22-1, L60-1]true [88] L60-1-->L33-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] 91#[L22-1, L61, L33-1]true [103] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_B_28 (store v_B_29 v_i_16 (select v_A_15 v_i_16))) (< v_i_16 v_N_15)) InVars {A=v_A_15, N=v_N_15, i=v_i_16, B=v_B_29} OutVars{A=v_A_15, N=v_N_15, i=v_i_15, B=v_B_28} AuxVars[] AssignedVars[i, B] 91#[L22-1, L61, L33-1]true [100] L33-1-->thread2EXIT: Formula: (<= v_M_8 v_j_13) InVars {M=v_M_8, j=v_j_13} OutVars{M=v_M_8, j=v_j_13} AuxVars[] AssignedVars[] 168#[L22-1, L61, thread2EXIT]true [91] L61-->L44-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] 170#[L22-1, L62, thread2EXIT, L44-1]true [98] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_B_20 (store v_B_21 v_k_16 (select v_A_11 v_k_16))) (< v_k_16 v_N_11)) InVars {A=v_A_11, N=v_N_11, k=v_k_16, B=v_B_21} OutVars{A=v_A_11, N=v_N_11, k=v_k_15, B=v_B_20} AuxVars[] AssignedVars[k, B] 170#[L22-1, L62, thread2EXIT, L44-1]true [2023-10-12 17:30:07,783 INFO L750 eck$LassoCheckResult]: Loop: 170#[L22-1, L62, thread2EXIT, L44-1]true [98] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_B_20 (store v_B_21 v_k_16 (select v_A_11 v_k_16))) (< v_k_16 v_N_11)) InVars {A=v_A_11, N=v_N_11, k=v_k_16, B=v_B_21} OutVars{A=v_A_11, N=v_N_11, k=v_k_15, B=v_B_20} AuxVars[] AssignedVars[k, B] 170#[L22-1, L62, thread2EXIT, L44-1]true [98] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_B_20 (store v_B_21 v_k_16 (select v_A_11 v_k_16))) (< v_k_16 v_N_11)) InVars {A=v_A_11, N=v_N_11, k=v_k_16, B=v_B_21} OutVars{A=v_A_11, N=v_N_11, k=v_k_15, B=v_B_20} AuxVars[] AssignedVars[k, B] 170#[L22-1, L62, thread2EXIT, L44-1]true [2023-10-12 17:30:07,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1326875250, now seen corresponding path program 1 times [2023-10-12 17:30:07,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:07,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117809477] [2023-10-12 17:30:07,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:07,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:07,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:07,817 INFO L85 PathProgramCache]: Analyzing trace with hash 4097, now seen corresponding path program 2 times [2023-10-12 17:30:07,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:07,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951740593] [2023-10-12 17:30:07,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:07,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:07,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash -478168526, now seen corresponding path program 2 times [2023-10-12 17:30:07,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:30:07,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097399387] [2023-10-12 17:30:07,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:30:07,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:30:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:30:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:30:07,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:30:08,048 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:30:08,048 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:30:08,048 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:30:08,048 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:30:08,048 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:30:08,048 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:08,050 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:30:08,050 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:30:08,052 INFO L133 ssoRankerPreferences]: Filename of dumped script: parray-copy.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:30:08,052 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:30:08,052 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:30:08,058 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:30:08,137 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:30:08,139 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:30:08,143 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:30:08,145 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:30:08,152 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:30:08,155 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:30:08,157 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:30:08,159 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:30:08,295 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:30:08,295 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:30:08,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:08,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:08,297 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:30:08,305 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:30:08,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:08,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:30:08,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:08,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:08,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:08,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:30:08,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:30:08,316 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:30:08,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:30:08,333 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:30:08,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:08,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:08,334 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:30:08,341 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:30:08,341 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:30:08,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:30:08,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:30:08,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:30:08,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:30:08,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:30:08,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:30:08,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:30:08,370 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:30:08,371 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:30:08,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:30:08,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:30:08,372 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:30:08,375 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:30:08,376 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:30:08,394 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:30:08,394 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:30:08,394 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:30:08,398 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:30:08,407 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:30:08,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:30:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:08,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:30:08,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:30:08,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:30:08,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:30:08,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:30:08,455 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:30:08,455 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:08,571 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 370 transitions. [2023-10-12 17:30:08,571 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:30:08,590 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:30:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:30:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:30:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-10-12 17:30:08,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:30:08,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:08,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:30:08,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:08,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:30:08,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:30:08,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 3326 transitions, 36524 flow [2023-10-12 17:30:08,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:30:09,157 INFO L124 PetriNetUnfolderBase]: 1380/2078 cut-off events. [2023-10-12 17:30:09,157 INFO L125 PetriNetUnfolderBase]: For 446/446 co-relation queries the response was YES. [2023-10-12 17:30:09,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10799 conditions, 2078 events. 1380/2078 cut-off events. For 446/446 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 9847 event pairs, 2 based on Foata normal form. 0/1137 useless extension candidates. Maximal degree in co-relation 8201. Up to 1788 conditions per place. [2023-10-12 17:30:09,160 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 52 places, 3326 transitions, 36524 flow [2023-10-12 17:30:09,220 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 52 places, 3326 transitions, 36524 flow [2023-10-12 17:30:09,220 INFO L430 stractBuchiCegarLoop]: Abstraction has has 52 places, 3326 transitions, 36524 flow [2023-10-12 17:30:09,220 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:30:09,221 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 places, 3326 transitions, 36524 flow [2023-10-12 17:30:09,722 INFO L124 PetriNetUnfolderBase]: 1380/2078 cut-off events. [2023-10-12 17:30:09,722 INFO L125 PetriNetUnfolderBase]: For 446/446 co-relation queries the response was YES. [2023-10-12 17:30:09,722 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:30:09,728 INFO L201 PluginConnector]: Adding new model parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:30:09 BoogieIcfgContainer [2023-10-12 17:30:09,728 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:30:09,729 INFO L158 Benchmark]: Toolchain (without parser) took 5090.44ms. Allocated memory was 179.3MB in the beginning and 318.8MB in the end (delta: 139.5MB). Free memory was 132.0MB in the beginning and 153.6MB in the end (delta: -21.6MB). Peak memory consumption was 176.1MB. Max. memory is 8.0GB. [2023-10-12 17:30:09,729 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 179.3MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:30:09,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.61ms. Allocated memory is still 179.3MB. Free memory was 132.0MB in the beginning and 130.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:09,730 INFO L158 Benchmark]: Boogie Preprocessor took 21.18ms. Allocated memory is still 179.3MB. Free memory was 130.4MB in the beginning and 129.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:09,730 INFO L158 Benchmark]: RCFGBuilder took 245.66ms. Allocated memory is still 179.3MB. Free memory was 129.3MB in the beginning and 119.4MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:30:09,731 INFO L158 Benchmark]: BuchiAutomizer took 4794.34ms. Allocated memory was 179.3MB in the beginning and 318.8MB in the end (delta: 139.5MB). Free memory was 119.3MB in the beginning and 153.6MB in the end (delta: -34.3MB). Peak memory consumption was 163.5MB. Max. memory is 8.0GB. [2023-10-12 17:30:09,732 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.26ms. Allocated memory is still 179.3MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.61ms. Allocated memory is still 179.3MB. Free memory was 132.0MB in the beginning and 130.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.18ms. Allocated memory is still 179.3MB. Free memory was 130.4MB in the beginning and 129.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 245.66ms. Allocated memory is still 179.3MB. Free memory was 129.3MB in the beginning and 119.4MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 4794.34ms. Allocated memory was 179.3MB in the beginning and 318.8MB in the end (delta: 139.5MB). Free memory was 119.3MB in the beginning and 153.6MB in the end (delta: -34.3MB). Peak memory consumption was 163.5MB. 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 4 terminating modules (1 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 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 1.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. 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: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 352 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 281 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 407 IncrementalHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 159 mSDtfsCounter, 407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital63 mio100 ax100 hnf100 lsp78 ukn70 mio100 lsp84 div100 bol100 ite100 ukn100 eq151 hnf92 smp100 dnf100 smp100 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - 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.3s, 35 PlacesBefore, 22 PlacesAfterwards, 28 TransitionsBefore, 15 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 3 FixpointIterations, 8 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 124, independent conditional: 0, independent unconditional: 124, 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: 124, independent: 42, independent conditional: 0, independent unconditional: 42, 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:30:09,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...