/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/buchiAutomizer/concurrent-buchi-pn-semanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/bigNumberOfThreads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-ed1a3e5-m [2022-09-29 14:47:53,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 14:47:53,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 14:47:53,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 14:47:53,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 14:47:53,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 14:47:53,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 14:47:53,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 14:47:53,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 14:47:53,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 14:47:53,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 14:47:53,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 14:47:53,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 14:47:53,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 14:47:53,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 14:47:53,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 14:47:53,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 14:47:53,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 14:47:53,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 14:47:53,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 14:47:53,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 14:47:53,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 14:47:53,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 14:47:53,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 14:47:53,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 14:47:53,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 14:47:53,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 14:47:53,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 14:47:53,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 14:47:53,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 14:47:53,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 14:47:53,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 14:47:53,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 14:47:53,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 14:47:53,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 14:47:53,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 14:47:53,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 14:47:53,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 14:47:53,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 14:47:53,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 14:47:53,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 14:47:53,469 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-buchi-pn-semanticLbe.epf [2022-09-29 14:47:53,498 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 14:47:53,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 14:47:53,498 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 14:47:53,499 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 14:47:53,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 14:47:53,500 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 14:47:53,500 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 14:47:53,500 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 14:47:53,500 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 14:47:53,500 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 14:47:53,501 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 14:47:53,501 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 14:47:53,501 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 14:47:53,501 INFO L138 SettingsManager]: * Automaton type for concurrent programs=BUCHI_PETRI_NET [2022-09-29 14:47:53,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 14:47:53,501 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 14:47:53,502 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 14:47:53,502 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 14:47:53,502 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 14:47:53,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 14:47:53,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 14:47:53,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 14:47:53,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 14:47:53,502 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 14:47:53,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 14:47:53,503 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 14:47:53,503 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 14:47:53,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 14:47:53,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 14:47:53,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 14:47:53,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 14:47:53,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 14:47:53,504 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 14:47:53,504 INFO L138 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 [2022-09-29 14:47:53,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 14:47:53,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 14:47:53,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 14:47:53,758 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 14:47:53,759 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 14:47:53,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/bigNumberOfThreads.bpl [2022-09-29 14:47:53,760 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/bigNumberOfThreads.bpl' [2022-09-29 14:47:53,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 14:47:53,780 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 14:47:53,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 14:47:53,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 14:47:53,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 14:47:53,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:53" (1/1) ... [2022-09-29 14:47:53,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:53" (1/1) ... [2022-09-29 14:47:53,802 INFO L137 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 14:47:53,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 14:47:53,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 14:47:53,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 14:47:53,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 14:47:53,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:53" (1/1) ... [2022-09-29 14:47:53,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:53" (1/1) ... [2022-09-29 14:47:53,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:53" (1/1) ... [2022-09-29 14:47:53,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:53" (1/1) ... [2022-09-29 14:47:53,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:53" (1/1) ... [2022-09-29 14:47:53,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:53" (1/1) ... [2022-09-29 14:47:53,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:53" (1/1) ... [2022-09-29 14:47:53,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 14:47:53,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 14:47:53,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 14:47:53,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 14:47:53,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:53" (1/1) ... [2022-09-29 14:47:53,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:47:53,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 14:47:53,853 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) [2022-09-29 14:47:53,872 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 [2022-09-29 14:47:53,888 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 14:47:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 14:47:53,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 14:47:53,888 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2022-09-29 14:47:53,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2022-09-29 14:47:53,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2022-09-29 14:47:53,889 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 14:47:53,925 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 14:47:53,926 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 14:47:53,997 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 14:47:54,004 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 14:47:54,005 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-29 14:47:54,007 INFO L202 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 02:47:54 BoogieIcfgContainer [2022-09-29 14:47:54,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 14:47:54,008 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 14:47:54,009 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 14:47:54,012 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 14:47:54,013 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 14:47:54,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:53" (1/2) ... [2022-09-29 14:47:54,015 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e6113ce and model type bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 02:47:54, skipping insertion in model container [2022-09-29 14:47:54,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 14:47:54,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 02:47:54" (2/2) ... [2022-09-29 14:47:54,023 INFO L322 chiAutomizerObserver]: Analyzing ICFG bigNumberOfThreads.bpl [2022-09-29 14:47:54,090 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-29 14:47:54,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 13 transitions, 31 flow [2022-09-29 14:47:54,138 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:54,138 INFO L123 PetriNetUnfolderBase]: 1/18 cut-off events. [2022-09-29 14:47:54,138 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 14:47:54,140 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. [2022-09-29 14:47:54,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 13 transitions, 31 flow [2022-09-29 14:47:54,146 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 13 transitions, 31 flow [2022-09-29 14:47:54,149 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:47:54,170 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 15 places, 13 transitions, 31 flow [2022-09-29 14:47:54,173 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 15 places, 13 transitions, 31 flow [2022-09-29 14:47:54,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 13 transitions, 31 flow [2022-09-29 14:47:54,181 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:54,181 INFO L123 PetriNetUnfolderBase]: 1/18 cut-off events. [2022-09-29 14:47:54,181 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 14:47:54,182 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 28 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. [2022-09-29 14:47:54,183 INFO L116 LiptonReduction]: Number of co-enabled transitions 32 [2022-09-29 14:47:54,370 INFO L131 LiptonReduction]: Checked pairs total: 37 [2022-09-29 14:47:54,370 INFO L133 LiptonReduction]: Total number of compositions: 5 [2022-09-29 14:47:54,394 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:47:54,394 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:47:54,394 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:47:54,395 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:47:54,395 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:47:54,395 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:47:54,395 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:47:54,395 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2022-09-29 14:47:54,396 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 11 places, 9 transitions, 23 flow [2022-09-29 14:47:54,405 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 11 places, 9 transitions, 23 flow [2022-09-29 14:47:54,406 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:47:54,407 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:47:54,407 INFO L123 PetriNetUnfolderBase]: 0/11 cut-off events. [2022-09-29 14:47:54,407 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 14:47:54,407 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:47:54,409 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:47:54,409 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 11 places, 9 transitions, 23 flow [2022-09-29 14:47:54,412 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 11 places, 9 transitions, 23 flow [2022-09-29 14:47:54,413 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:47:54,413 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:47:54,413 INFO L123 PetriNetUnfolderBase]: 0/11 cut-off events. [2022-09-29 14:47:54,413 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 14:47:54,413 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:47:54,417 INFO L733 eck$LassoCheckResult]: Stem: 19#[ULTIMATE.startENTRY]true [31] ULTIMATE.startENTRY-->L29-1: Formula: (and (= 0 v_ULTIMATE.start_i_8) (= v_x_6 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_8, x=v_x_6} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 21#[L29-1]true [20] 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[] 23#[L30]true [30] L30-->threadENTRY: 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] 25#[L30-1, threadENTRY]true [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] 27#[threadENTRY, L29-1]true [20] 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[] 29#[L30, threadENTRY]true [28] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 31#[threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2022-09-29 14:47:54,418 INFO L735 eck$LassoCheckResult]: Loop: 31#[threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [29] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 31#[threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2022-09-29 14:47:54,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:54,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1794386575, now seen corresponding path program 1 times [2022-09-29 14:47:54,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:54,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810608597] [2022-09-29 14:47:54,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:54,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:54,483 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:54,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:54,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash 60, now seen corresponding path program 1 times [2022-09-29 14:47:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:54,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363274808] [2022-09-29 14:47:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:54,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:54,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash -208590994, now seen corresponding path program 1 times [2022-09-29 14:47:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:54,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471023821] [2022-09-29 14:47:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:54,516 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:54,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:54,617 WARN L146 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-09-29 14:47:54,622 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-29 14:47:54,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 44 flow [2022-09-29 14:47:54,635 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:54,635 INFO L123 PetriNetUnfolderBase]: 1/27 cut-off events. [2022-09-29 14:47:54,636 INFO L124 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2022-09-29 14:47:54,636 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 46 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. [2022-09-29 14:47:54,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 16 transitions, 44 flow [2022-09-29 14:47:54,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2022-09-29 14:47:54,637 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:47:54,637 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 16 transitions, 44 flow [2022-09-29 14:47:54,638 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 16 transitions, 44 flow [2022-09-29 14:47:54,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 44 flow [2022-09-29 14:47:54,642 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:54,642 INFO L123 PetriNetUnfolderBase]: 1/27 cut-off events. [2022-09-29 14:47:54,642 INFO L124 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2022-09-29 14:47:54,642 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 46 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. [2022-09-29 14:47:54,645 INFO L116 LiptonReduction]: Number of co-enabled transitions 76 [2022-09-29 14:47:54,778 INFO L131 LiptonReduction]: Checked pairs total: 96 [2022-09-29 14:47:54,779 INFO L133 LiptonReduction]: Total number of compositions: 6 [2022-09-29 14:47:54,780 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:47:54,780 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:47:54,780 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:47:54,780 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:47:54,780 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:47:54,780 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:47:54,781 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:47:54,781 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2022-09-29 14:47:54,781 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 15 places, 11 transitions, 34 flow [2022-09-29 14:47:54,788 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 15 places, 11 transitions, 34 flow [2022-09-29 14:47:54,789 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:47:54,789 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:47:54,789 INFO L123 PetriNetUnfolderBase]: 0/17 cut-off events. [2022-09-29 14:47:54,789 INFO L124 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2022-09-29 14:47:54,789 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:47:54,789 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:47:54,789 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 15 places, 11 transitions, 34 flow [2022-09-29 14:47:54,793 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 15 places, 11 transitions, 34 flow [2022-09-29 14:47:54,794 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:47:54,794 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:47:54,794 INFO L123 PetriNetUnfolderBase]: 0/17 cut-off events. [2022-09-29 14:47:54,794 INFO L124 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2022-09-29 14:47:54,794 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:47:54,795 INFO L733 eck$LassoCheckResult]: Stem: 24#[ULTIMATE.startENTRY]true [59] ULTIMATE.startENTRY-->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]true [41] 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[] 28#[L30]true [53] L30-->threadENTRY: 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] 30#[L30-1, threadENTRY]true [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] 32#[L29-1, threadENTRY]true [41] 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[] 34#[L30, threadENTRY]true [54] L30-->threadENTRY: 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] 36#[L30-1, threadENTRY, threadENTRY]true [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] 38#[threadENTRY, L29-1, threadENTRY]true [41] 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[] 40#[L30, threadENTRY, threadENTRY]true [51] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 42#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY, threadENTRY]true [2022-09-29 14:47:54,795 INFO L735 eck$LassoCheckResult]: Loop: 42#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY, threadENTRY]true [52] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 42#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY, threadENTRY]true [2022-09-29 14:47:54,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:54,796 INFO L85 PathProgramCache]: Analyzing trace with hash -158151453, now seen corresponding path program 1 times [2022-09-29 14:47:54,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:54,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890765273] [2022-09-29 14:47:54,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:54,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:54,804 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:54,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:54,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:54,810 INFO L85 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times [2022-09-29 14:47:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:54,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937546131] [2022-09-29 14:47:54,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:54,816 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:54,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash -607727695, now seen corresponding path program 1 times [2022-09-29 14:47:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:54,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127524717] [2022-09-29 14:47:54,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:54,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:54,829 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:54,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:54,873 WARN L146 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-09-29 14:47:54,877 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-29 14:47:54,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 59 flow [2022-09-29 14:47:54,885 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:54,885 INFO L123 PetriNetUnfolderBase]: 1/36 cut-off events. [2022-09-29 14:47:54,885 INFO L124 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2022-09-29 14:47:54,885 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 64 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. [2022-09-29 14:47:54,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 19 transitions, 59 flow [2022-09-29 14:47:54,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 19 transitions, 59 flow [2022-09-29 14:47:54,886 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:47:54,887 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 19 transitions, 59 flow [2022-09-29 14:47:54,887 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 19 transitions, 59 flow [2022-09-29 14:47:54,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 59 flow [2022-09-29 14:47:54,894 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:54,894 INFO L123 PetriNetUnfolderBase]: 1/36 cut-off events. [2022-09-29 14:47:54,895 INFO L124 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2022-09-29 14:47:54,895 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 74 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. [2022-09-29 14:47:54,896 INFO L116 LiptonReduction]: Number of co-enabled transitions 132 [2022-09-29 14:47:54,988 INFO L131 LiptonReduction]: Checked pairs total: 177 [2022-09-29 14:47:54,988 INFO L133 LiptonReduction]: Total number of compositions: 7 [2022-09-29 14:47:54,990 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:47:54,990 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:47:54,990 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:47:54,990 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:47:54,990 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:47:54,990 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:47:54,990 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:47:54,990 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2022-09-29 14:47:54,990 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 19 places, 13 transitions, 47 flow [2022-09-29 14:47:55,001 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 19 places, 13 transitions, 47 flow [2022-09-29 14:47:55,002 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:47:55,002 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:47:55,002 INFO L123 PetriNetUnfolderBase]: 0/23 cut-off events. [2022-09-29 14:47:55,002 INFO L124 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2022-09-29 14:47:55,002 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:47:55,003 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:47:55,003 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 19 places, 13 transitions, 47 flow [2022-09-29 14:47:55,006 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 19 places, 13 transitions, 47 flow [2022-09-29 14:47:55,007 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:47:55,007 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:47:55,007 INFO L123 PetriNetUnfolderBase]: 0/23 cut-off events. [2022-09-29 14:47:55,007 INFO L124 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2022-09-29 14:47:55,008 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:47:55,008 INFO L733 eck$LassoCheckResult]: Stem: 29#[ULTIMATE.startENTRY]true [87] ULTIMATE.startENTRY-->L29-1: Formula: (and (= v_x_118 0) (= v_ULTIMATE.start_i_47 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_47, x=v_x_118} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 31#[L29-1]true [66] 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[] 33#[L30]true [80] L30-->threadENTRY: 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] 35#[L30-1, threadENTRY]true [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] 37#[threadENTRY, L29-1]true [66] 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[] 39#[L30, threadENTRY]true [81] L30-->threadENTRY: 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] 41#[L30-1, threadENTRY, threadENTRY]true [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#[threadENTRY, L29-1, threadENTRY]true [66] 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[] 45#[L30, threadENTRY, threadENTRY]true [82] L30-->threadENTRY: 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] 47#[threadENTRY, L30-1, threadENTRY, threadENTRY]true [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] 49#[threadENTRY, threadENTRY, L29-1, threadENTRY]true [66] 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[] 51#[threadENTRY, L30, threadENTRY, threadENTRY]true [78] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 53#[threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY]true [2022-09-29 14:47:55,009 INFO L735 eck$LassoCheckResult]: Loop: 53#[threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY]true [79] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 53#[threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY]true [2022-09-29 14:47:55,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:55,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1965011356, now seen corresponding path program 1 times [2022-09-29 14:47:55,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:55,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564042861] [2022-09-29 14:47:55,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:55,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,037 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:55,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:55,045 INFO L85 PathProgramCache]: Analyzing trace with hash 110, now seen corresponding path program 1 times [2022-09-29 14:47:55,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:55,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332549172] [2022-09-29 14:47:55,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:55,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,048 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:55,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash -785809813, now seen corresponding path program 1 times [2022-09-29 14:47:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:55,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200708673] [2022-09-29 14:47:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,058 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:55,143 WARN L146 chiAutomizerObserver]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-09-29 14:47:55,155 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-29 14:47:55,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 76 flow [2022-09-29 14:47:55,172 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:55,172 INFO L123 PetriNetUnfolderBase]: 1/45 cut-off events. [2022-09-29 14:47:55,172 INFO L124 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2022-09-29 14:47:55,173 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 86 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. [2022-09-29 14:47:55,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 22 transitions, 76 flow [2022-09-29 14:47:55,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 22 transitions, 76 flow [2022-09-29 14:47:55,174 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:47:55,174 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 76 flow [2022-09-29 14:47:55,175 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 76 flow [2022-09-29 14:47:55,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 76 flow [2022-09-29 14:47:55,180 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:55,181 INFO L123 PetriNetUnfolderBase]: 1/45 cut-off events. [2022-09-29 14:47:55,181 INFO L124 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2022-09-29 14:47:55,181 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 3. Compared 67 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. [2022-09-29 14:47:55,182 INFO L116 LiptonReduction]: Number of co-enabled transitions 200 [2022-09-29 14:47:55,256 INFO L131 LiptonReduction]: Checked pairs total: 280 [2022-09-29 14:47:55,256 INFO L133 LiptonReduction]: Total number of compositions: 8 [2022-09-29 14:47:55,257 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:47:55,257 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:47:55,257 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:47:55,257 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:47:55,258 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:47:55,258 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:47:55,258 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:47:55,258 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2022-09-29 14:47:55,258 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 23 places, 15 transitions, 62 flow [2022-09-29 14:47:55,263 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 23 places, 15 transitions, 62 flow [2022-09-29 14:47:55,264 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:47:55,264 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:47:55,264 INFO L123 PetriNetUnfolderBase]: 0/29 cut-off events. [2022-09-29 14:47:55,264 INFO L124 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2022-09-29 14:47:55,265 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:47:55,265 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:47:55,265 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 23 places, 15 transitions, 62 flow [2022-09-29 14:47:55,269 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 23 places, 15 transitions, 62 flow [2022-09-29 14:47:55,270 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:47:55,270 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:47:55,270 INFO L123 PetriNetUnfolderBase]: 0/29 cut-off events. [2022-09-29 14:47:55,270 INFO L124 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2022-09-29 14:47:55,270 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:47:55,271 INFO L733 eck$LassoCheckResult]: Stem: 34#[ULTIMATE.startENTRY]true [115] ULTIMATE.startENTRY-->L29-1: Formula: (and (= v_x_135 0) (= v_ULTIMATE.start_i_63 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_63, x=v_x_135} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 36#[L29-1]true [95] 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]true [111] L30-->threadENTRY: Formula: (= v_ULTIMATE.start_i_56 v_threadThread1of4ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_56} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_56, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of4ForFork0_thidvar0] 40#[L30-1, threadENTRY]true [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] 42#[L29-1, threadENTRY]true [95] 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#[L30, threadENTRY]true [112] L30-->threadENTRY: Formula: (= v_threadThread2of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_58) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_58} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_58, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of4ForFork0_thidvar0] 46#[L30-1, threadENTRY, threadENTRY]true [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#[threadENTRY, L29-1, threadENTRY]true [95] 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[] 50#[L30, threadENTRY, threadENTRY]true [113] L30-->threadENTRY: Formula: (= v_threadThread3of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_60) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_60} OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_60} AuxVars[] AssignedVars[threadThread3of4ForFork0_thidvar0] 52#[L30-1, threadENTRY, threadENTRY, threadENTRY]true [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] 54#[threadENTRY, threadENTRY, L29-1, threadENTRY]true [95] 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[] 56#[L30, threadENTRY, threadENTRY, threadENTRY]true [114] L30-->threadENTRY: Formula: (= v_threadThread4of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_62) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_62} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_62, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread4of4ForFork0_thidvar0] 58#[L30-1, threadENTRY, threadENTRY, threadENTRY, threadENTRY]true [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] 60#[threadENTRY, threadENTRY, threadENTRY, L29-1, threadENTRY]true [95] 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[] 62#[L30, threadENTRY, threadENTRY, threadENTRY, threadENTRY]true [109] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 64#[threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY, threadENTRY]true [2022-09-29 14:47:55,271 INFO L735 eck$LassoCheckResult]: Loop: 64#[threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY, threadENTRY]true [110] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 64#[threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY, threadENTRY]true [2022-09-29 14:47:55,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:55,272 INFO L85 PathProgramCache]: Analyzing trace with hash -168355522, now seen corresponding path program 1 times [2022-09-29 14:47:55,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:55,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132827007] [2022-09-29 14:47:55,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:55,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,281 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:55,291 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2022-09-29 14:47:55,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:55,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008987806] [2022-09-29 14:47:55,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:55,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,293 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash -924053776, now seen corresponding path program 1 times [2022-09-29 14:47:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:55,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176987756] [2022-09-29 14:47:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,304 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:55,379 WARN L146 chiAutomizerObserver]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-09-29 14:47:55,384 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-29 14:47:55,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 95 flow [2022-09-29 14:47:55,392 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:55,392 INFO L123 PetriNetUnfolderBase]: 1/54 cut-off events. [2022-09-29 14:47:55,392 INFO L124 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2022-09-29 14:47:55,393 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 102 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. [2022-09-29 14:47:55,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 25 transitions, 95 flow [2022-09-29 14:47:55,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 25 transitions, 95 flow [2022-09-29 14:47:55,394 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:47:55,394 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 95 flow [2022-09-29 14:47:55,394 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 95 flow [2022-09-29 14:47:55,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 95 flow [2022-09-29 14:47:55,400 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:55,400 INFO L123 PetriNetUnfolderBase]: 1/54 cut-off events. [2022-09-29 14:47:55,400 INFO L124 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2022-09-29 14:47:55,401 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 118 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. [2022-09-29 14:47:55,401 INFO L116 LiptonReduction]: Number of co-enabled transitions 280 [2022-09-29 14:47:55,489 INFO L131 LiptonReduction]: Checked pairs total: 405 [2022-09-29 14:47:55,489 INFO L133 LiptonReduction]: Total number of compositions: 9 [2022-09-29 14:47:55,490 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:47:55,490 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:47:55,490 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:47:55,490 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:47:55,491 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:47:55,491 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:47:55,491 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:47:55,491 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2022-09-29 14:47:55,491 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 27 places, 17 transitions, 79 flow [2022-09-29 14:47:55,495 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 27 places, 17 transitions, 79 flow [2022-09-29 14:47:55,497 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:47:55,497 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:47:55,497 INFO L123 PetriNetUnfolderBase]: 0/35 cut-off events. [2022-09-29 14:47:55,497 INFO L124 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2022-09-29 14:47:55,497 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:47:55,498 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:47:55,498 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 27 places, 17 transitions, 79 flow [2022-09-29 14:47:55,502 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 27 places, 17 transitions, 79 flow [2022-09-29 14:47:55,503 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:47:55,503 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:47:55,503 INFO L123 PetriNetUnfolderBase]: 0/35 cut-off events. [2022-09-29 14:47:55,503 INFO L124 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2022-09-29 14:47:55,503 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:47:55,504 INFO L733 eck$LassoCheckResult]: Stem: 39#[ULTIMATE.startENTRY]true [151] ULTIMATE.startENTRY-->L29-1: Formula: (and (= v_x_208 0) (= v_ULTIMATE.start_i_84 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_84, x=v_x_208} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 41#[L29-1]true [128] 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]true [146] L30-->threadENTRY: Formula: (= v_threadThread1of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_75) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_75} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_75, threadThread1of5ForFork0_thidvar0=v_threadThread1of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of5ForFork0_thidvar0] 45#[L30-1, threadENTRY]true [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] 47#[L29-1, threadENTRY]true [128] 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, threadENTRY]true [147] L30-->threadENTRY: Formula: (= v_threadThread2of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_77) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_77} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_77, threadThread2of5ForFork0_thidvar0=v_threadThread2of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of5ForFork0_thidvar0] 51#[L30-1, threadENTRY, threadENTRY]true [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] 53#[threadENTRY, L29-1, threadENTRY]true [128] 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#[threadENTRY, L30, threadENTRY]true [148] L30-->threadENTRY: Formula: (= v_threadThread3of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_79) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_79} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_79, threadThread3of5ForFork0_thidvar0=v_threadThread3of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread3of5ForFork0_thidvar0] 57#[L30-1, threadENTRY, threadENTRY, threadENTRY]true [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] 59#[threadENTRY, threadENTRY, L29-1, threadENTRY]true [128] 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[] 61#[threadENTRY, L30, threadENTRY, threadENTRY]true [149] L30-->threadENTRY: Formula: (= v_threadThread4of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_81) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_81} OutVars{threadThread4of5ForFork0_thidvar0=v_threadThread4of5ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_81} AuxVars[] AssignedVars[threadThread4of5ForFork0_thidvar0] 63#[L30-1, threadENTRY, threadENTRY, threadENTRY, threadENTRY]true [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] 65#[threadENTRY, threadENTRY, threadENTRY, L29-1, threadENTRY]true [128] 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[] 67#[threadENTRY, threadENTRY, threadENTRY, L30, threadENTRY]true [150] L30-->threadENTRY: Formula: (= v_ULTIMATE.start_i_83 v_threadThread5of5ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_83} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_83, threadThread5of5ForFork0_thidvar0=v_threadThread5of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread5of5ForFork0_thidvar0] 69#[L30-1, threadENTRY, threadENTRY, threadENTRY, threadENTRY, threadENTRY]true [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#[threadENTRY, threadENTRY, threadENTRY, threadENTRY, L29-1, threadENTRY]true [128] 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[] 73#[threadENTRY, L30, threadENTRY, threadENTRY, threadENTRY, threadENTRY]true [144] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 75#[threadENTRY, threadENTRY, threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY]true [2022-09-29 14:47:55,504 INFO L735 eck$LassoCheckResult]: Loop: 75#[threadENTRY, threadENTRY, threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY]true [145] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 75#[threadENTRY, threadENTRY, threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY]true [2022-09-29 14:47:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash -96779327, now seen corresponding path program 1 times [2022-09-29 14:47:55,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:55,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694163270] [2022-09-29 14:47:55,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:55,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 14:47:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 14:47:55,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 14:47:55,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694163270] [2022-09-29 14:47:55,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694163270] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 14:47:55,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 14:47:55,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-29 14:47:55,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179995874] [2022-09-29 14:47:55,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 14:47:55,620 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-09-29 14:47:55,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:55,621 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 1 times [2022-09-29 14:47:55,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:55,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932471784] [2022-09-29 14:47:55,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,624 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:55,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:55,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 14:47:55,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-29 14:47:55,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-09-29 14:47:55,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 79 flow. 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) [2022-09-29 14:47:55,651 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2022-09-29 14:47:55,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-29 14:47:55,809 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:55,810 INFO L123 PetriNetUnfolderBase]: 534/816 cut-off events. [2022-09-29 14:47:55,812 INFO L124 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2022-09-29 14:47:55,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 816 events. 534/816 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2682 event pairs, 0 based on Foata normal form. 0/722 useless extension candidates. Maximal degree in co-relation 832. Up to 496 conditions per place. [2022-09-29 14:47:55,828 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 32 selfloop transitions, 16 changer transitions 0/48 dead transitions. [2022-09-29 14:47:55,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 227 flow [2022-09-29 14:47:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-29 14:47:55,841 INFO L428 stractBuchiCegarLoop]: Abstraction has has 33 places, 48 transitions, 227 flow [2022-09-29 14:47:55,841 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 14:47:55,841 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 33 places, 48 transitions, 227 flow [2022-09-29 14:47:55,888 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:55,888 INFO L123 PetriNetUnfolderBase]: 534/816 cut-off events. [2022-09-29 14:47:55,888 INFO L124 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2022-09-29 14:47:55,889 INFO L47 CFPrefixIsEmptyBuchi]: Starting emptiness check. [2022-09-29 14:47:55,889 INFO L62 CFPrefixIsEmptyBuchi]: Starting cutoff event analysis. [2022-09-29 14:47:55,891 INFO L72 CFPrefixIsEmptyBuchi]: Ended cutoff event analysis. [2022-09-29 14:47:55,891 INFO L76 CFPrefixIsEmptyBuchi]: Type 1 Lasso search started. [2022-09-29 14:47:55,891 INFO L87 CFPrefixIsEmptyBuchi]: Type 1 Lasso search ended. [2022-09-29 14:47:55,892 INFO L107 CFPrefixIsEmptyBuchi]: Type 3 Lasso search started. [2022-09-29 14:47:55,936 INFO L206 CFPrefixIsEmptyBuchi]: Type 3 Lasso search ended. [2022-09-29 14:47:55,936 INFO L50 CFPrefixIsEmptyBuchi]: Finished emptiness check, language is empty [2022-09-29 14:47:55,936 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is empty [2022-09-29 14:47:55,941 INFO L202 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.09 02:47:55 BoogieIcfgContainer [2022-09-29 14:47:55,941 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-09-29 14:47:55,944 INFO L158 Benchmark]: Toolchain (without parser) took 2161.40ms. Allocated memory was 197.1MB in the beginning and 276.8MB in the end (delta: 79.7MB). Free memory was 150.4MB in the beginning and 196.5MB in the end (delta: -46.1MB). Peak memory consumption was 34.5MB. Max. memory is 8.0GB. [2022-09-29 14:47:55,947 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 197.1MB. Free memory was 151.5MB in the beginning and 151.3MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 14:47:55,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.03ms. Allocated memory is still 197.1MB. Free memory was 150.4MB in the beginning and 148.8MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-29 14:47:55,951 INFO L158 Benchmark]: Boogie Preprocessor took 14.05ms. Allocated memory is still 197.1MB. Free memory was 148.8MB in the beginning and 147.8MB in the end (delta: 906.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 14:47:55,951 INFO L158 Benchmark]: RCFGBuilder took 187.78ms. Allocated memory is still 197.1MB. Free memory was 147.8MB in the beginning and 139.8MB in the end (delta: 8.1MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-09-29 14:47:55,952 INFO L158 Benchmark]: BuchiAutomizer took 1933.08ms. Allocated memory was 197.1MB in the beginning and 276.8MB in the end (delta: 79.7MB). Free memory was 139.6MB in the beginning and 196.5MB in the end (delta: -56.9MB). Peak memory consumption was 21.9MB. Max. memory is 8.0GB. [2022-09-29 14:47:55,956 INFO L339 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.11ms. Allocated memory is still 197.1MB. Free memory was 151.5MB in the beginning and 151.3MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.03ms. Allocated memory is still 197.1MB. Free memory was 150.4MB in the beginning and 148.8MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.05ms. Allocated memory is still 197.1MB. Free memory was 148.8MB in the beginning and 147.8MB in the end (delta: 906.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 187.78ms. Allocated memory is still 197.1MB. Free memory was 147.8MB in the beginning and 139.8MB in the end (delta: 8.1MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * BuchiAutomizer took 1933.08ms. Allocated memory was 197.1MB in the beginning and 276.8MB in the end (delta: 79.7MB). Free memory was 139.6MB in the beginning and 196.5MB in the end (delta: -56.9MB). Peak memory consumption was 21.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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.1s and 6 iterations. TraceHistogramMax:0. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [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.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 0 mSDtfsCounter, 91 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.7s - 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, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative 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 - 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, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 0, negative conditional: 0, negative 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 - 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, positive: 147, positive conditional: 0, positive unconditional: 147, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 69, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 69, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 0, negative conditional: 0, negative 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 - 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: 230, positive: 226, positive conditional: 0, positive unconditional: 226, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 100, positive: 96, positive conditional: 0, positive unconditional: 96, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 100, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 230, positive: 130, positive conditional: 0, positive unconditional: 130, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 100, unknown conditional: 0, unknown unconditional: 100] , 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 - 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, positive: 330, positive conditional: 0, positive unconditional: 330, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 145, positive: 140, positive conditional: 0, positive unconditional: 140, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 145, positive: 130, positive conditional: 0, positive unconditional: 130, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 335, positive: 190, positive conditional: 0, positive unconditional: 190, negative: 0, negative conditional: 0, negative 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 RESULT: Ultimate proved your program to be correct! [2022-09-29 14:47:55,992 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...