/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/TwoActiveWorkersSirius.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-ed1a3e5-m [2022-09-29 14:45:35,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 14:45:35,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 14:45:35,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 14:45:35,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 14:45:35,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 14:45:35,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 14:45:35,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 14:45:35,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 14:45:35,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 14:45:35,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 14:45:35,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 14:45:35,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 14:45:35,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 14:45:35,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 14:45:35,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 14:45:35,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 14:45:35,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 14:45:35,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 14:45:35,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 14:45:35,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 14:45:35,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 14:45:35,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 14:45:35,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 14:45:35,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 14:45:35,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 14:45:35,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 14:45:35,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 14:45:35,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 14:45:35,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 14:45:35,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 14:45:35,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 14:45:35,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 14:45:35,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 14:45:35,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 14:45:35,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 14:45:35,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 14:45:35,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 14:45:35,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 14:45:35,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 14:45:35,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 14:45:35,786 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:45:35,816 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 14:45:35,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 14:45:35,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 14:45:35,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 14:45:35,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 14:45:35,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 14:45:35,818 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 14:45:35,818 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 14:45:35,819 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 14:45:35,819 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 14:45:35,819 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 14:45:35,819 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 14:45:35,820 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 14:45:35,820 INFO L138 SettingsManager]: * Automaton type for concurrent programs=BUCHI_PETRI_NET [2022-09-29 14:45:35,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 14:45:35,820 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 14:45:35,820 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 14:45:35,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 14:45:35,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 14:45:35,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 14:45:35,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 14:45:35,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 14:45:35,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 14:45:35,822 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 14:45:35,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 14:45:35,822 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 14:45:35,822 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 14:45:35,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 14:45:35,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 14:45:35,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 14:45:35,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 14:45:35,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 14:45:35,824 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 14:45:35,824 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:45:36,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 14:45:36,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 14:45:36,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 14:45:36,089 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 14:45:36,092 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 14:45:36,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/TwoActiveWorkersSirius.bpl [2022-09-29 14:45:36,093 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/TwoActiveWorkersSirius.bpl' [2022-09-29 14:45:36,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 14:45:36,115 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 14:45:36,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 14:45:36,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 14:45:36,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 14:45:36,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:36" (1/1) ... [2022-09-29 14:45:36,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:36" (1/1) ... [2022-09-29 14:45:36,138 INFO L137 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 14:45:36,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 14:45:36,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 14:45:36,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 14:45:36,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 14:45:36,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:36" (1/1) ... [2022-09-29 14:45:36,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:36" (1/1) ... [2022-09-29 14:45:36,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:36" (1/1) ... [2022-09-29 14:45:36,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:36" (1/1) ... [2022-09-29 14:45:36,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:36" (1/1) ... [2022-09-29 14:45:36,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:36" (1/1) ... [2022-09-29 14:45:36,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:36" (1/1) ... [2022-09-29 14:45:36,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 14:45:36,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 14:45:36,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 14:45:36,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 14:45:36,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:36" (1/1) ... [2022-09-29 14:45:36,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:45:36,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 14:45:36,185 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:45:36,187 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:45:36,218 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 14:45:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 14:45:36,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 14:45:36,219 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2022-09-29 14:45:36,219 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2022-09-29 14:45:36,219 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2022-09-29 14:45:36,219 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:45:36,263 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 14:45:36,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 14:45:36,374 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 14:45:36,381 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 14:45:36,382 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-09-29 14:45:36,384 INFO L202 PluginConnector]: Adding new model TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 02:45:36 BoogieIcfgContainer [2022-09-29 14:45:36,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 14:45:36,386 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 14:45:36,386 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 14:45:36,390 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 14:45:36,391 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 14:45:36,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:45:36" (1/2) ... [2022-09-29 14:45:36,394 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a4f0323 and model type TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 02:45:36, skipping insertion in model container [2022-09-29 14:45:36,394 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 14:45:36,394 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "TwoActiveWorkersSirius.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 02:45:36" (2/2) ... [2022-09-29 14:45:36,400 INFO L322 chiAutomizerObserver]: Analyzing ICFG TwoActiveWorkersSirius.bpl [2022-09-29 14:45:36,486 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-09-29 14:45:36,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 15 transitions, 38 flow [2022-09-29 14:45:36,535 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:45:36,535 INFO L123 PetriNetUnfolderBase]: 2/17 cut-off events. [2022-09-29 14:45:36,535 INFO L124 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2022-09-29 14:45:36,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 17 events. 2/17 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 17 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 7. Up to 3 conditions per place. [2022-09-29 14:45:36,538 INFO L82 GeneralOperation]: Start removeDead. Operand has 16 places, 15 transitions, 38 flow [2022-09-29 14:45:36,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 16 places, 15 transitions, 38 flow [2022-09-29 14:45:36,548 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:45:36,571 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 15 transitions, 38 flow [2022-09-29 14:45:36,574 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 16 places, 15 transitions, 38 flow [2022-09-29 14:45:36,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 16 places, 15 transitions, 38 flow [2022-09-29 14:45:36,582 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:45:36,582 INFO L123 PetriNetUnfolderBase]: 2/17 cut-off events. [2022-09-29 14:45:36,582 INFO L124 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2022-09-29 14:45:36,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 17 events. 2/17 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 7. Up to 3 conditions per place. [2022-09-29 14:45:36,583 INFO L116 LiptonReduction]: Number of co-enabled transitions 60 [2022-09-29 14:45:36,813 INFO L131 LiptonReduction]: Checked pairs total: 107 [2022-09-29 14:45:36,814 INFO L133 LiptonReduction]: Total number of compositions: 5 [2022-09-29 14:45:36,825 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:45:36,825 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:45:36,825 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:45:36,825 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:45:36,825 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:45:36,825 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:45:36,825 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:45:36,826 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2022-09-29 14:45:36,826 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 13 places, 12 transitions, 32 flow [2022-09-29 14:45:36,830 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 13 places, 12 transitions, 32 flow [2022-09-29 14:45:36,832 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:45:36,832 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:45:36,833 INFO L123 PetriNetUnfolderBase]: 0/8 cut-off events. [2022-09-29 14:45:36,833 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 14:45:36,833 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:45:36,836 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:45:36,836 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 13 places, 12 transitions, 32 flow [2022-09-29 14:45:36,838 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 13 places, 12 transitions, 32 flow [2022-09-29 14:45:36,839 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:45:36,839 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:45:36,839 INFO L123 PetriNetUnfolderBase]: 0/8 cut-off events. [2022-09-29 14:45:36,839 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 14:45:36,839 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:45:36,845 INFO L733 eck$LassoCheckResult]: Stem: 20#[ULTIMATE.startENTRY]true [44] ULTIMATE.startENTRY-->L19-1: Formula: (and (= v_i_20 0) (= v_ctr_14 0)) InVars {} OutVars{i=v_i_20, ctr=v_ctr_14} AuxVars[] AssignedVars[i, ctr] 22#[L19-1]true [41] L19-1-->workerENTRY: Formula: (= v_i_11 v_workerThread1of1ForFork0_thidvar0_2) InVars {i=v_i_11} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, i=v_i_11} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0] 24#[workerENTRY, L20]true [46] L20-->L19-1: Formula: (and (= (+ v_i_33 1) v_i_32) (not (< 0 v_i_33))) InVars {i=v_i_33} OutVars{i=v_i_32} AuxVars[] AssignedVars[i] 26#[workerENTRY, L19-1]true [39] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 28#[workerENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2022-09-29 14:45:36,845 INFO L735 eck$LassoCheckResult]: Loop: 28#[workerENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [40] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 28#[workerENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2022-09-29 14:45:36,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:36,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2275191, now seen corresponding path program 1 times [2022-09-29 14:45:36,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:36,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641835512] [2022-09-29 14:45:36,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:36,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:36,937 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:45:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:36,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:45:36,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:36,969 INFO L85 PathProgramCache]: Analyzing trace with hash 71, now seen corresponding path program 1 times [2022-09-29 14:45:36,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:36,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820125403] [2022-09-29 14:45:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:36,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:36,978 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:45:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:36,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:45:36,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:36,983 INFO L85 PathProgramCache]: Analyzing trace with hash 70530961, now seen corresponding path program 1 times [2022-09-29 14:45:36,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:36,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227796920] [2022-09-29 14:45:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:36,993 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:45:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:37,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:45:37,110 WARN L146 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-09-29 14:45:37,120 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-09-29 14:45:37,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 22 transitions, 62 flow [2022-09-29 14:45:37,138 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:45:37,138 INFO L123 PetriNetUnfolderBase]: 4/32 cut-off events. [2022-09-29 14:45:37,138 INFO L124 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2022-09-29 14:45:37,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 32 events. 4/32 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 23. Up to 5 conditions per place. [2022-09-29 14:45:37,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 22 transitions, 62 flow [2022-09-29 14:45:37,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 22 transitions, 62 flow [2022-09-29 14:45:37,140 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:45:37,140 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 22 transitions, 62 flow [2022-09-29 14:45:37,141 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 22 transitions, 62 flow [2022-09-29 14:45:37,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 22 transitions, 62 flow [2022-09-29 14:45:37,151 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:45:37,152 INFO L123 PetriNetUnfolderBase]: 4/32 cut-off events. [2022-09-29 14:45:37,152 INFO L124 PetriNetUnfolderBase]: For 5/8 co-relation queries the response was YES. [2022-09-29 14:45:37,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 32 events. 4/32 cut-off events. For 5/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 23. Up to 5 conditions per place. [2022-09-29 14:45:37,153 INFO L116 LiptonReduction]: Number of co-enabled transitions 210 [2022-09-29 14:45:37,261 INFO L131 LiptonReduction]: Checked pairs total: 510 [2022-09-29 14:45:37,261 INFO L133 LiptonReduction]: Total number of compositions: 4 [2022-09-29 14:45:37,263 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:45:37,263 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:45:37,263 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:45:37,263 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:45:37,263 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:45:37,263 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:45:37,263 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:45:37,263 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2022-09-29 14:45:37,263 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 21 places, 19 transitions, 56 flow [2022-09-29 14:45:37,267 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 21 places, 19 transitions, 56 flow [2022-09-29 14:45:37,267 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:45:37,267 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:45:37,267 INFO L123 PetriNetUnfolderBase]: 0/16 cut-off events. [2022-09-29 14:45:37,268 INFO L124 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2022-09-29 14:45:37,268 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:45:37,268 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:45:37,268 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 21 places, 19 transitions, 56 flow [2022-09-29 14:45:37,271 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 21 places, 19 transitions, 56 flow [2022-09-29 14:45:37,272 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:45:37,272 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:45:37,272 INFO L123 PetriNetUnfolderBase]: 0/16 cut-off events. [2022-09-29 14:45:37,272 INFO L124 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2022-09-29 14:45:37,272 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:45:37,273 INFO L733 eck$LassoCheckResult]: Stem: 28#[ULTIMATE.startENTRY]true [79] ULTIMATE.startENTRY-->L19-1: Formula: (and (= v_ctr_129 0) (= v_i_106 0)) InVars {} OutVars{i=v_i_106, ctr=v_ctr_129} AuxVars[] AssignedVars[i, ctr] 30#[L19-1]true [73] L19-1-->workerENTRY: Formula: (= v_i_57 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_57} OutVars{i=v_i_57, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0] 32#[workerENTRY, L20]true [80] L20-->L19-1: Formula: (and (not (< 0 v_i_109)) (= (+ v_i_109 1) v_i_108)) InVars {i=v_i_109} OutVars{i=v_i_108} AuxVars[] AssignedVars[i] 34#[workerENTRY, L19-1]true [74] L19-1-->workerENTRY: Formula: (= v_i_59 v_workerThread2of2ForFork0_thidvar0_2) InVars {i=v_i_59} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_2, i=v_i_59} AuxVars[] AssignedVars[workerThread2of2ForFork0_thidvar0] 36#[workerENTRY, workerENTRY, L20]true [80] L20-->L19-1: Formula: (and (not (< 0 v_i_109)) (= (+ v_i_109 1) v_i_108)) InVars {i=v_i_109} OutVars{i=v_i_108} AuxVars[] AssignedVars[i] 38#[workerENTRY, workerENTRY, L19-1]true [71] L19-1-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 40#[workerENTRY, workerENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2022-09-29 14:45:37,273 INFO L735 eck$LassoCheckResult]: Loop: 40#[workerENTRY, workerENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [72] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 40#[workerENTRY, workerENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2022-09-29 14:45:37,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1075886708, now seen corresponding path program 1 times [2022-09-29 14:45:37,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:37,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421987987] [2022-09-29 14:45:37,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:37,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 14:45:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 14:45:37,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 14:45:37,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421987987] [2022-09-29 14:45:37,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421987987] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 14:45:37,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 14:45:37,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-29 14:45:37,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440048115] [2022-09-29 14:45:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 14:45:37,351 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-09-29 14:45:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash 103, now seen corresponding path program 1 times [2022-09-29 14:45:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:37,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539823863] [2022-09-29 14:45:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:37,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:37,354 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:45:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:37,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:45:37,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 14:45:37,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-29 14:45:37,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-29 14:45:37,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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:45:37,426 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2022-09-29 14:45:37,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-29 14:45:37,491 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:45:37,491 INFO L123 PetriNetUnfolderBase]: 103/203 cut-off events. [2022-09-29 14:45:37,491 INFO L124 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2022-09-29 14:45:37,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 203 events. 103/203 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 687 event pairs, 32 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 105. Up to 196 conditions per place. [2022-09-29 14:45:37,495 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2022-09-29 14:45:37,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 113 flow [2022-09-29 14:45:37,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-29 14:45:37,500 INFO L428 stractBuchiCegarLoop]: Abstraction has has 23 places, 24 transitions, 113 flow [2022-09-29 14:45:37,500 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 14:45:37,500 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 23 places, 24 transitions, 113 flow [2022-09-29 14:45:37,521 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 23 places, 24 transitions, 113 flow [2022-09-29 14:45:37,522 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:45:37,522 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:45:37,522 INFO L123 PetriNetUnfolderBase]: 73/145 cut-off events. [2022-09-29 14:45:37,522 INFO L124 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2022-09-29 14:45:37,522 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:45:37,523 INFO L733 eck$LassoCheckResult]: Stem: 28#[ULTIMATE.startENTRY]true [79] ULTIMATE.startENTRY-->L19-1: Formula: (and (= v_ctr_129 0) (= v_i_106 0)) InVars {} OutVars{i=v_i_106, ctr=v_ctr_129} AuxVars[] AssignedVars[i, ctr] 30#[L19-1]true [73] L19-1-->workerENTRY: Formula: (= v_i_57 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_57} OutVars{i=v_i_57, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0] 32#[workerENTRY, L20]true [80] L20-->L19-1: Formula: (and (not (< 0 v_i_109)) (= (+ v_i_109 1) v_i_108)) InVars {i=v_i_109} OutVars{i=v_i_108} AuxVars[] AssignedVars[i] 34#[workerENTRY, L19-1]true [2022-09-29 14:45:37,523 INFO L735 eck$LassoCheckResult]: Loop: 34#[workerENTRY, L19-1]true [74] L19-1-->workerENTRY: Formula: (= v_i_59 v_workerThread2of2ForFork0_thidvar0_2) InVars {i=v_i_59} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_2, i=v_i_59} AuxVars[] AssignedVars[workerThread2of2ForFork0_thidvar0] 36#[workerENTRY, workerENTRY, L20]true [61] workerENTRY-->L30: Formula: (= (+ v_i_6 v_ctr_3) v_ctr_2) InVars {i=v_i_6, ctr=v_ctr_3} OutVars{i=v_i_6, ctr=v_ctr_2} AuxVars[] AssignedVars[ctr] 66#[workerENTRY, L20, L30]true [59] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 68#[workerENTRY, L21, L30]true [63] L30-->L31: Formula: (<= v_ctr_5 (* 2 v_i_8)) InVars {i=v_i_8, ctr=v_ctr_5} OutVars{i=v_i_8, ctr=v_ctr_5} AuxVars[] AssignedVars[] 70#[L31, workerENTRY, L21]true [77] L31-->workerEXIT: Formula: (= (+ (* (- 1) v_i_96) v_ctr_112) v_ctr_111) InVars {i=v_i_96, ctr=v_ctr_112} OutVars{i=v_i_96, ctr=v_ctr_111} AuxVars[] AssignedVars[ctr] 72#[workerENTRY, workerEXIT, L21]true [76] workerEXIT-->L21-2: Formula: (= (+ (- 1) v_i_63) v_workerThread2of2ForFork0_thidvar0_4) InVars {workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_63} OutVars{workerThread2of2ForFork0_thidvar0=v_workerThread2of2ForFork0_thidvar0_4, i=v_i_63} AuxVars[] AssignedVars[] 74#[workerENTRY, L21-2]true [57] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 34#[workerENTRY, L19-1]true [2022-09-29 14:45:37,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:37,524 INFO L85 PathProgramCache]: Analyzing trace with hash 108053, now seen corresponding path program 1 times [2022-09-29 14:45:37,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:37,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715686727] [2022-09-29 14:45:37,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:37,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:37,529 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:45:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:37,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:45:37,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:37,533 INFO L85 PathProgramCache]: Analyzing trace with hash 501425186, now seen corresponding path program 1 times [2022-09-29 14:45:37,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:37,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910610596] [2022-09-29 14:45:37,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:37,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 14:45:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 14:45:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 14:45:37,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910610596] [2022-09-29 14:45:37,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910610596] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 14:45:37,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 14:45:37,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-29 14:45:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253043900] [2022-09-29 14:45:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 14:45:37,559 INFO L750 eck$LassoCheckResult]: loop already infeasible [2022-09-29 14:45:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 14:45:37,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-29 14:45:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-29 14:45:37,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 24 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:45:37,561 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2022-09-29 14:45:37,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-29 14:45:37,660 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:45:37,661 INFO L123 PetriNetUnfolderBase]: 167/322 cut-off events. [2022-09-29 14:45:37,661 INFO L124 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2022-09-29 14:45:37,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 322 events. 167/322 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1136 event pairs, 48 based on Foata normal form. 5/272 useless extension candidates. Maximal degree in co-relation 512. Up to 315 conditions per place. [2022-09-29 14:45:37,665 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 33 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-09-29 14:45:37,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 35 transitions, 230 flow [2022-09-29 14:45:37,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-29 14:45:37,666 INFO L428 stractBuchiCegarLoop]: Abstraction has has 25 places, 35 transitions, 230 flow [2022-09-29 14:45:37,666 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-09-29 14:45:37,666 INFO L68 IsEmptyBuchi]: Start isEmptyBuchi. Operand has 25 places, 35 transitions, 230 flow [2022-09-29 14:45:37,681 INFO L76 AcceptsInfiniteWords]: Start buchiAccepts. Operand has 25 places, 35 transitions, 230 flow [2022-09-29 14:45:37,683 INFO L82 AcceptsInfiniteWords]: Finished buchiAccepts. [2022-09-29 14:45:37,683 INFO L157 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2022-09-29 14:45:37,683 INFO L123 PetriNetUnfolderBase]: 93/188 cut-off events. [2022-09-29 14:45:37,683 INFO L124 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2022-09-29 14:45:37,684 INFO L78 IsEmptyBuchi]: Finished isEmptyBuchi language is not empty [2022-09-29 14:45:37,684 INFO L733 eck$LassoCheckResult]: Stem: 28#[ULTIMATE.startENTRY]true [79] ULTIMATE.startENTRY-->L19-1: Formula: (and (= v_ctr_129 0) (= v_i_106 0)) InVars {} OutVars{i=v_i_106, ctr=v_ctr_129} AuxVars[] AssignedVars[i, ctr] 30#[L19-1]true [73] L19-1-->workerENTRY: Formula: (= v_i_57 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_57} OutVars{i=v_i_57, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0] 32#[workerENTRY, L20]true [66] workerENTRY-->L30: Formula: (= (+ v_i_6 v_ctr_3) v_ctr_2) InVars {i=v_i_6, ctr=v_ctr_3} OutVars{i=v_i_6, ctr=v_ctr_2} AuxVars[] AssignedVars[ctr] 86#[L30, L20]true [68] L30-->L31: Formula: (<= v_ctr_5 (* 2 v_i_8)) InVars {i=v_i_8, ctr=v_ctr_5} OutVars{i=v_i_8, ctr=v_ctr_5} AuxVars[] AssignedVars[] 88#[L31, L20]true [78] L31-->workerEXIT: Formula: (= v_ctr_125 (+ (* (- 1) v_i_104) v_ctr_126)) InVars {i=v_i_104, ctr=v_ctr_126} OutVars{i=v_i_104, ctr=v_ctr_125} AuxVars[] AssignedVars[ctr] 90#[workerEXIT, L20]true [59] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 92#[L21, workerEXIT]true [2022-09-29 14:45:37,684 INFO L735 eck$LassoCheckResult]: Loop: 92#[L21, workerEXIT]true [75] workerEXIT-->L21-2: Formula: (= v_workerThread1of2ForFork0_thidvar0_4 (+ (- 1) v_i_61)) InVars {i=v_i_61, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} OutVars{i=v_i_61, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[] 95#[L21-2]true [57] L21-2-->L19-1: Formula: (= v_i_4 (+ v_i_5 1)) InVars {i=v_i_5} OutVars{i=v_i_4} AuxVars[] AssignedVars[i] 30#[L19-1]true [73] L19-1-->workerENTRY: Formula: (= v_i_57 v_workerThread1of2ForFork0_thidvar0_2) InVars {i=v_i_57} OutVars{i=v_i_57, workerThread1of2ForFork0_thidvar0=v_workerThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[workerThread1of2ForFork0_thidvar0] 32#[workerENTRY, L20]true [66] workerENTRY-->L30: Formula: (= (+ v_i_6 v_ctr_3) v_ctr_2) InVars {i=v_i_6, ctr=v_ctr_3} OutVars{i=v_i_6, ctr=v_ctr_2} AuxVars[] AssignedVars[ctr] 86#[L30, L20]true [68] L30-->L31: Formula: (<= v_ctr_5 (* 2 v_i_8)) InVars {i=v_i_8, ctr=v_ctr_5} OutVars{i=v_i_8, ctr=v_ctr_5} AuxVars[] AssignedVars[] 88#[L31, L20]true [78] L31-->workerEXIT: Formula: (= v_ctr_125 (+ (* (- 1) v_i_104) v_ctr_126)) InVars {i=v_i_104, ctr=v_ctr_126} OutVars{i=v_i_104, ctr=v_ctr_125} AuxVars[] AssignedVars[ctr] 90#[workerEXIT, L20]true [59] L20-->L21: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[] 92#[L21, workerEXIT]true [2022-09-29 14:45:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1076309622, now seen corresponding path program 1 times [2022-09-29 14:45:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:37,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548085024] [2022-09-29 14:45:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 14:45:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 14:45:37,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 14:45:37,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548085024] [2022-09-29 14:45:37,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548085024] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 14:45:37,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 14:45:37,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-09-29 14:45:37,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882730165] [2022-09-29 14:45:37,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 14:45:37,701 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-09-29 14:45:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:45:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1287422345, now seen corresponding path program 1 times [2022-09-29 14:45:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:45:37,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026094646] [2022-09-29 14:45:37,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:45:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:45:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:37,708 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:45:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:45:37,714 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: No thread ID for procedure ULTIMATE.start at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createThreadIds(IcfgProgramExecution.java:200) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:149) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.create(IcfgProgramExecution.java:97) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.computeIcfgProgramExecution(IcfgProgramExecutionBuilder.java:169) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.IcfgProgramExecutionBuilder.getIcfgProgramExecution(IcfgProgramExecutionBuilder.java:75) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:431) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:357) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:866) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopFeasibility(LassoCheck.java:828) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:748) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:254) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-09-29 14:45:37,717 INFO L158 Benchmark]: Toolchain (without parser) took 1601.56ms. Allocated memory was 176.2MB in the beginning and 253.8MB in the end (delta: 77.6MB). Free memory was 129.0MB in the beginning and 196.2MB in the end (delta: -67.2MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-09-29 14:45:37,718 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 14:45:37,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.17ms. Allocated memory is still 176.2MB. Free memory was 128.9MB in the beginning and 127.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 14:45:37,719 INFO L158 Benchmark]: Boogie Preprocessor took 13.89ms. Allocated memory is still 176.2MB. Free memory was 127.3MB in the beginning and 126.4MB in the end (delta: 920.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 14:45:37,719 INFO L158 Benchmark]: RCFGBuilder took 229.18ms. Allocated memory is still 176.2MB. Free memory was 126.4MB in the beginning and 147.1MB in the end (delta: -20.7MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. [2022-09-29 14:45:37,720 INFO L158 Benchmark]: BuchiAutomizer took 1330.80ms. Allocated memory was 176.2MB in the beginning and 253.8MB in the end (delta: 77.6MB). Free memory was 147.0MB in the beginning and 196.2MB in the end (delta: -49.2MB). Peak memory consumption was 27.7MB. Max. memory is 8.0GB. [2022-09-29 14:45:37,727 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.13ms. Allocated memory is still 176.2MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.17ms. Allocated memory is still 176.2MB. Free memory was 128.9MB in the beginning and 127.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.89ms. Allocated memory is still 176.2MB. Free memory was 127.3MB in the beginning and 126.4MB in the end (delta: 920.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 229.18ms. Allocated memory is still 176.2MB. Free memory was 126.4MB in the beginning and 147.1MB in the end (delta: -20.7MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 1330.80ms. Allocated memory was 176.2MB in the beginning and 253.8MB in the end (delta: 77.6MB). Free memory was 147.0MB in the beginning and 196.2MB in the end (delta: -49.2MB). Peak memory consumption was 27.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 16 PlacesBefore, 13 PlacesAfterwards, 15 TransitionsBefore, 12 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 107 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 101, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, positive: 47, positive conditional: 0, positive unconditional: 47, 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: 52, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 21 PlacesAfterwards, 22 TransitionsBefore, 19 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 510 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 256, positive: 228, positive conditional: 0, positive unconditional: 228, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, positive: 118, positive conditional: 0, positive unconditional: 118, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, positive: 113, positive conditional: 0, positive unconditional: 113, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 256, positive: 110, positive conditional: 0, positive unconditional: 110, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - ExceptionOrErrorResult: AssertionError: No thread ID for procedure ULTIMATE.start de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: No thread ID for procedure ULTIMATE.start: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.IcfgProgramExecution.createThreadIds(IcfgProgramExecution.java:200) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-09-29 14:45:37,755 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...