/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_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/regression/bigNumberOfThreads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:11:57,906 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:11:57,975 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:11:58,007 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:11:58,007 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:11:58,008 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:11:58,011 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:11:58,012 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:11:58,012 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:11:58,016 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:11:58,016 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:11:58,016 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:11:58,016 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:11:58,021 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:11:58,021 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:11:58,022 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:11:58,022 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:11:58,022 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:11:58,022 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:11:58,023 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:11:58,023 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:11:58,023 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:11:58,023 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:11:58,024 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:11:58,024 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:11:58,024 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:11:58,024 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:11:58,024 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:11:58,025 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:11:58,025 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:11:58,026 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:11:58,026 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:11:58,026 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:11:58,028 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:11:58,028 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_AUTOMATON [2023-10-12 17:11:58,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:11:58,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:11:58,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:11:58,280 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:11:58,280 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:11:58,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/bigNumberOfThreads.bpl [2023-10-12 17:11:58,282 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/bigNumberOfThreads.bpl' [2023-10-12 17:11:58,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:11:58,304 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:11:58,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:11:58,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:11:58,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:11:58,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,332 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:11:58,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:11:58,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:11:58,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:11:58,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:11:58,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,345 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:11:58,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:11:58,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:11:58,350 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:11:58,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/1) ... [2023-10-12 17:11:58,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:11:58,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:11:58,386 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:11:58,400 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:11:58,420 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:11:58,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:11:58,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:11:58,423 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2023-10-12 17:11:58,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-10-12 17:11:58,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-10-12 17:11:58,425 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:11:58,459 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:11:58,461 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:11:58,518 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:11:58,523 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:11:58,524 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:11:58,525 INFO L201 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:11:58 BoogieIcfgContainer [2023-10-12 17:11:58,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:11:58,526 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:11:58,526 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:11:58,529 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:11:58,530 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:11:58,530 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:11:58" (1/2) ... [2023-10-12 17:11:58,531 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@476e4058 and model type bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:11:58, skipping insertion in model container [2023-10-12 17:11:58,531 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:11:58,531 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:11:58" (2/2) ... [2023-10-12 17:11:58,537 INFO L332 chiAutomizerObserver]: Analyzing ICFG bigNumberOfThreads.bpl [2023-10-12 17:11:58,575 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:11:58,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 13 transitions, 31 flow [2023-10-12 17:11:58,617 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-10-12 17:11:58,618 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:11:58,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 18 events. 1/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2023-10-12 17:11:58,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 13 transitions, 31 flow [2023-10-12 17:11:58,625 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 13 transitions, 31 flow [2023-10-12 17:11:58,628 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:58,640 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 15 places, 13 transitions, 31 flow [2023-10-12 17:11:58,642 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 15 places, 13 transitions, 31 flow [2023-10-12 17:11:58,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 13 transitions, 31 flow [2023-10-12 17:11:58,648 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-10-12 17:11:58,649 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:11:58,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 18 events. 1/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2023-10-12 17:11:58,649 INFO L119 LiptonReduction]: Number of co-enabled transitions 32 [2023-10-12 17:11:58,792 INFO L134 LiptonReduction]: Checked pairs total: 37 [2023-10-12 17:11:58,792 INFO L136 LiptonReduction]: Total number of compositions: 5 [2023-10-12 17:11:58,808 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:58,809 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:58,809 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:58,809 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:58,809 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:58,809 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:58,809 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:58,809 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:58,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:58,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2023-10-12 17:11:58,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:58,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:58,846 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2023-10-12 17:11:58,846 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:58,846 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:58,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 16 states, but on-demand construction may add more states [2023-10-12 17:11:58,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2023-10-12 17:11:58,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:58,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:58,853 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2023-10-12 17:11:58,853 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:58,856 INFO L748 eck$LassoCheckResult]: Stem: 18#[$Ultimate##0]don't care [34] $Ultimate##0-->L29-1: Formula: (and (= v_x_22 0) (= v_ULTIMATE.start_i_12 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_12, x=v_x_22} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 21#[L29-1]don't care [22] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 27#[L30]don't care [30] L30-->$Ultimate##0: Formula: (= v_threadThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_i_7) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_7} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_7, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of1ForFork0_thidvar0] 29#[$Ultimate##0, L30-1]don't care [15] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 33#[$Ultimate##0, L29-1]don't care [22] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 41#[$Ultimate##0, L30]don't care [28] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 49#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-10-12 17:11:58,857 INFO L750 eck$LassoCheckResult]: Loop: 49#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [29] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 49#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-10-12 17:11:58,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:58,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1882121132, now seen corresponding path program 1 times [2023-10-12 17:11:58,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:58,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572647442] [2023-10-12 17:11:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:58,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:58,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:58,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:58,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash 60, now seen corresponding path program 1 times [2023-10-12 17:11:58,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:58,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63201244] [2023-10-12 17:11:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:58,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:58,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:58,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:58,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1783787023, now seen corresponding path program 1 times [2023-10-12 17:11:58,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:58,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704650303] [2023-10-12 17:11:58,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:58,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:58,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:58,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,076 WARN L148 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:11:59,081 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:11:59,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 44 flow [2023-10-12 17:11:59,089 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-10-12 17:11:59,089 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:11:59,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 27 events. 1/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 3 conditions per place. [2023-10-12 17:11:59,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 16 transitions, 44 flow [2023-10-12 17:11:59,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2023-10-12 17:11:59,091 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:59,091 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 16 transitions, 44 flow [2023-10-12 17:11:59,091 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 16 transitions, 44 flow [2023-10-12 17:11:59,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 44 flow [2023-10-12 17:11:59,096 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-10-12 17:11:59,096 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:11:59,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 27 events. 1/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 3 conditions per place. [2023-10-12 17:11:59,097 INFO L119 LiptonReduction]: Number of co-enabled transitions 76 [2023-10-12 17:11:59,203 INFO L134 LiptonReduction]: Checked pairs total: 96 [2023-10-12 17:11:59,203 INFO L136 LiptonReduction]: Total number of compositions: 6 [2023-10-12 17:11:59,205 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:59,205 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:59,205 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:59,205 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:59,205 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:59,205 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:59,206 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:59,206 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:59,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:59,218 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:11:59,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,219 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1] [2023-10-12 17:11:59,219 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:59,219 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:59,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 38 states, but on-demand construction may add more states [2023-10-12 17:11:59,222 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:11:59,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,223 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1] [2023-10-12 17:11:59,223 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:59,225 INFO L748 eck$LassoCheckResult]: Stem: 23#[$Ultimate##0]don't care [59] $Ultimate##0-->L29-1: Formula: (and (= v_ULTIMATE.start_i_28 0) (= v_x_65 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_28, x=v_x_65} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 26#[L29-1]don't care [43] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 30#[L30]don't care [53] L30-->$Ultimate##0: Formula: (= v_threadThread1of2ForFork0_thidvar0_2 v_ULTIMATE.start_i_21) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_21} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_21} AuxVars[] AssignedVars[threadThread1of2ForFork0_thidvar0] 34#[$Ultimate##0, L30-1]don't care [36] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 36#[$Ultimate##0, L29-1]don't care [43] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 44#[$Ultimate##0, L30]don't care [54] L30-->$Ultimate##0: Formula: (= v_threadThread2of2ForFork0_thidvar0_2 v_ULTIMATE.start_i_23) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_23} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_23, threadThread2of2ForFork0_thidvar0=v_threadThread2of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of2ForFork0_thidvar0] 54#[L30-1, $Ultimate##0, $Ultimate##0]don't care [36] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 58#[L29-1, $Ultimate##0, $Ultimate##0]don't care [43] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 70#[L30, $Ultimate##0, $Ultimate##0]don't care [51] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 88#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [2023-10-12 17:11:59,226 INFO L750 eck$LassoCheckResult]: Loop: 88#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [52] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 88#[$Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0]don't care [2023-10-12 17:11:59,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash -965650975, now seen corresponding path program 1 times [2023-10-12 17:11:59,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779364297] [2023-10-12 17:11:59,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,247 INFO L85 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times [2023-10-12 17:11:59,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603536735] [2023-10-12 17:11:59,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,251 INFO L85 PathProgramCache]: Analyzing trace with hash 129590899, now seen corresponding path program 1 times [2023-10-12 17:11:59,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263318273] [2023-10-12 17:11:59,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,318 WARN L148 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:11:59,322 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:11:59,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 59 flow [2023-10-12 17:11:59,331 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-10-12 17:11:59,331 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:11:59,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 36 events. 1/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2023-10-12 17:11:59,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 19 transitions, 59 flow [2023-10-12 17:11:59,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 19 transitions, 59 flow [2023-10-12 17:11:59,332 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:59,333 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 19 transitions, 59 flow [2023-10-12 17:11:59,333 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 19 transitions, 59 flow [2023-10-12 17:11:59,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 59 flow [2023-10-12 17:11:59,338 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-10-12 17:11:59,339 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:11:59,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 36 events. 1/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2023-10-12 17:11:59,339 INFO L119 LiptonReduction]: Number of co-enabled transitions 132 [2023-10-12 17:11:59,420 INFO L134 LiptonReduction]: Checked pairs total: 177 [2023-10-12 17:11:59,420 INFO L136 LiptonReduction]: Total number of compositions: 7 [2023-10-12 17:11:59,421 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:59,422 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:59,422 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:59,422 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:59,422 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:59,422 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:59,422 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:59,422 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:59,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:59,440 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2023-10-12 17:11:59,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,441 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1] [2023-10-12 17:11:59,441 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:59,441 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:59,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 82 states, but on-demand construction may add more states [2023-10-12 17:11:59,446 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2023-10-12 17:11:59,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,447 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1] [2023-10-12 17:11:59,447 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:59,447 INFO L748 eck$LassoCheckResult]: Stem: 28#[$Ultimate##0]don't care [86] $Ultimate##0-->L29-1: Formula: (and (= v_x_94 0) (= v_ULTIMATE.start_i_49 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_49, x=v_x_94} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 31#[L29-1]don't care [68] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 35#[L30]don't care [80] L30-->$Ultimate##0: Formula: (= v_ULTIMATE.start_i_40 v_threadThread1of3ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_40} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_40, threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of3ForFork0_thidvar0] 39#[L30-1, $Ultimate##0]don't care [61] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 43#[L29-1, $Ultimate##0]don't care [68] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 49#[L30, $Ultimate##0]don't care [81] L30-->$Ultimate##0: Formula: (= v_threadThread2of3ForFork0_thidvar0_2 v_ULTIMATE.start_i_42) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_42} OutVars{threadThread2of3ForFork0_thidvar0=v_threadThread2of3ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_42} AuxVars[] AssignedVars[threadThread2of3ForFork0_thidvar0] 59#[$Ultimate##0, L30-1, $Ultimate##0]don't care [61] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 65#[$Ultimate##0, $Ultimate##0, L29-1]don't care [68] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 75#[L30, $Ultimate##0, $Ultimate##0]don't care [82] L30-->$Ultimate##0: Formula: (= v_threadThread3of3ForFork0_thidvar0_2 v_ULTIMATE.start_i_44) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_44} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_44, threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread3of3ForFork0_thidvar0] 93#[L30-1, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [61] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 107#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L29-1]don't care [68] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 123#[$Ultimate##0, $Ultimate##0, L30, $Ultimate##0]don't care [78] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 153#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:11:59,448 INFO L750 eck$LassoCheckResult]: Loop: 153#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [79] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 153#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:11:59,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2094438277, now seen corresponding path program 1 times [2023-10-12 17:11:59,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698721915] [2023-10-12 17:11:59,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,463 INFO L85 PathProgramCache]: Analyzing trace with hash 110, now seen corresponding path program 1 times [2023-10-12 17:11:59,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440800901] [2023-10-12 17:11:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,468 INFO L85 PathProgramCache]: Analyzing trace with hash 503077226, now seen corresponding path program 1 times [2023-10-12 17:11:59,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470106757] [2023-10-12 17:11:59,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,567 WARN L148 chiAutomizerObserver]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:11:59,573 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:11:59,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 76 flow [2023-10-12 17:11:59,596 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2023-10-12 17:11:59,596 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-10-12 17:11:59,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 45 events. 1/45 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 51. Up to 5 conditions per place. [2023-10-12 17:11:59,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 22 transitions, 76 flow [2023-10-12 17:11:59,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 22 transitions, 76 flow [2023-10-12 17:11:59,598 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:59,598 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 76 flow [2023-10-12 17:11:59,598 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 76 flow [2023-10-12 17:11:59,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 76 flow [2023-10-12 17:11:59,605 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2023-10-12 17:11:59,605 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-10-12 17:11:59,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 45 events. 1/45 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 51. Up to 5 conditions per place. [2023-10-12 17:11:59,606 INFO L119 LiptonReduction]: Number of co-enabled transitions 200 [2023-10-12 17:11:59,705 INFO L134 LiptonReduction]: Checked pairs total: 280 [2023-10-12 17:11:59,706 INFO L136 LiptonReduction]: Total number of compositions: 8 [2023-10-12 17:11:59,709 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:11:59,709 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:11:59,709 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:11:59,709 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:11:59,709 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:11:59,709 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:11:59,709 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:11:59,709 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:11:59,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:11:59,755 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 16 [2023-10-12 17:11:59,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,756 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2023-10-12 17:11:59,756 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:59,756 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:11:59,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 170 states, but on-demand construction may add more states [2023-10-12 17:11:59,764 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 16 [2023-10-12 17:11:59,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:11:59,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:11:59,765 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2023-10-12 17:11:59,765 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:11:59,766 INFO L748 eck$LassoCheckResult]: Stem: 33#[$Ultimate##0]don't care [120] $Ultimate##0-->L29-1: Formula: (and (= v_x_175 0) (= v_ULTIMATE.start_i_75 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_75, x=v_x_175} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 36#[L29-1]don't care [97] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 38#[L30]don't care [111] L30-->$Ultimate##0: Formula: (= v_ULTIMATE.start_i_64 v_threadThread1of4ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_64} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_64, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of4ForFork0_thidvar0] 44#[L30-1, $Ultimate##0]don't care [90] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 48#[L29-1, $Ultimate##0]don't care [97] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 52#[$Ultimate##0, L30]don't care [112] L30-->$Ultimate##0: Formula: (= v_threadThread2of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_66) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_66} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_66, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of4ForFork0_thidvar0] 64#[L30-1, $Ultimate##0, $Ultimate##0]don't care [90] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 70#[L29-1, $Ultimate##0, $Ultimate##0]don't care [97] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 78#[L30, $Ultimate##0, $Ultimate##0]don't care [113] L30-->$Ultimate##0: Formula: (= v_threadThread3of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_68) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_68} OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_68} AuxVars[] AssignedVars[threadThread3of4ForFork0_thidvar0] 98#[L30-1, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [90] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 112#[L29-1, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [97] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 126#[L30, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [114] L30-->$Ultimate##0: Formula: (= v_threadThread4of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_70) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_70} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_70, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread4of4ForFork0_thidvar0] 158#[$Ultimate##0, L30-1, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [90] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 188#[$Ultimate##0, L29-1, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [97] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 216#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L30]don't care [109] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 266#[$Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:11:59,766 INFO L750 eck$LassoCheckResult]: Loop: 266#[$Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0]don't care [110] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 266#[$Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:11:59,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1956884033, now seen corresponding path program 1 times [2023-10-12 17:11:59,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359011643] [2023-10-12 17:11:59,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2023-10-12 17:11:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631674984] [2023-10-12 17:11:59,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:11:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash 533862989, now seen corresponding path program 1 times [2023-10-12 17:11:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:11:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188915500] [2023-10-12 17:11:59,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:11:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:11:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:11:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:11:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:11:59,938 WARN L148 chiAutomizerObserver]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-10-12 17:11:59,944 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-10-12 17:11:59,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 95 flow [2023-10-12 17:11:59,964 INFO L124 PetriNetUnfolderBase]: 1/54 cut-off events. [2023-10-12 17:11:59,964 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:11:59,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 54 events. 1/54 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 67. Up to 6 conditions per place. [2023-10-12 17:11:59,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 25 transitions, 95 flow [2023-10-12 17:11:59,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 25 transitions, 95 flow [2023-10-12 17:11:59,966 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:11:59,966 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 95 flow [2023-10-12 17:11:59,966 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 95 flow [2023-10-12 17:11:59,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 95 flow [2023-10-12 17:11:59,977 INFO L124 PetriNetUnfolderBase]: 1/54 cut-off events. [2023-10-12 17:11:59,977 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:11:59,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 54 events. 1/54 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 67. Up to 6 conditions per place. [2023-10-12 17:11:59,979 INFO L119 LiptonReduction]: Number of co-enabled transitions 280 [2023-10-12 17:12:00,072 INFO L134 LiptonReduction]: Checked pairs total: 405 [2023-10-12 17:12:00,073 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:12:00,078 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:00,079 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:00,079 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:00,079 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:00,079 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:00,079 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:00,079 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:00,079 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:00,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:00,111 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 32 [2023-10-12 17:12:00,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:00,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:00,112 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:00,112 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:00,112 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:00,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 346 states, but on-demand construction may add more states [2023-10-12 17:12:00,118 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 32 [2023-10-12 17:12:00,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:00,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:00,119 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:00,119 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:00,120 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]don't care [157] $Ultimate##0-->L29-1: Formula: (and (= v_x_260 0) (= v_ULTIMATE.start_i_106 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_106, x=v_x_260} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 41#[L29-1]don't care [130] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 43#[L30]don't care [146] L30-->$Ultimate##0: Formula: (= v_threadThread1of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_93) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_93} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_93, threadThread1of5ForFork0_thidvar0=v_threadThread1of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of5ForFork0_thidvar0] 49#[L30-1, $Ultimate##0]don't care [123] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 51#[L29-1, $Ultimate##0]don't care [130] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 55#[$Ultimate##0, L30]don't care [147] L30-->$Ultimate##0: Formula: (= v_threadThread2of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_95) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_95} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_95, threadThread2of5ForFork0_thidvar0=v_threadThread2of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of5ForFork0_thidvar0] 63#[$Ultimate##0, $Ultimate##0, L30-1]don't care [123] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 71#[$Ultimate##0, $Ultimate##0, L29-1]don't care [130] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 77#[$Ultimate##0, L30, $Ultimate##0]don't care [148] L30-->$Ultimate##0: Formula: (= v_threadThread3of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_97) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_97} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_97, threadThread3of5ForFork0_thidvar0=v_threadThread3of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread3of5ForFork0_thidvar0] 89#[L30-1, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [123] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 107#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L29-1]don't care [130] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 125#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L30]don't care [149] L30-->$Ultimate##0: Formula: (= v_threadThread4of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_99) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_99} OutVars{threadThread4of5ForFork0_thidvar0=v_threadThread4of5ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_99} AuxVars[] AssignedVars[threadThread4of5ForFork0_thidvar0] 149#[$Ultimate##0, L30-1, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [123] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 183#[$Ultimate##0, $Ultimate##0, L29-1, $Ultimate##0, $Ultimate##0]don't care [130] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 215#[L30, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [150] L30-->$Ultimate##0: Formula: (= v_ULTIMATE.start_i_101 v_threadThread5of5ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_101} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_101, threadThread5of5ForFork0_thidvar0=v_threadThread5of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread5of5ForFork0_thidvar0] 257#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L30-1, $Ultimate##0]don't care [123] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 319#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L29-1, $Ultimate##0, $Ultimate##0]don't care [130] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 381#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L30, $Ultimate##0, $Ultimate##0]don't care [144] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 455#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-10-12 17:12:00,121 INFO L750 eck$LassoCheckResult]: Loop: 455#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [145] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 455#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2023-10-12 17:12:00,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash -195178949, now seen corresponding path program 1 times [2023-10-12 17:12:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:00,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748805410] [2023-10-12 17:12:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:00,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:00,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748805410] [2023-10-12 17:12:00,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748805410] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:00,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:00,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-10-12 17:12:00,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412347855] [2023-10-12 17:12:00,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:00,241 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:00,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 1 times [2023-10-12 17:12:00,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:00,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515334496] [2023-10-12 17:12:00,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:00,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:00,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:00,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:00,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:00,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-10-12 17:12:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-10-12 17:12:00,271 INFO L87 Difference]: Start difference. First operand currently 346 states, but on-demand construction may add more states Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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:12:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:00,369 INFO L93 Difference]: Finished difference Result 283 states and 816 transitions. [2023-10-12 17:12:00,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 283 states and 816 transitions. [2023-10-12 17:12:00,375 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:12:00,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 283 states to 0 states and 0 transitions. [2023-10-12 17:12:00,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:12:00,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:12:00,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:12:00,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:12:00,379 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:00,379 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-10-12 17:12:00,384 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:00,384 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:00,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:12:00,385 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:12:00,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:12:00,391 INFO L201 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:00 BoogieIcfgContainer [2023-10-12 17:12:00,391 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:00,397 INFO L158 Benchmark]: Toolchain (without parser) took 2087.32ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 139.8MB in the beginning and 116.7MB in the end (delta: 23.1MB). Peak memory consumption was 94.8MB. Max. memory is 8.0GB. [2023-10-12 17:12:00,399 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 184.5MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:00,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.01ms. Allocated memory is still 184.5MB. Free memory was 139.8MB in the beginning and 138.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:12:00,399 INFO L158 Benchmark]: Boogie Preprocessor took 13.88ms. Allocated memory is still 184.5MB. Free memory was 138.3MB in the beginning and 137.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:00,399 INFO L158 Benchmark]: RCFGBuilder took 175.71ms. Allocated memory is still 184.5MB. Free memory was 137.1MB in the beginning and 128.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-10-12 17:12:00,400 INFO L158 Benchmark]: BuchiAutomizer took 1864.90ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 128.7MB in the beginning and 116.7MB in the end (delta: 12.0MB). Peak memory consumption was 83.3MB. Max. memory is 8.0GB. [2023-10-12 17:12:00,400 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.25ms. Allocated memory is still 184.5MB. Free memory is still 140.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.01ms. Allocated memory is still 184.5MB. Free memory was 139.8MB in the beginning and 138.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.88ms. Allocated memory is still 184.5MB. Free memory was 138.3MB in the beginning and 137.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 175.71ms. Allocated memory is still 184.5MB. Free memory was 137.1MB in the beginning and 128.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1864.90ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 128.7MB in the beginning and 116.7MB in the end (delta: 12.0MB). Peak memory consumption was 83.3MB. 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 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic). 1 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 6 iterations. TraceHistogramMax:6. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 0 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont4 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 15 PlacesBefore, 11 PlacesAfterwards, 13 TransitionsBefore, 9 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 20 PlacesBefore, 15 PlacesAfterwards, 16 TransitionsBefore, 11 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 96 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 48, unknown conditional: 0, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 25 PlacesBefore, 19 PlacesAfterwards, 19 TransitionsBefore, 13 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 177 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 147, independent conditional: 0, independent unconditional: 147, 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: 69, independent: 66, independent conditional: 0, independent unconditional: 66, 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: 69, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 69, unknown conditional: 0, unknown unconditional: 69] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 23 PlacesAfterwards, 22 TransitionsBefore, 15 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 280 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 234, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 92, independent conditional: 0, independent unconditional: 92, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 234, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 17 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 405 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 335, independent: 330, independent conditional: 0, independent unconditional: 330, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 145, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 145, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 335, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 145, unknown conditional: 0, unknown unconditional: 145] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, 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:12:00,477 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...