/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/POPL2023/map-aggr-update1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:18:26,673 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:18:26,707 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:18:26,725 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:18:26,725 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:18:26,726 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:18:26,727 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:18:26,727 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:18:26,727 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:18:26,730 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:18:26,730 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:18:26,730 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:18:26,730 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:18:26,731 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:18:26,732 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:18:26,732 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:18:26,732 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:18:26,732 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:18:26,733 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:18:26,733 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:18:26,733 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:18:26,734 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:18:26,734 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:18:26,734 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:18:26,734 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:18:26,735 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:18:26,735 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:18:26,735 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:18:26,735 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:18:26,735 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:18:26,736 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:18:26,736 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:18:26,736 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:18:26,737 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:18:26,737 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:18:26,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:18:26,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:18:26,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:18:26,962 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:18:26,963 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:18:26,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl [2023-10-12 17:18:26,965 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update1.bpl' [2023-10-12 17:18:26,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:18:26,986 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:18:26,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:26,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:18:26,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:18:26,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:26" (1/1) ... [2023-10-12 17:18:27,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:26" (1/1) ... [2023-10-12 17:18:27,006 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:18:27,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:27,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:18:27,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:18:27,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:18:27,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:26" (1/1) ... [2023-10-12 17:18:27,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:26" (1/1) ... [2023-10-12 17:18:27,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:26" (1/1) ... [2023-10-12 17:18:27,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:26" (1/1) ... [2023-10-12 17:18:27,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:26" (1/1) ... [2023-10-12 17:18:27,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:26" (1/1) ... [2023-10-12 17:18:27,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:26" (1/1) ... [2023-10-12 17:18:27,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:26" (1/1) ... [2023-10-12 17:18:27,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:18:27,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:18:27,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:18:27,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:18:27,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:26" (1/1) ... [2023-10-12 17:18:27,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:27,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:27,056 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:18:27,086 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:18:27,121 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:18:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:18:27,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:18:27,124 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:18:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:18:27,125 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:18:27,125 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:18:27,125 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:18:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:18:27,126 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:18:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:18:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:18:27,127 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:18:27,166 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:18:27,167 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:18:27,272 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:18:27,277 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:18:27,277 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:18:27,278 INFO L201 PluginConnector]: Adding new model map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:27 BoogieIcfgContainer [2023-10-12 17:18:27,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:18:27,279 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:18:27,279 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:18:27,295 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:18:27,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:27,296 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:26" (1/2) ... [2023-10-12 17:18:27,297 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d2f5df and model type map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:18:27, skipping insertion in model container [2023-10-12 17:18:27,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:27,297 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:27" (2/2) ... [2023-10-12 17:18:27,298 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-aggr-update1.bpl [2023-10-12 17:18:27,349 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:18:27,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 104 flow [2023-10-12 17:18:27,401 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2023-10-12 17:18:27,401 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:18:27,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-10-12 17:18:27,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 40 transitions, 104 flow [2023-10-12 17:18:27,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 86 flow [2023-10-12 17:18:27,412 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:18:27,435 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 86 flow [2023-10-12 17:18:27,437 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 86 flow [2023-10-12 17:18:27,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 86 flow [2023-10-12 17:18:27,445 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2023-10-12 17:18:27,445 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:18:27,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 5/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-10-12 17:18:27,447 INFO L119 LiptonReduction]: Number of co-enabled transitions 456 [2023-10-12 17:18:27,912 INFO L134 LiptonReduction]: Checked pairs total: 360 [2023-10-12 17:18:27,912 INFO L136 LiptonReduction]: Total number of compositions: 18 [2023-10-12 17:18:27,921 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:18:27,921 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:18:27,921 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:18:27,922 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:18:27,922 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:18:27,922 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:18:27,922 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:18:27,922 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:18:27,922 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:18:27,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:27,925 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:18:27,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:27,925 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:27,927 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:18:27,927 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:18:27,928 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:27,928 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:18:27,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:27,928 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:27,932 INFO L748 eck$LassoCheckResult]: Stem: 46#[$Ultimate##0]true [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]true [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, $Ultimate##0]true [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 52#[L51-1, L34-1]true [2023-10-12 17:18:27,932 INFO L750 eck$LassoCheckResult]: Loop: 52#[L51-1, L34-1]true [137] L51-1-->L51-1: Formula: (and (= v_A_31 (store v_A_32 v_thread1Thread1of1ForFork0_i_26 (let ((.cse0 (select v_A_32 v_thread1Thread1of1ForFork0_i_26))) (ite (< .cse0 0) 0 .cse0)))) (= v_thread1Thread1of1ForFork0_i_25 (+ v_thread1Thread1of1ForFork0_i_26 1)) (< v_thread1Thread1of1ForFork0_i_26 v_N_28)) InVars {A=v_A_32, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_26} OutVars{A=v_A_31, N=v_N_28, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_25} AuxVars[] AssignedVars[A, thread1Thread1of1ForFork0_i] 52#[L51-1, L34-1]true [2023-10-12 17:18:27,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times [2023-10-12 17:18:27,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:27,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485680936] [2023-10-12 17:18:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:27,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:28,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:28,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:28,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:28,061 INFO L85 PathProgramCache]: Analyzing trace with hash 168, now seen corresponding path program 1 times [2023-10-12 17:18:28,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:28,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788029667] [2023-10-12 17:18:28,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:28,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:28,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:28,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash 3508593, now seen corresponding path program 1 times [2023-10-12 17:18:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:28,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358946445] [2023-10-12 17:18:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:28,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:28,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:28,159 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:28,159 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:28,160 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:28,160 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:28,160 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:28,160 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:28,160 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:28,160 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:28,160 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:18:28,160 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:28,160 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:28,171 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:18:28,177 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:18:28,223 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:28,225 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:28,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:28,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:28,233 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:18:28,234 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:18:28,235 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:18:28,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:28,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:28,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:28,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:28,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:28,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:28,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:28,278 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:18:28,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:28,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:28,293 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:18:28,344 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:18:28,344 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:18:28,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:28,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:28,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:28,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:28,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:28,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:28,384 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:28,392 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:18:28,392 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:18:28,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:28,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:28,396 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:18:28,445 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:18:28,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:28,455 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:28,455 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:28,455 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2023-10-12 17:18:28,477 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:18:28,480 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:28,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:28,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:28,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:28,522 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:28,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:28,523 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:18:28,553 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:18:28,554 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:28,684 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 342 transitions. [2023-10-12 17:18:28,686 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:28,689 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:28,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2023-10-12 17:18:28,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:18:28,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:28,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:18:28,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:28,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:18:28,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:28,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:28,762 INFO L124 PetriNetUnfolderBase]: 369/535 cut-off events. [2023-10-12 17:18:28,762 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-10-12 17:18:28,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 535 events. 369/535 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1687 event pairs, 1 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 1005. Up to 168 conditions per place. [2023-10-12 17:18:28,764 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:28,767 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:28,767 INFO L430 stractBuchiCegarLoop]: Abstraction has has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:28,767 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:18:28,767 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:28,773 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:28,773 INFO L124 PetriNetUnfolderBase]: 42/64 cut-off events. [2023-10-12 17:18:28,773 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:18:28,773 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:28,774 INFO L748 eck$LassoCheckResult]: Stem: 46#[$Ultimate##0]true [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]true [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, $Ultimate##0]true [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 101#[$Ultimate##0, $Ultimate##0, L35]true [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 103#[L51-1, $Ultimate##0, L35]true [134] $Ultimate##0-->L65-1: Formula: (and (= v_thread2Thread1of1ForFork1_cnt_23 0) (= v_thread2Thread1of1ForFork1_j_39 0)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_39, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 105#[L51-1, L65-1, L35]true [141] L65-1-->L65-1: Formula: (and (let ((.cse0 (= v_thread2Thread1of1ForFork1_j_59 (+ v_thread2Thread1of1ForFork1_j_60 1))) (.cse1 (select v_B_29 v_thread2Thread1of1ForFork1_j_60))) (or (and .cse0 (= v_thread2Thread1of1ForFork1_cnt_42 v_thread2Thread1of1ForFork1_cnt_41) (<= .cse1 0)) (and .cse0 (< 0 .cse1) (= v_thread2Thread1of1ForFork1_cnt_41 (+ v_thread2Thread1of1ForFork1_cnt_42 1))))) (let ((.cse3 (select v_A_39 v_thread2Thread1of1ForFork1_j_60)) (.cse2 (< v_thread2Thread1of1ForFork1_j_60 v_N_36))) (or (and (= v_thread2Thread1of1ForFork1_cnt_42 (+ v_thread2Thread1of1ForFork1_cnt_43 1)) .cse2 (< 0 .cse3)) (and (= v_thread2Thread1of1ForFork1_cnt_43 v_thread2Thread1of1ForFork1_cnt_42) (<= .cse3 0) .cse2)))) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_60, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_43} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_59, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_41} AuxVars[v_thread2Thread1of1ForFork1_cnt_42] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 105#[L51-1, L65-1, L35]true [2023-10-12 17:18:28,774 INFO L750 eck$LassoCheckResult]: Loop: 105#[L51-1, L65-1, L35]true [141] L65-1-->L65-1: Formula: (and (let ((.cse0 (= v_thread2Thread1of1ForFork1_j_59 (+ v_thread2Thread1of1ForFork1_j_60 1))) (.cse1 (select v_B_29 v_thread2Thread1of1ForFork1_j_60))) (or (and .cse0 (= v_thread2Thread1of1ForFork1_cnt_42 v_thread2Thread1of1ForFork1_cnt_41) (<= .cse1 0)) (and .cse0 (< 0 .cse1) (= v_thread2Thread1of1ForFork1_cnt_41 (+ v_thread2Thread1of1ForFork1_cnt_42 1))))) (let ((.cse3 (select v_A_39 v_thread2Thread1of1ForFork1_j_60)) (.cse2 (< v_thread2Thread1of1ForFork1_j_60 v_N_36))) (or (and (= v_thread2Thread1of1ForFork1_cnt_42 (+ v_thread2Thread1of1ForFork1_cnt_43 1)) .cse2 (< 0 .cse3)) (and (= v_thread2Thread1of1ForFork1_cnt_43 v_thread2Thread1of1ForFork1_cnt_42) (<= .cse3 0) .cse2)))) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_60, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_43} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_59, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_41} AuxVars[v_thread2Thread1of1ForFork1_cnt_42] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 105#[L51-1, L65-1, L35]true [141] L65-1-->L65-1: Formula: (and (let ((.cse0 (= v_thread2Thread1of1ForFork1_j_59 (+ v_thread2Thread1of1ForFork1_j_60 1))) (.cse1 (select v_B_29 v_thread2Thread1of1ForFork1_j_60))) (or (and .cse0 (= v_thread2Thread1of1ForFork1_cnt_42 v_thread2Thread1of1ForFork1_cnt_41) (<= .cse1 0)) (and .cse0 (< 0 .cse1) (= v_thread2Thread1of1ForFork1_cnt_41 (+ v_thread2Thread1of1ForFork1_cnt_42 1))))) (let ((.cse3 (select v_A_39 v_thread2Thread1of1ForFork1_j_60)) (.cse2 (< v_thread2Thread1of1ForFork1_j_60 v_N_36))) (or (and (= v_thread2Thread1of1ForFork1_cnt_42 (+ v_thread2Thread1of1ForFork1_cnt_43 1)) .cse2 (< 0 .cse3)) (and (= v_thread2Thread1of1ForFork1_cnt_43 v_thread2Thread1of1ForFork1_cnt_42) (<= .cse3 0) .cse2)))) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_60, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_43} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_59, A=v_A_39, N=v_N_36, B=v_B_29, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_41} AuxVars[v_thread2Thread1of1ForFork1_cnt_42] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_cnt] 105#[L51-1, L65-1, L35]true [2023-10-12 17:18:28,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash -922388278, now seen corresponding path program 1 times [2023-10-12 17:18:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219833685] [2023-10-12 17:18:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:28,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:28,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:28,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash 5473, now seen corresponding path program 1 times [2023-10-12 17:18:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:28,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554559223] [2023-10-12 17:18:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:28,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:28,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:28,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:28,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1651867670, now seen corresponding path program 2 times [2023-10-12 17:18:28,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:28,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880190742] [2023-10-12 17:18:28,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:28,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:28,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:28,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:28,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:18:29,486 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:29,486 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:29,486 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:29,486 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:29,486 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:29,486 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:29,486 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:29,487 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:29,487 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:18:29,487 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:29,487 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:29,527 WARN L176 XnfTransformerHelper]: Simplifying conjunction of 7803 disjunctions. This might take some time... [2023-10-12 17:18:32,594 INFO L192 XnfTransformerHelper]: Simplified to conjunction of 6737 disjunctions. [2023-10-12 17:18:32,631 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:18:32,633 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:18:43,078 WARN L223 SmtUtils]: Spent 10.33s on a formula simplification. DAG size of input: 739 DAG size of output: 58 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.setFormulaAndSimplify) [2023-10-12 17:18:43,081 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:18:43,111 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:18:43,114 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:18:43,367 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:18:43,368 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 22 [2023-10-12 17:18:45,099 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:45,099 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:45,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:45,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:45,101 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:18:45,116 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:18:45,116 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:18:45,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:45,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:45,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:45,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:45,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:45,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:45,142 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:45,147 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:18:45,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:45,149 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:18:45,174 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:18:45,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:45,180 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2023-10-12 17:18:45,180 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2023-10-12 17:18:45,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:45,196 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:18:45,554 INFO L401 nArgumentSynthesizer]: We have 672 Motzkin's Theorem applications. [2023-10-12 17:18:45,554 INFO L402 nArgumentSynthesizer]: A total of 32 supporting invariants were added. [2023-10-12 17:18:46,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:46,330 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:18:46,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:46,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:46,331 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:18:46,333 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:18:46,335 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:18:46,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:46,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:46,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:46,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:46,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:46,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:46,348 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:46,361 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:18:46,361 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:18:46,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:46,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:46,363 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:18:46,365 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:18:46,402 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:46,408 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:46,408 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:46,409 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2023-10-12 17:18:46,411 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:18:46,415 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:18:46,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:46,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:46,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:46,453 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:46,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:46,488 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2023-10-12 17:18:46,518 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:18:46,519 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:18:46,519 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:46,627 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 340 transitions. [2023-10-12 17:18:46,627 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:46,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:18:46,674 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:46,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2023-10-12 17:18:46,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:18:46,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:46,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:18:46,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:46,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:18:46,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:46,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 2304 transitions, 16128 flow [2023-10-12 17:18:46,817 INFO L124 PetriNetUnfolderBase]: 1372/1935 cut-off events. [2023-10-12 17:18:46,817 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2023-10-12 17:18:46,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6206 conditions, 1935 events. 1372/1935 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 7792 event pairs, 3 based on Foata normal form. 0/1102 useless extension candidates. Maximal degree in co-relation 5678. Up to 659 conditions per place. [2023-10-12 17:18:46,820 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 45 places, 2304 transitions, 16128 flow [2023-10-12 17:18:46,853 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 45 places, 2304 transitions, 16128 flow [2023-10-12 17:18:46,854 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 2304 transitions, 16128 flow [2023-10-12 17:18:46,854 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:18:46,854 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 2304 transitions, 16128 flow [2023-10-12 17:18:46,871 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:46,871 INFO L124 PetriNetUnfolderBase]: 67/108 cut-off events. [2023-10-12 17:18:46,871 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-10-12 17:18:46,871 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:46,872 INFO L748 eck$LassoCheckResult]: Stem: 46#[$Ultimate##0]true [83] $Ultimate##0-->L34: Formula: (and (< v_ULTIMATE.start_m_3 v_N_7) (<= 0 v_ULTIMATE.start_m_3)) InVars {ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} OutVars{ULTIMATE.start_m=v_ULTIMATE.start_m_3, N=v_N_7} AuxVars[] AssignedVars[] 48#[L34]true [114] L34-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i] 50#[L34-1, $Ultimate##0]true [117] L34-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_20, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_cnt=v_thread2Thread1of1ForFork1_cnt_12, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_cnt, thread2Thread1of1ForFork1_thidvar1] 101#[$Ultimate##0, $Ultimate##0, L35]true [88] $Ultimate##0-->L51-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i] 103#[L51-1, $Ultimate##0, L35]true [120] L35-->$Ultimate##0: 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, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_14} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0, thread3Thread1of1ForFork2_k] 169#[L51-1, $Ultimate##0, L36, $Ultimate##0]true [106] $Ultimate##0-->L83-1: Formula: (= v_thread3Thread1of1ForFork2_k_1 0) InVars {} OutVars{thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k] 171#[L51-1, $Ultimate##0, L83-1, L36]true [138] L83-1-->L83-1: Formula: (and (= v_thread3Thread1of1ForFork2_k_25 (+ v_thread3Thread1of1ForFork2_k_26 1)) (< v_thread3Thread1of1ForFork2_k_26 v_N_32) (= v_B_25 (store v_B_26 v_thread3Thread1of1ForFork2_k_26 v_thread3Thread1of1ForFork2_k_26))) InVars {N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_26, B=v_B_26} OutVars{N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_25, B=v_B_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k, B] 171#[L51-1, $Ultimate##0, L83-1, L36]true [2023-10-12 17:18:46,872 INFO L750 eck$LassoCheckResult]: Loop: 171#[L51-1, $Ultimate##0, L83-1, L36]true [138] L83-1-->L83-1: Formula: (and (= v_thread3Thread1of1ForFork2_k_25 (+ v_thread3Thread1of1ForFork2_k_26 1)) (< v_thread3Thread1of1ForFork2_k_26 v_N_32) (= v_B_25 (store v_B_26 v_thread3Thread1of1ForFork2_k_26 v_thread3Thread1of1ForFork2_k_26))) InVars {N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_26, B=v_B_26} OutVars{N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_25, B=v_B_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k, B] 171#[L51-1, $Ultimate##0, L83-1, L36]true [138] L83-1-->L83-1: Formula: (and (= v_thread3Thread1of1ForFork2_k_25 (+ v_thread3Thread1of1ForFork2_k_26 1)) (< v_thread3Thread1of1ForFork2_k_26 v_N_32) (= v_B_25 (store v_B_26 v_thread3Thread1of1ForFork2_k_26 v_thread3Thread1of1ForFork2_k_26))) InVars {N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_26, B=v_B_26} OutVars{N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_25, B=v_B_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k, B] 171#[L51-1, $Ultimate##0, L83-1, L36]true [2023-10-12 17:18:46,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1470720053, now seen corresponding path program 1 times [2023-10-12 17:18:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:46,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444463681] [2023-10-12 17:18:46,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:46,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:46,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:46,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:46,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash 5377, now seen corresponding path program 1 times [2023-10-12 17:18:46,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:46,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586042057] [2023-10-12 17:18:46,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:46,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:46,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:46,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:46,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:46,916 INFO L85 PathProgramCache]: Analyzing trace with hash 317734965, now seen corresponding path program 2 times [2023-10-12 17:18:46,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:46,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107636346] [2023-10-12 17:18:46,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:46,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:46,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:46,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:47,040 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:47,040 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:47,040 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:47,040 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:47,040 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:47,040 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:47,040 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:47,040 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:47,040 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update1.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:18:47,040 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:47,040 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:47,041 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:18:47,060 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:18:47,063 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:18:47,065 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:18:47,066 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:18:47,068 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:18:47,070 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:18:47,072 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:18:47,074 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:18:47,075 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:47,148 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:47,149 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:47,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:47,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:47,167 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:18:47,168 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:18:47,169 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:18:47,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:47,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:47,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:47,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:47,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:47,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:47,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:47,183 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:18:47,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:47,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:47,185 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:18:47,185 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:18:47,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:18:47,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:47,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:47,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:47,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:47,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:47,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:47,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:47,225 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:18:47,225 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:18:47,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:47,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:47,241 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:18:47,243 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:18:47,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:47,251 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:47,251 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:47,251 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread3Thread1of1ForFork2_k, N) = -1*thread3Thread1of1ForFork2_k + 1*N Supporting invariants [] [2023-10-12 17:18:47,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:18:47,259 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:18:47,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:47,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:47,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:47,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:47,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:47,300 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:18:47,301 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:18:47,301 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:18:47,439 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 453 transitions. [2023-10-12 17:18:47,439 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:47,627 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:47,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:47,628 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:18:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2023-10-12 17:18:47,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 226 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:18:47,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:47,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 226 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:18:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:47,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 226 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:18:47,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:47,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 34272 transitions, 308448 flow [2023-10-12 17:18:48,160 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:18:53,295 INFO L124 PetriNetUnfolderBase]: 4401/6167 cut-off events. [2023-10-12 17:18:53,296 INFO L125 PetriNetUnfolderBase]: For 1167/1167 co-relation queries the response was YES. [2023-10-12 17:18:53,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25597 conditions, 6167 events. 4401/6167 cut-off events. For 1167/1167 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 30088 event pairs, 7 based on Foata normal form. 0/3261 useless extension candidates. Maximal degree in co-relation 23417. Up to 2193 conditions per place. [2023-10-12 17:18:53,301 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 59 places, 34272 transitions, 308448 flow [2023-10-12 17:18:53,575 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 59 places, 34272 transitions, 308448 flow [2023-10-12 17:18:53,575 INFO L430 stractBuchiCegarLoop]: Abstraction has has 59 places, 34272 transitions, 308448 flow [2023-10-12 17:18:53,575 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:18:53,575 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 59 places, 34272 transitions, 308448 flow [2023-10-12 17:19:01,314 INFO L124 PetriNetUnfolderBase]: 4401/6167 cut-off events. [2023-10-12 17:19:01,314 INFO L125 PetriNetUnfolderBase]: For 1167/1167 co-relation queries the response was YES. [2023-10-12 17:19:01,314 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:19:01,323 INFO L201 PluginConnector]: Adding new model map-aggr-update1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:19:01 BoogieIcfgContainer [2023-10-12 17:19:01,323 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:19:01,324 INFO L158 Benchmark]: Toolchain (without parser) took 34336.89ms. Allocated memory was 191.9MB in the beginning and 1.2GB in the end (delta: 961.5MB). Free memory was 142.6MB in the beginning and 912.2MB in the end (delta: -769.6MB). Peak memory consumption was 617.6MB. Max. memory is 8.0GB. [2023-10-12 17:19:01,324 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 191.9MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:19:01,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.85ms. Allocated memory is still 191.9MB. Free memory was 142.5MB in the beginning and 141.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:19:01,324 INFO L158 Benchmark]: Boogie Preprocessor took 19.40ms. Allocated memory is still 191.9MB. Free memory was 141.0MB in the beginning and 139.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:19:01,325 INFO L158 Benchmark]: RCFGBuilder took 250.91ms. Allocated memory is still 191.9MB. Free memory was 139.9MB in the beginning and 160.5MB in the end (delta: -20.6MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2023-10-12 17:19:01,325 INFO L158 Benchmark]: BuchiAutomizer took 34043.76ms. Allocated memory was 191.9MB in the beginning and 1.2GB in the end (delta: 961.5MB). Free memory was 160.2MB in the beginning and 912.2MB in the end (delta: -752.0MB). Peak memory consumption was 633.9MB. Max. memory is 8.0GB. [2023-10-12 17:19:01,326 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.27ms. Allocated memory is still 191.9MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.85ms. Allocated memory is still 191.9MB. Free memory was 142.5MB in the beginning and 141.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.40ms. Allocated memory is still 191.9MB. Free memory was 141.0MB in the beginning and 139.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 250.91ms. Allocated memory is still 191.9MB. Free memory was 139.9MB in the beginning and 160.5MB in the end (delta: -20.6MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 34043.76ms. Allocated memory was 191.9MB in the beginning and 1.2GB in the end (delta: 961.5MB). Free memory was 160.2MB in the beginning and 912.2MB in the end (delta: -752.0MB). Peak memory consumption was 633.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. One deterministic module has affine ranking function N + -1 * j and consists of 3 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 33.9s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 18.5s. 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, 383 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 380 mSDsluCounter, 316 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 379 IncrementalHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 199 mSDtfsCounter, 379 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital209 mio100 ax100 hnf100 lsp1798 ukn29 mio100 lsp94 div100 bol100 ite100 ukn100 eq152 hnf95 smp100 dnf329 smp68 tf100 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 1166ms VariablesStem: 3 VariablesLoop: 6 DisjunctsStem: 4 DisjunctsLoop: 16 SupportingInvariants: 32 MotzkinApplications: 672 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - 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.5s, 39 PlacesBefore, 25 PlacesAfterwards, 34 TransitionsBefore, 18 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 2 ChoiceCompositions, 18 TotalNumberOfCompositions, 360 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 330, independent: 327, independent conditional: 0, independent unconditional: 327, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 249, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 249, independent: 242, independent conditional: 0, independent unconditional: 242, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 330, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 249, unknown conditional: 0, unknown unconditional: 249] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, 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:19:01,344 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...