/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-update3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:18:32,942 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:18:32,984 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:33,005 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:18:33,005 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:18:33,006 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:18:33,007 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:18:33,007 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:18:33,007 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:18:33,010 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:18:33,010 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:18:33,011 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:18:33,011 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:18:33,012 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:18:33,012 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:18:33,012 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:18:33,012 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:18:33,012 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:18:33,012 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:18:33,012 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:18:33,013 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:18:33,013 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:18:33,013 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:18:33,013 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:18:33,013 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:18:33,013 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:18:33,014 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:18:33,014 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:18:33,014 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:18:33,014 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:18:33,015 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:18:33,015 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:18:33,015 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:18:33,017 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:18:33,017 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:33,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:18:33,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:18:33,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:18:33,255 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:18:33,257 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:18:33,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl [2023-10-12 17:18:33,258 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/map-aggr-update3.bpl' [2023-10-12 17:18:33,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:18:33,277 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:18:33,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:33,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:18:33,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:18:33,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:33" (1/1) ... [2023-10-12 17:18:33,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:33" (1/1) ... [2023-10-12 17:18:33,300 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:18:33,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:33,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:18:33,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:18:33,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:18:33,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:33" (1/1) ... [2023-10-12 17:18:33,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:33" (1/1) ... [2023-10-12 17:18:33,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:33" (1/1) ... [2023-10-12 17:18:33,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:33" (1/1) ... [2023-10-12 17:18:33,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:33" (1/1) ... [2023-10-12 17:18:33,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:33" (1/1) ... [2023-10-12 17:18:33,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:33" (1/1) ... [2023-10-12 17:18:33,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:33" (1/1) ... [2023-10-12 17:18:33,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:18:33,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:18:33,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:18:33,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:18:33,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:33" (1/1) ... [2023-10-12 17:18:33,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:33,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:33,350 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:33,370 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:33,394 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:18:33,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:18:33,395 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:18:33,395 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:18:33,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:18:33,395 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:18:33,395 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:18:33,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:18:33,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:18:33,396 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:18:33,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:18:33,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:18:33,397 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:33,434 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:18:33,436 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:18:33,520 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:18:33,524 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:18:33,525 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:18:33,526 INFO L201 PluginConnector]: Adding new model map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:33 BoogieIcfgContainer [2023-10-12 17:18:33,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:18:33,527 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:18:33,527 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:18:33,536 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:18:33,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:33,537 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:33" (1/2) ... [2023-10-12 17:18:33,538 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bd3581 and model type map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:18:33, skipping insertion in model container [2023-10-12 17:18:33,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:33,538 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:33" (2/2) ... [2023-10-12 17:18:33,539 INFO L332 chiAutomizerObserver]: Analyzing ICFG map-aggr-update3.bpl [2023-10-12 17:18:33,631 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:18:33,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 40 transitions, 104 flow [2023-10-12 17:18:33,682 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2023-10-12 17:18:33,682 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:18:33,686 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:33,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 40 transitions, 104 flow [2023-10-12 17:18:33,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 86 flow [2023-10-12 17:18:33,692 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:18:33,701 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 34 transitions, 86 flow [2023-10-12 17:18:33,703 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 34 transitions, 86 flow [2023-10-12 17:18:33,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 86 flow [2023-10-12 17:18:33,715 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2023-10-12 17:18:33,715 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:18:33,716 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:33,717 INFO L119 LiptonReduction]: Number of co-enabled transitions 456 [2023-10-12 17:18:34,200 INFO L134 LiptonReduction]: Checked pairs total: 360 [2023-10-12 17:18:34,201 INFO L136 LiptonReduction]: Total number of compositions: 18 [2023-10-12 17:18:34,211 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:18:34,211 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:18:34,211 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:18:34,211 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:18:34,211 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:18:34,211 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:18:34,212 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:18:34,212 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:18:34,212 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:18:34,215 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:34,215 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:18:34,215 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:34,215 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:34,217 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:18:34,218 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:18:34,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:34,219 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:18:34,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:34,219 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:34,222 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:34,222 INFO L750 eck$LassoCheckResult]: Loop: 52#[L51-1, L34-1]true [137] L51-1-->L51-1: Formula: (and (= v_thread1Thread1of1ForFork0_i_25 (+ v_thread1Thread1of1ForFork0_i_26 1)) (= (store v_A_32 v_thread1Thread1of1ForFork0_i_26 (let ((.cse0 (select v_A_32 v_thread1Thread1of1ForFork0_i_26))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_31) (< 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:34,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash 113176, now seen corresponding path program 1 times [2023-10-12 17:18:34,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:34,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172885320] [2023-10-12 17:18:34,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:34,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:34,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:34,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:34,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash 168, now seen corresponding path program 1 times [2023-10-12 17:18:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:34,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113134298] [2023-10-12 17:18:34,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:34,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:34,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:34,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:34,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:34,334 INFO L85 PathProgramCache]: Analyzing trace with hash 3508593, now seen corresponding path program 1 times [2023-10-12 17:18:34,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:34,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691890373] [2023-10-12 17:18:34,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:34,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:34,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:34,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:34,452 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:34,453 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:34,453 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:34,453 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:34,453 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:34,453 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:34,453 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:34,454 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:34,454 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update3.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:18:34,454 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:34,454 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:34,475 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:34,485 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:34,554 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:34,556 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:34,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:34,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:34,560 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:34,571 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:34,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:18:34,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:34,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:34,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:34,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:34,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:34,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:34,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:34,611 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:34,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:34,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:34,612 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:34,614 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:34,616 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:34,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:34,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:34,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:34,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:34,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:34,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:34,644 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:34,671 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:18:34,671 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:18:34,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:34,675 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:34,676 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:34,677 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:34,686 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:34,686 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:34,686 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:34,691 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:34,693 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:34,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:34,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:34,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:34,742 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:34,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:34,743 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:34,778 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:34,779 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:34,909 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:34,911 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:34,919 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:34,924 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:34,928 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:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2023-10-12 17:18:34,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:18:34,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:34,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:18:34,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:34,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 170 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:18:34,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:34,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:35,007 INFO L124 PetriNetUnfolderBase]: 369/535 cut-off events. [2023-10-12 17:18:35,007 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-10-12 17:18:35,010 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:35,011 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:35,015 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:35,015 INFO L430 stractBuchiCegarLoop]: Abstraction has has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:35,015 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:18:35,015 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:35,024 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:35,024 INFO L124 PetriNetUnfolderBase]: 42/64 cut-off events. [2023-10-12 17:18:35,025 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:18:35,025 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:35,028 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 1) 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 (= (select v_A_39 v_thread2Thread1of1ForFork1_j_60) 0)) (.cse1 (< v_thread2Thread1of1ForFork1_j_60 v_N_36))) (or (and .cse0 (= v_thread2Thread1of1ForFork1_cnt_42 (+ v_thread2Thread1of1ForFork1_cnt_43 1)) .cse1) (and (= v_thread2Thread1of1ForFork1_cnt_43 v_thread2Thread1of1ForFork1_cnt_42) (not .cse0) .cse1))) (let ((.cse2 (= v_thread2Thread1of1ForFork1_j_59 (+ v_thread2Thread1of1ForFork1_j_60 1))) (.cse3 (select v_B_29 v_thread2Thread1of1ForFork1_j_60))) (or (and .cse2 (= v_thread2Thread1of1ForFork1_cnt_42 v_thread2Thread1of1ForFork1_cnt_41) (<= .cse3 0)) (and .cse2 (< 0 .cse3) (= v_thread2Thread1of1ForFork1_cnt_41 (+ v_thread2Thread1of1ForFork1_cnt_42 1)))))) 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:35,028 INFO L750 eck$LassoCheckResult]: Loop: 105#[L51-1, L65-1, L35]true [141] L65-1-->L65-1: Formula: (and (let ((.cse0 (= (select v_A_39 v_thread2Thread1of1ForFork1_j_60) 0)) (.cse1 (< v_thread2Thread1of1ForFork1_j_60 v_N_36))) (or (and .cse0 (= v_thread2Thread1of1ForFork1_cnt_42 (+ v_thread2Thread1of1ForFork1_cnt_43 1)) .cse1) (and (= v_thread2Thread1of1ForFork1_cnt_43 v_thread2Thread1of1ForFork1_cnt_42) (not .cse0) .cse1))) (let ((.cse2 (= v_thread2Thread1of1ForFork1_j_59 (+ v_thread2Thread1of1ForFork1_j_60 1))) (.cse3 (select v_B_29 v_thread2Thread1of1ForFork1_j_60))) (or (and .cse2 (= v_thread2Thread1of1ForFork1_cnt_42 v_thread2Thread1of1ForFork1_cnt_41) (<= .cse3 0)) (and .cse2 (< 0 .cse3) (= v_thread2Thread1of1ForFork1_cnt_41 (+ v_thread2Thread1of1ForFork1_cnt_42 1)))))) 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 (= (select v_A_39 v_thread2Thread1of1ForFork1_j_60) 0)) (.cse1 (< v_thread2Thread1of1ForFork1_j_60 v_N_36))) (or (and .cse0 (= v_thread2Thread1of1ForFork1_cnt_42 (+ v_thread2Thread1of1ForFork1_cnt_43 1)) .cse1) (and (= v_thread2Thread1of1ForFork1_cnt_43 v_thread2Thread1of1ForFork1_cnt_42) (not .cse0) .cse1))) (let ((.cse2 (= v_thread2Thread1of1ForFork1_j_59 (+ v_thread2Thread1of1ForFork1_j_60 1))) (.cse3 (select v_B_29 v_thread2Thread1of1ForFork1_j_60))) (or (and .cse2 (= v_thread2Thread1of1ForFork1_cnt_42 v_thread2Thread1of1ForFork1_cnt_41) (<= .cse3 0)) (and .cse2 (< 0 .cse3) (= v_thread2Thread1of1ForFork1_cnt_41 (+ v_thread2Thread1of1ForFork1_cnt_42 1)))))) 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:35,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash -922388278, now seen corresponding path program 1 times [2023-10-12 17:18:35,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:35,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711720353] [2023-10-12 17:18:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:35,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:35,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:35,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash 5473, now seen corresponding path program 1 times [2023-10-12 17:18:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:35,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778491617] [2023-10-12 17:18:35,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:35,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:35,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:35,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:35,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1651867670, now seen corresponding path program 2 times [2023-10-12 17:18:35,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:35,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596994391] [2023-10-12 17:18:35,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:35,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:35,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:35,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:35,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:35,900 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:35,901 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:35,901 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:35,901 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:35,901 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:35,901 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:35,901 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:35,901 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:35,901 INFO L133 ssoRankerPreferences]: Filename of dumped script: map-aggr-update3.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:18:35,901 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:35,901 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:36,459 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:36,462 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:38,758 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:38,806 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:38,809 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:39,038 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 21 [2023-10-12 17:18:42,864 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:42,864 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:42,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:42,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:42,867 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:42,868 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:42,869 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:42,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:42,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:42,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:42,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:42,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:42,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:42,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:42,892 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:42,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:42,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:42,905 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:42,905 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:42,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:18:42,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:42,911 INFO L203 nArgumentSynthesizer]: 6 stem disjuncts [2023-10-12 17:18:42,911 INFO L204 nArgumentSynthesizer]: 36 loop disjuncts [2023-10-12 17:18:42,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:44,519 INFO L401 nArgumentSynthesizer]: We have 3096 Motzkin's Theorem applications. [2023-10-12 17:18:44,519 INFO L402 nArgumentSynthesizer]: A total of 72 supporting invariants were added. [2023-10-12 17:18:51,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:51,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:18:51,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:51,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:51,284 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:51,286 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:51,287 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:51,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:51,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:51,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:51,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:51,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:51,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:51,312 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:51,322 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:18:51,322 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:18:51,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:51,323 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:51,325 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:51,327 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:51,333 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:51,333 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:51,334 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:51,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:18:51,356 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:18:51,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:51,373 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:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:51,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:51,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:51,396 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:51,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:51,428 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 28 treesize of output 24 [2023-10-12 17:18:51,453 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:51,454 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:51,454 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:51,535 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:51,536 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:51,548 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:51,548 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:51,551 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:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2023-10-12 17:18:51,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:18:51,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:51,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:18:51,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:51,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 168 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:18:51,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:51,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 2304 transitions, 16128 flow [2023-10-12 17:18:51,734 INFO L124 PetriNetUnfolderBase]: 1372/1935 cut-off events. [2023-10-12 17:18:51,734 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2023-10-12 17:18:51,738 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:51,738 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 45 places, 2304 transitions, 16128 flow [2023-10-12 17:18:51,765 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 45 places, 2304 transitions, 16128 flow [2023-10-12 17:18:51,765 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 2304 transitions, 16128 flow [2023-10-12 17:18:51,765 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:18:51,766 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 2304 transitions, 16128 flow [2023-10-12 17:18:51,783 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:51,784 INFO L124 PetriNetUnfolderBase]: 67/108 cut-off events. [2023-10-12 17:18:51,784 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-10-12 17:18:51,784 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:51,785 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_12} 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 (= (store v_B_26 v_thread3Thread1of1ForFork2_k_24 v_thread3Thread1of1ForFork2_k_24) v_B_25) (< v_thread3Thread1of1ForFork2_k_24 v_N_32) (= v_thread3Thread1of1ForFork2_k_23 0)) InVars {N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_24, B=v_B_26} OutVars{N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_23, B=v_B_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k, B] 171#[L51-1, $Ultimate##0, L83-1, L36]true [2023-10-12 17:18:51,785 INFO L750 eck$LassoCheckResult]: Loop: 171#[L51-1, $Ultimate##0, L83-1, L36]true [138] L83-1-->L83-1: Formula: (and (= (store v_B_26 v_thread3Thread1of1ForFork2_k_24 v_thread3Thread1of1ForFork2_k_24) v_B_25) (< v_thread3Thread1of1ForFork2_k_24 v_N_32) (= v_thread3Thread1of1ForFork2_k_23 0)) InVars {N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_24, B=v_B_26} OutVars{N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_23, 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 (= (store v_B_26 v_thread3Thread1of1ForFork2_k_24 v_thread3Thread1of1ForFork2_k_24) v_B_25) (< v_thread3Thread1of1ForFork2_k_24 v_N_32) (= v_thread3Thread1of1ForFork2_k_23 0)) InVars {N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_24, B=v_B_26} OutVars{N=v_N_32, thread3Thread1of1ForFork2_k=v_thread3Thread1of1ForFork2_k_23, B=v_B_25} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_k, B] 171#[L51-1, $Ultimate##0, L83-1, L36]true [2023-10-12 17:18:51,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1470720053, now seen corresponding path program 1 times [2023-10-12 17:18:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:51,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349341432] [2023-10-12 17:18:51,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:51,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:51,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash 5377, now seen corresponding path program 1 times [2023-10-12 17:18:51,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:51,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248040563] [2023-10-12 17:18:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:51,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:51,823 INFO L85 PathProgramCache]: Analyzing trace with hash 317734965, now seen corresponding path program 2 times [2023-10-12 17:18:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:51,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641560633] [2023-10-12 17:18:51,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:51,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,981 INFO L201 PluginConnector]: Adding new model map-aggr-update3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:18:51 BoogieIcfgContainer [2023-10-12 17:18:51,981 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:18:51,982 INFO L158 Benchmark]: Toolchain (without parser) took 18705.08ms. Allocated memory was 198.2MB in the beginning and 427.8MB in the end (delta: 229.6MB). Free memory was 146.9MB in the beginning and 225.7MB in the end (delta: -78.7MB). Peak memory consumption was 153.3MB. Max. memory is 8.0GB. [2023-10-12 17:18:51,982 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 198.2MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:18:51,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.31ms. Allocated memory is still 198.2MB. Free memory was 146.8MB in the beginning and 145.4MB in the end (delta: 1.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:18:51,983 INFO L158 Benchmark]: Boogie Preprocessor took 19.83ms. Allocated memory is still 198.2MB. Free memory was 145.4MB in the beginning and 144.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:18:51,983 INFO L158 Benchmark]: RCFGBuilder took 203.04ms. Allocated memory is still 198.2MB. Free memory was 144.1MB in the beginning and 134.3MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:18:51,983 INFO L158 Benchmark]: BuchiAutomizer took 18454.54ms. Allocated memory was 198.2MB in the beginning and 427.8MB in the end (delta: 229.6MB). Free memory was 134.2MB in the beginning and 225.7MB in the end (delta: -91.5MB). Peak memory consumption was 139.7MB. Max. memory is 8.0GB. [2023-10-12 17:18:51,985 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.23ms. Allocated memory is still 198.2MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.31ms. Allocated memory is still 198.2MB. Free memory was 146.8MB in the beginning and 145.4MB in the end (delta: 1.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.83ms. Allocated memory is still 198.2MB. Free memory was 145.4MB in the beginning and 144.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 203.04ms. Allocated memory is still 198.2MB. Free memory was 144.1MB in the beginning and 134.3MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 18454.54ms. Allocated memory was 198.2MB in the beginning and 427.8MB in the end (delta: 229.6MB). Free memory was 134.2MB in the beginning and 225.7MB in the end (delta: -91.5MB). Peak memory consumption was 139.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.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. The remainder module has 16128 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.3s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 16.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 115 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital260 mio100 ax100 hnf100 lsp1104 ukn14 mio100 lsp98 div100 bol100 ite100 ukn100 eq168 hnf96 smp100 dnf593 smp55 tf100 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8307ms VariablesStem: 5 VariablesLoop: 6 DisjunctsStem: 6 DisjunctsLoop: 36 SupportingInvariants: 72 MotzkinApplications: 3096 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 83]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L32] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L34] FORK 0 fork 1 thread1(); VAL [N=1, m=0] [L35] FORK 0 fork 2, 2 thread2(); VAL [N=1, m=0] [L50] 1 i := 0; VAL [N=1, i=0, m=0] [L36] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, i=0, m=0] [L82] 3 k := 0; VAL [N=1, i=0, k=0, m=0] [L83] COND TRUE 3 k < N [L84] 3 B[k] := k; [L85] 3 k := 0; VAL [N=1, i=0, k=0, m=0] Loop: [L83] COND TRUE k < N [L84] B[k] := k; [L85] k := 0; [L83] COND TRUE k < N [L84] B[k] := k; [L85] k := 0; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 83]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L32] 0 assume 0 <= m && m < N; VAL [N=1, m=0] [L34] FORK 0 fork 1 thread1(); VAL [N=1, m=0] [L35] FORK 0 fork 2, 2 thread2(); VAL [N=1, m=0] [L50] 1 i := 0; VAL [N=1, i=0, m=0] [L36] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, i=0, m=0] [L82] 3 k := 0; VAL [N=1, i=0, k=0, m=0] [L83] COND TRUE 3 k < N [L84] 3 B[k] := k; [L85] 3 k := 0; VAL [N=1, i=0, k=0, m=0] Loop: [L83] COND TRUE k < N [L84] B[k] := k; [L85] k := 0; [L83] COND TRUE k < N [L84] B[k] := k; [L85] k := 0; End of lasso representation. * 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: 26, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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 incorrect! [2023-10-12 17:18:52,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...