/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:12:15,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:12:15,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:12:15,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:12:15,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:12:15,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:12:15,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:12:15,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:12:15,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:12:15,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:12:15,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:12:15,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:12:15,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:12:15,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:12:15,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:12:15,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:12:15,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:12:15,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:12:15,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:12:15,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:12:15,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:12:15,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:12:15,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:12:15,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:12:15,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:12:15,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:12:15,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:12:15,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:12:15,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:12:15,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:12:15,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:12:15,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:12:15,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:12:15,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:12:15,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:12:15,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:12:15,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:12:15,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:12:15,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:12:15,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:12:15,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:12:15,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 11:12:15,753 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:12:15,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:12:15,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:12:15,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:12:15,756 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:12:15,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:12:15,757 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:12:15,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:12:15,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:12:15,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:12:15,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:12:15,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:12:15,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:12:15,758 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:12:15,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:12:15,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:12:15,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:12:15,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:12:15,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:12:15,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:12:15,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:12:15,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:12:15,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:12:15,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:12:15,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:12:15,760 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 11:12:15,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:12:15,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:12:15,761 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:12:15,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-12-13 11:12:16,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:12:16,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:12:16,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:12:16,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:12:16,080 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:12:16,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-12-13 11:12:17,217 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:12:17,428 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:12:17,428 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-12-13 11:12:17,433 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b24f96eb/e74e2d776ac04b9295ba592dbc473909/FLAG64c7e97d4 [2022-12-13 11:12:17,447 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b24f96eb/e74e2d776ac04b9295ba592dbc473909 [2022-12-13 11:12:17,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:12:17,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:12:17,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:12:17,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:12:17,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:12:17,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a088117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17, skipping insertion in model container [2022-12-13 11:12:17,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:12:17,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:12:17,632 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c[2641,2654] [2022-12-13 11:12:17,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:12:17,655 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:12:17,697 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c[2641,2654] [2022-12-13 11:12:17,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:12:17,719 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:12:17,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17 WrapperNode [2022-12-13 11:12:17,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:12:17,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:12:17,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:12:17,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:12:17,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,785 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 162 [2022-12-13 11:12:17,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:12:17,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:12:17,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:12:17,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:12:17,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,831 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:12:17,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:12:17,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:12:17,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:12:17,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17" (1/1) ... [2022-12-13 11:12:17,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:12:17,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:12:17,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:12:17,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:12:17,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:12:17,954 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 11:12:17,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 11:12:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 11:12:17,955 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 11:12:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:12:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:12:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:12:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 11:12:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:12:17,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:12:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:12:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:12:17,957 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:12:18,119 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:12:18,121 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:12:18,370 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:12:18,376 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:12:18,376 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 11:12:18,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:12:18 BoogieIcfgContainer [2022-12-13 11:12:18,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:12:18,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:12:18,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:12:18,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:12:18,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:12:17" (1/3) ... [2022-12-13 11:12:18,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ab016d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:12:18, skipping insertion in model container [2022-12-13 11:12:18,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:17" (2/3) ... [2022-12-13 11:12:18,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ab016d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:12:18, skipping insertion in model container [2022-12-13 11:12:18,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:12:18" (3/3) ... [2022-12-13 11:12:18,383 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2022-12-13 11:12:18,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:12:18,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 11:12:18,399 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:12:18,498 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 11:12:18,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 191 transitions, 398 flow [2022-12-13 11:12:18,616 INFO L130 PetriNetUnfolder]: 18/189 cut-off events. [2022-12-13 11:12:18,616 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:12:18,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 189 events. 18/189 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 293 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-12-13 11:12:18,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 191 transitions, 398 flow [2022-12-13 11:12:18,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 181 transitions, 374 flow [2022-12-13 11:12:18,630 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:18,644 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 181 transitions, 374 flow [2022-12-13 11:12:18,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 181 transitions, 374 flow [2022-12-13 11:12:18,688 INFO L130 PetriNetUnfolder]: 18/181 cut-off events. [2022-12-13 11:12:18,688 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:12:18,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 181 events. 18/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 274 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-12-13 11:12:18,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 181 transitions, 374 flow [2022-12-13 11:12:18,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 4092 [2022-12-13 11:12:25,416 INFO L241 LiptonReduction]: Total number of compositions: 162 [2022-12-13 11:12:25,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:12:25,436 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79336f8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:12:25,436 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 11:12:25,442 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-13 11:12:25,442 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:12:25,442 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:25,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:25,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:25,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1355763279, now seen corresponding path program 1 times [2022-12-13 11:12:25,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:25,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269595437] [2022-12-13 11:12:25,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:25,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:25,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269595437] [2022-12-13 11:12:25,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269595437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:25,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:25,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:12:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238194718] [2022-12-13 11:12:25,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:25,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:12:25,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:25,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:12:25,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:12:25,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 11:12:25,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-12-13 11:12:25,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:25,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 11:12:25,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:26,045 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-13 11:12:26,045 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 11:12:26,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 184 event pairs, 18 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-13 11:12:26,049 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-13 11:12:26,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-13 11:12:26,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:12:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:12:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-13 11:12:26,058 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 11:12:26,059 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-13 11:12:26,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 11:12:26,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:12:26,063 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-13 11:12:26,064 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-13 11:12:26,067 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-13 11:12:26,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:26,068 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-13 11:12:26,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:26,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:26,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-13 11:12:26,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-13 11:12:26,081 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-13 11:12:26,082 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:12:26,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-13 11:12:26,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-13 11:12:26,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 11:12:27,100 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:27,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1035 [2022-12-13 11:12:27,102 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-13 11:12:27,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-12-13 11:12:27,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:27,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:27,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:12:27,103 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1825621982, now seen corresponding path program 1 times [2022-12-13 11:12:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:27,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532467907] [2022-12-13 11:12:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:27,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:27,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532467907] [2022-12-13 11:12:27,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532467907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:27,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:27,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:12:27,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365339910] [2022-12-13 11:12:27,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:27,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:12:27,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:27,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:12:27,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:12:27,303 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 11:12:27,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-12-13 11:12:27,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:27,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 11:12:27,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:27,442 INFO L130 PetriNetUnfolder]: 72/134 cut-off events. [2022-12-13 11:12:27,443 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 11:12:27,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 134 events. 72/134 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 368 event pairs, 24 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 274. Up to 76 conditions per place. [2022-12-13 11:12:27,444 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 34 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2022-12-13 11:12:27,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 39 transitions, 173 flow [2022-12-13 11:12:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:12:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:12:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 11:12:27,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-13 11:12:27,445 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 5 states and 40 transitions. [2022-12-13 11:12:27,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 39 transitions, 173 flow [2022-12-13 11:12:27,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 39 transitions, 165 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 11:12:27,447 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 74 flow [2022-12-13 11:12:27,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2022-12-13 11:12:27,447 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-13 11:12:27,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:27,448 INFO L89 Accepts]: Start accepts. Operand has 24 places, 21 transitions, 74 flow [2022-12-13 11:12:27,449 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:27,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:27,449 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-13 11:12:27,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 74 flow [2022-12-13 11:12:27,454 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-13 11:12:27,454 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-13 11:12:27,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 28 events. 4/28 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 32. Up to 6 conditions per place. [2022-12-13 11:12:27,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-13 11:12:27,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 11:12:27,659 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:12:27,660 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-13 11:12:27,660 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 65 flow [2022-12-13 11:12:27,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-12-13 11:12:27,660 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:27,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:27,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:12:27,661 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1532974384, now seen corresponding path program 1 times [2022-12-13 11:12:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:27,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890908040] [2022-12-13 11:12:27,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:27,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:27,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:27,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890908040] [2022-12-13 11:12:27,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890908040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:27,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:27,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:12:27,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594958057] [2022-12-13 11:12:27,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:27,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:27,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:27,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:27,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:27,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 11:12:27,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 11:12:27,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:27,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 11:12:27,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:27,900 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-13 11:12:27,901 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-12-13 11:12:27,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 169 events. 87/169 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 526 event pairs, 33 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 220. Up to 109 conditions per place. [2022-12-13 11:12:27,902 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 32 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2022-12-13 11:12:27,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 199 flow [2022-12-13 11:12:27,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:12:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:12:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-13 11:12:27,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 11:12:27,903 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 65 flow. Second operand 4 states and 36 transitions. [2022-12-13 11:12:27,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 36 transitions, 199 flow [2022-12-13 11:12:27,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 36 transitions, 169 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 11:12:27,905 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 72 flow [2022-12-13 11:12:27,905 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2022-12-13 11:12:27,906 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 11:12:27,906 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:27,906 INFO L89 Accepts]: Start accepts. Operand has 26 places, 20 transitions, 72 flow [2022-12-13 11:12:27,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:27,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:27,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 72 flow [2022-12-13 11:12:27,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 72 flow [2022-12-13 11:12:27,911 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-13 11:12:27,911 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 11:12:27,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 32 events. 3/32 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 30. Up to 6 conditions per place. [2022-12-13 11:12:27,912 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 72 flow [2022-12-13 11:12:27,912 INFO L226 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-13 11:12:28,004 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:28,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 11:12:28,005 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 75 flow [2022-12-13 11:12:28,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 11:12:28,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:28,006 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:28,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:12:28,006 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:28,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1412493814, now seen corresponding path program 2 times [2022-12-13 11:12:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:28,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792648462] [2022-12-13 11:12:28,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:28,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:28,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:28,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792648462] [2022-12-13 11:12:28,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792648462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:28,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:28,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:12:28,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848871584] [2022-12-13 11:12:28,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:28,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:28,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:28,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:28,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:28,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 11:12:28,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 11:12:28,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:28,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 11:12:28,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:28,217 INFO L130 PetriNetUnfolder]: 77/149 cut-off events. [2022-12-13 11:12:28,217 INFO L131 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2022-12-13 11:12:28,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 149 events. 77/149 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 435 event pairs, 42 based on Foata normal form. 4/128 useless extension candidates. Maximal degree in co-relation 272. Up to 126 conditions per place. [2022-12-13 11:12:28,219 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 24 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2022-12-13 11:12:28,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 161 flow [2022-12-13 11:12:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:12:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:12:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 11:12:28,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40789473684210525 [2022-12-13 11:12:28,220 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 75 flow. Second operand 4 states and 31 transitions. [2022-12-13 11:12:28,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 161 flow [2022-12-13 11:12:28,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 148 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 11:12:28,222 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 70 flow [2022-12-13 11:12:28,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2022-12-13 11:12:28,223 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-13 11:12:28,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:28,223 INFO L89 Accepts]: Start accepts. Operand has 27 places, 20 transitions, 70 flow [2022-12-13 11:12:28,224 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:28,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:28,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 20 transitions, 70 flow [2022-12-13 11:12:28,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 70 flow [2022-12-13 11:12:28,228 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-13 11:12:28,228 INFO L131 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2022-12-13 11:12:28,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 29 events. 3/29 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-12-13 11:12:28,229 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 70 flow [2022-12-13 11:12:28,229 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 11:12:28,616 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:28,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 394 [2022-12-13 11:12:28,617 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 64 flow [2022-12-13 11:12:28,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 11:12:28,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:28,618 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:28,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:12:28,618 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:28,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:28,619 INFO L85 PathProgramCache]: Analyzing trace with hash -70219336, now seen corresponding path program 1 times [2022-12-13 11:12:28,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:28,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119069646] [2022-12-13 11:12:28,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:28,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:28,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:28,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119069646] [2022-12-13 11:12:28,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119069646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:28,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:28,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:12:28,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053158326] [2022-12-13 11:12:28,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:28,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:28,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:28,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:28,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 11:12:28,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 11:12:28,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:28,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 11:12:28,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:28,978 INFO L130 PetriNetUnfolder]: 93/181 cut-off events. [2022-12-13 11:12:28,979 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-13 11:12:28,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 181 events. 93/181 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 573 event pairs, 42 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 413. Up to 130 conditions per place. [2022-12-13 11:12:28,980 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 32 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2022-12-13 11:12:28,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 36 transitions, 186 flow [2022-12-13 11:12:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:12:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:12:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 11:12:28,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-13 11:12:28,982 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 64 flow. Second operand 4 states and 37 transitions. [2022-12-13 11:12:28,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 36 transitions, 186 flow [2022-12-13 11:12:28,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 36 transitions, 166 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-13 11:12:28,984 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 81 flow [2022-12-13 11:12:28,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2022-12-13 11:12:28,986 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 11:12:28,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:28,987 INFO L89 Accepts]: Start accepts. Operand has 26 places, 22 transitions, 81 flow [2022-12-13 11:12:28,988 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:28,988 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:28,988 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 22 transitions, 81 flow [2022-12-13 11:12:28,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 81 flow [2022-12-13 11:12:28,993 INFO L130 PetriNetUnfolder]: 5/41 cut-off events. [2022-12-13 11:12:28,994 INFO L131 PetriNetUnfolder]: For 19/21 co-relation queries the response was YES. [2022-12-13 11:12:28,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 41 events. 5/41 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-13 11:12:28,994 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 22 transitions, 81 flow [2022-12-13 11:12:28,994 INFO L226 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-13 11:12:29,010 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [779] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967296) (mod v_~n~0_91 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 0)) InVars {~n~0=v_~n~0_91} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, ~n~0=v_~n~0_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 11:12:29,482 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:12:29,483 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 497 [2022-12-13 11:12:29,483 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 92 flow [2022-12-13 11:12:29,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 11:12:29,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:29,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:29,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:12:29,483 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:29,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:29,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1941960187, now seen corresponding path program 1 times [2022-12-13 11:12:29,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:29,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854325472] [2022-12-13 11:12:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:29,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:29,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:29,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854325472] [2022-12-13 11:12:29,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854325472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:29,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:29,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:12:29,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478850332] [2022-12-13 11:12:29,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:29,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:29,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:29,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:29,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:29,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 11:12:29,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 11:12:29,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:29,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 11:12:29,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:29,774 INFO L130 PetriNetUnfolder]: 139/273 cut-off events. [2022-12-13 11:12:29,774 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-12-13 11:12:29,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 273 events. 139/273 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1079 event pairs, 62 based on Foata normal form. 4/234 useless extension candidates. Maximal degree in co-relation 512. Up to 180 conditions per place. [2022-12-13 11:12:29,776 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 40 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-13 11:12:29,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 43 transitions, 258 flow [2022-12-13 11:12:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:12:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:12:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 11:12:29,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-13 11:12:29,777 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 92 flow. Second operand 4 states and 43 transitions. [2022-12-13 11:12:29,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 43 transitions, 258 flow [2022-12-13 11:12:29,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 248 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-13 11:12:29,779 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 106 flow [2022-12-13 11:12:29,779 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-13 11:12:29,780 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2022-12-13 11:12:29,780 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:29,780 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 106 flow [2022-12-13 11:12:29,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:29,781 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:29,781 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 106 flow [2022-12-13 11:12:29,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 106 flow [2022-12-13 11:12:29,786 INFO L130 PetriNetUnfolder]: 4/54 cut-off events. [2022-12-13 11:12:29,787 INFO L131 PetriNetUnfolder]: For 20/24 co-relation queries the response was YES. [2022-12-13 11:12:29,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 54 events. 4/54 cut-off events. For 20/24 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 188 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2022-12-13 11:12:29,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 106 flow [2022-12-13 11:12:29,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 11:12:29,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [781] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_153| v_~f~0.base_125))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_125 (* v_~x2~0_230 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_125 (* 4 .cse2))))) (and (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_194| 4294967293) 4294967296) (mod (+ v_~n~0_95 4294967294) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| (ite (and (< .cse0 v_~size~0_111) (<= 0 .cse0)) 1 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_194|) (not (= (ite (and (<= 0 v_~x2~0_230) (< v_~x2~0_230 v_~size~0_111)) 1 0) 0)) (= v_~x2~0_229 (select .cse1 (+ v_~f~0.offset_125 (* .cse0 4)))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_111)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|))))) InVars {~x2~0=v_~x2~0_230, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, #memory_int=|v_#memory_int_153|, ~n~0=v_~n~0_95, ~f~0.offset=v_~f~0.offset_125} OutVars{~x2~0=v_~x2~0_229, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_194|, ~f~0.offset=v_~f~0.offset_125, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_153|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_95, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_45|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [783] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_157| v_~f~0.base_129))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_129 (* v_~x2~0_243 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_129 (* .cse1 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_243) (< v_~x2~0_243 v_~size~0_115)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= |v_thread2Thread1of1ForFork1_~i~1#1_207| (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_208|)) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_51| 4294967296) (mod v_~n~0_99 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_51| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_115)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_208| 4294967296) (mod (+ v_~n~0_99 4294967294) 4294967296)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (= (select .cse2 (+ v_~f~0.offset_129 (* .cse0 4))) v_~x2~0_242))))) InVars {~x2~0=v_~x2~0_243, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_129, #memory_int=|v_#memory_int_157|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_208|, ~n~0=v_~n~0_99, ~f~0.offset=v_~f~0.offset_129} OutVars{~x2~0=v_~x2~0_242, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_33|, ~size~0=v_~size~0_115, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, ~f~0.base=v_~f~0.base_129, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_43|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_207|, ~f~0.offset=v_~f~0.offset_129, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_31|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_51|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_157|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_43|, ~n~0=v_~n~0_99, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_47|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 11:12:30,156 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:30,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 377 [2022-12-13 11:12:30,157 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 107 flow [2022-12-13 11:12:30,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 11:12:30,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:30,158 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:30,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:12:30,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:30,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1695881691, now seen corresponding path program 2 times [2022-12-13 11:12:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:30,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324911714] [2022-12-13 11:12:30,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:30,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:30,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:30,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324911714] [2022-12-13 11:12:30,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324911714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:30,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:30,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:12:30,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290843861] [2022-12-13 11:12:30,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:30,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:30,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:30,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:30,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:30,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 11:12:30,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 11:12:30,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:30,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 11:12:30,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:30,369 INFO L130 PetriNetUnfolder]: 140/276 cut-off events. [2022-12-13 11:12:30,369 INFO L131 PetriNetUnfolder]: For 364/364 co-relation queries the response was YES. [2022-12-13 11:12:30,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 276 events. 140/276 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1044 event pairs, 89 based on Foata normal form. 2/263 useless extension candidates. Maximal degree in co-relation 672. Up to 241 conditions per place. [2022-12-13 11:12:30,371 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2022-12-13 11:12:30,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 222 flow [2022-12-13 11:12:30,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:12:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:12:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-13 11:12:30,373 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-13 11:12:30,373 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 107 flow. Second operand 4 states and 32 transitions. [2022-12-13 11:12:30,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 222 flow [2022-12-13 11:12:30,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 207 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 11:12:30,375 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 122 flow [2022-12-13 11:12:30,375 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-13 11:12:30,376 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-13 11:12:30,376 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:30,376 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 122 flow [2022-12-13 11:12:30,376 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:30,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:30,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 122 flow [2022-12-13 11:12:30,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 122 flow [2022-12-13 11:12:30,387 INFO L130 PetriNetUnfolder]: 7/64 cut-off events. [2022-12-13 11:12:30,387 INFO L131 PetriNetUnfolder]: For 48/54 co-relation queries the response was YES. [2022-12-13 11:12:30,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 64 events. 7/64 cut-off events. For 48/54 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 240 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 89. Up to 9 conditions per place. [2022-12-13 11:12:30,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 122 flow [2022-12-13 11:12:30,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-13 11:12:30,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [766] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= v_~x1~0_Out_6 (select (select |v_#memory_int_In_11| v_~f~0.base_In_7) (+ v_~f~0.offset_In_7 (* v_~x1~0_In_3 4)))) (= (ite (and (< v_~x1~0_In_3 v_~size~0_In_7) (<= 0 v_~x1~0_In_3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod v_~n~0_In_5 4294967296))) InVars {~size~0=v_~size~0_In_7, ~f~0.base=v_~f~0.base_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_11|, ~n~0=v_~n~0_In_5, ~x1~0=v_~x1~0_In_3, ~f~0.offset=v_~f~0.offset_In_7} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_7, ~f~0.base=v_~f~0.base_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_11|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_5, ~x1~0=v_~x1~0_Out_6, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [780] $Ultimate##0-->L49-2: Formula: (and (= (select (select |v_#memory_int_151| v_~f~0.base_123) (+ v_~f~0.offset_123 (* v_~x1~0_71 4))) v_~x1~0_70) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| 1) (= (ite (and (<= 0 v_~x1~0_71) (< v_~x1~0_71 v_~size~0_109)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|) (< 0 (mod v_~n~0_93 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| 0))) InVars {~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_123, #memory_int=|v_#memory_int_151|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_71, ~f~0.offset=v_~f~0.offset_123} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_35|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_123, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, #memory_int=|v_#memory_int_151|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_45|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_70, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_43|, ~f~0.offset=v_~f~0.offset_123} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 11:12:30,531 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_155| v_~f~0.base_127))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_127 (* v_~x2~0_236 4))))) (and (<= (mod (+ v_~n~0_97 4294967294) 4294967296) 0) (not (= (ite (and (<= 0 v_~x2~0_236) (< v_~x2~0_236 v_~size~0_113)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_23|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190| 0)) (= (select .cse0 (+ (* .cse1 4) v_~f~0.offset_127)) v_~x2~0_235) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| (ite (and (< .cse1 v_~size~0_113) (<= 0 .cse1)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_200|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_23| 0)))) InVars {~x2~0=v_~x2~0_236, ~size~0=v_~size~0_113, ~f~0.base=v_~f~0.base_127, ~f~0.offset=v_~f~0.offset_127, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_97} OutVars{~x2~0=v_~x2~0_235, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_33|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_37|, ~size~0=v_~size~0_113, ~f~0.base=v_~f~0.base_127, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_23|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_200|, ~f~0.offset=v_~f~0.offset_127, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_23|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_45|, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_97} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [780] $Ultimate##0-->L49-2: Formula: (and (= (select (select |v_#memory_int_151| v_~f~0.base_123) (+ v_~f~0.offset_123 (* v_~x1~0_71 4))) v_~x1~0_70) (= |v_thread1Thread1of1ForFork0_~i~0#1_47| 1) (= (ite (and (<= 0 v_~x1~0_71) (< v_~x1~0_71 v_~size~0_109)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|) (< 0 (mod v_~n~0_93 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| 0))) InVars {~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_123, #memory_int=|v_#memory_int_151|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_71, ~f~0.offset=v_~f~0.offset_123} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_35|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|, ~size~0=v_~size~0_109, ~f~0.base=v_~f~0.base_123, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_47|, #memory_int=|v_#memory_int_151|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_45|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_70, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_43|, ~f~0.offset=v_~f~0.offset_123} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 11:12:30,774 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:30,775 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 399 [2022-12-13 11:12:30,775 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 139 flow [2022-12-13 11:12:30,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 11:12:30,775 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:30,776 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:30,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:12:30,776 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:30,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1493526263, now seen corresponding path program 1 times [2022-12-13 11:12:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:30,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773447327] [2022-12-13 11:12:30,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:30,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:30,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773447327] [2022-12-13 11:12:30,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773447327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:30,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:30,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:12:30,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33683497] [2022-12-13 11:12:30,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:30,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:12:30,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:30,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:12:30,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:12:30,886 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 11:12:30,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-13 11:12:30,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:30,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 11:12:30,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:30,982 INFO L130 PetriNetUnfolder]: 143/283 cut-off events. [2022-12-13 11:12:30,982 INFO L131 PetriNetUnfolder]: For 550/550 co-relation queries the response was YES. [2022-12-13 11:12:30,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 283 events. 143/283 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1084 event pairs, 97 based on Foata normal form. 4/272 useless extension candidates. Maximal degree in co-relation 749. Up to 279 conditions per place. [2022-12-13 11:12:30,984 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-13 11:12:30,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 202 flow [2022-12-13 11:12:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:12:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:12:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-13 11:12:30,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-13 11:12:30,986 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 139 flow. Second operand 3 states and 27 transitions. [2022-12-13 11:12:30,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 202 flow [2022-12-13 11:12:30,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:12:30,988 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 143 flow [2022-12-13 11:12:30,988 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2022-12-13 11:12:30,988 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-13 11:12:30,988 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:30,988 INFO L89 Accepts]: Start accepts. Operand has 37 places, 27 transitions, 143 flow [2022-12-13 11:12:30,989 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:30,989 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:30,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 143 flow [2022-12-13 11:12:30,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 143 flow [2022-12-13 11:12:30,996 INFO L130 PetriNetUnfolder]: 6/65 cut-off events. [2022-12-13 11:12:30,997 INFO L131 PetriNetUnfolder]: For 81/90 co-relation queries the response was YES. [2022-12-13 11:12:30,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 65 events. 6/65 cut-off events. For 81/90 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 274 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 115. Up to 9 conditions per place. [2022-12-13 11:12:30,997 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 143 flow [2022-12-13 11:12:30,998 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 11:12:31,923 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:12:31,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 936 [2022-12-13 11:12:31,924 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 133 flow [2022-12-13 11:12:31,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-13 11:12:31,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:31,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:31,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:12:31,924 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:31,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1549881921, now seen corresponding path program 3 times [2022-12-13 11:12:31,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:31,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003226755] [2022-12-13 11:12:31,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:31,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:32,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:32,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003226755] [2022-12-13 11:12:32,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003226755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:32,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:32,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:12:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883318805] [2022-12-13 11:12:32,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:32,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:32,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:32,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:32,057 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 11:12:32,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 11:12:32,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:32,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 11:12:32,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:32,189 INFO L130 PetriNetUnfolder]: 138/266 cut-off events. [2022-12-13 11:12:32,189 INFO L131 PetriNetUnfolder]: For 529/529 co-relation queries the response was YES. [2022-12-13 11:12:32,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 266 events. 138/266 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1027 event pairs, 54 based on Foata normal form. 2/253 useless extension candidates. Maximal degree in co-relation 835. Up to 182 conditions per place. [2022-12-13 11:12:32,191 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 35 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2022-12-13 11:12:32,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 269 flow [2022-12-13 11:12:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:12:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:12:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-13 11:12:32,193 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2022-12-13 11:12:32,194 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 133 flow. Second operand 4 states and 39 transitions. [2022-12-13 11:12:32,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 269 flow [2022-12-13 11:12:32,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 245 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 11:12:32,197 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 144 flow [2022-12-13 11:12:32,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2022-12-13 11:12:32,198 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-13 11:12:32,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:32,199 INFO L89 Accepts]: Start accepts. Operand has 37 places, 27 transitions, 144 flow [2022-12-13 11:12:32,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:32,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:32,200 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 144 flow [2022-12-13 11:12:32,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 144 flow [2022-12-13 11:12:32,209 INFO L130 PetriNetUnfolder]: 8/59 cut-off events. [2022-12-13 11:12:32,209 INFO L131 PetriNetUnfolder]: For 93/104 co-relation queries the response was YES. [2022-12-13 11:12:32,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 59 events. 8/59 cut-off events. For 93/104 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 210 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 100. Up to 8 conditions per place. [2022-12-13 11:12:32,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 144 flow [2022-12-13 11:12:32,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-13 11:12:32,219 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_155| v_~f~0.base_127))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_127 (* v_~x2~0_236 4))))) (and (<= (mod (+ v_~n~0_97 4294967294) 4294967296) 0) (not (= (ite (and (<= 0 v_~x2~0_236) (< v_~x2~0_236 v_~size~0_113)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_23|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190| 0)) (= (select .cse0 (+ (* .cse1 4) v_~f~0.offset_127)) v_~x2~0_235) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| (ite (and (< .cse1 v_~size~0_113) (<= 0 .cse1)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_200|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_23| 0)))) InVars {~x2~0=v_~x2~0_236, ~size~0=v_~size~0_113, ~f~0.base=v_~f~0.base_127, ~f~0.offset=v_~f~0.offset_127, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_97} OutVars{~x2~0=v_~x2~0_235, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_33|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_37|, ~size~0=v_~size~0_113, ~f~0.base=v_~f~0.base_127, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_23|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_200|, ~f~0.offset=v_~f~0.offset_127, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_23|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_45|, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_97} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [766] L49-2-->L49-2: Formula: (and (= |v_thread1Thread1of1ForFork0_~i~0#1_Out_2| (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 1)) (= v_~x1~0_Out_6 (select (select |v_#memory_int_In_11| v_~f~0.base_In_7) (+ v_~f~0.offset_In_7 (* v_~x1~0_In_3 4)))) (= (ite (and (< v_~x1~0_In_3 v_~size~0_In_7) (<= 0 v_~x1~0_In_3)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_1| 4294967296) (mod v_~n~0_In_5 4294967296))) InVars {~size~0=v_~size~0_In_7, ~f~0.base=v_~f~0.base_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_1|, #memory_int=|v_#memory_int_In_11|, ~n~0=v_~n~0_In_5, ~x1~0=v_~x1~0_In_3, ~f~0.offset=v_~f~0.offset_In_7} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_2|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, ~size~0=v_~size~0_In_7, ~f~0.base=v_~f~0.base_In_7, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_2|, #memory_int=|v_#memory_int_In_11|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, ~n~0=v_~n~0_In_5, ~x1~0=v_~x1~0_Out_6, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_2|, ~f~0.offset=v_~f~0.offset_In_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-13 11:12:32,525 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:12:32,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 328 [2022-12-13 11:12:32,526 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 147 flow [2022-12-13 11:12:32,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-12-13 11:12:32,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:32,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:32,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:12:32,527 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:32,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1680861463, now seen corresponding path program 1 times [2022-12-13 11:12:32,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:32,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105120256] [2022-12-13 11:12:32,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:32,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:33,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105120256] [2022-12-13 11:12:33,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105120256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:33,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:33,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:12:33,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165986702] [2022-12-13 11:12:33,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:33,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:12:33,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:33,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:12:33,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:12:33,112 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 11:12:33,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 147 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-12-13 11:12:33,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:33,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 11:12:33,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:33,287 INFO L130 PetriNetUnfolder]: 183/349 cut-off events. [2022-12-13 11:12:33,287 INFO L131 PetriNetUnfolder]: For 1084/1084 co-relation queries the response was YES. [2022-12-13 11:12:33,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 349 events. 183/349 cut-off events. For 1084/1084 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1421 event pairs, 31 based on Foata normal form. 2/331 useless extension candidates. Maximal degree in co-relation 932. Up to 274 conditions per place. [2022-12-13 11:12:33,290 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 39 selfloop transitions, 13 changer transitions 10/62 dead transitions. [2022-12-13 11:12:33,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 470 flow [2022-12-13 11:12:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:12:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:12:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-13 11:12:33,291 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2022-12-13 11:12:33,291 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 147 flow. Second operand 5 states and 61 transitions. [2022-12-13 11:12:33,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 470 flow [2022-12-13 11:12:33,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 62 transitions, 438 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 11:12:33,295 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 261 flow [2022-12-13 11:12:33,296 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2022-12-13 11:12:33,297 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-13 11:12:33,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:33,297 INFO L89 Accepts]: Start accepts. Operand has 40 places, 38 transitions, 261 flow [2022-12-13 11:12:33,300 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:33,300 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:33,300 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 38 transitions, 261 flow [2022-12-13 11:12:33,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 38 transitions, 261 flow [2022-12-13 11:12:33,316 INFO L130 PetriNetUnfolder]: 23/120 cut-off events. [2022-12-13 11:12:33,317 INFO L131 PetriNetUnfolder]: For 234/257 co-relation queries the response was YES. [2022-12-13 11:12:33,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 120 events. 23/120 cut-off events. For 234/257 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 594 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 225. Up to 25 conditions per place. [2022-12-13 11:12:33,318 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 38 transitions, 261 flow [2022-12-13 11:12:33,318 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 11:12:35,276 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:35,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1980 [2022-12-13 11:12:35,277 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 258 flow [2022-12-13 11:12:35,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-12-13 11:12:35,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:35,277 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:35,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:12:35,278 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash -753351352, now seen corresponding path program 1 times [2022-12-13 11:12:35,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:35,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962612513] [2022-12-13 11:12:35,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:35,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:35,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:35,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:35,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962612513] [2022-12-13 11:12:35,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962612513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:35,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:35,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:12:35,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824415788] [2022-12-13 11:12:35,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:35,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:12:35,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:35,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:12:35,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:12:35,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 11:12:35,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:12:35,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:35,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 11:12:35,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:35,553 INFO L130 PetriNetUnfolder]: 188/359 cut-off events. [2022-12-13 11:12:35,554 INFO L131 PetriNetUnfolder]: For 1062/1062 co-relation queries the response was YES. [2022-12-13 11:12:35,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 359 events. 188/359 cut-off events. For 1062/1062 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1447 event pairs, 97 based on Foata normal form. 8/366 useless extension candidates. Maximal degree in co-relation 1013. Up to 350 conditions per place. [2022-12-13 11:12:35,556 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 38 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2022-12-13 11:12:35,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 351 flow [2022-12-13 11:12:35,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:12:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:12:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 11:12:35,558 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 11:12:35,558 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 258 flow. Second operand 3 states and 30 transitions. [2022-12-13 11:12:35,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 351 flow [2022-12-13 11:12:35,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 343 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 11:12:35,562 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 269 flow [2022-12-13 11:12:35,562 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=269, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2022-12-13 11:12:35,562 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2022-12-13 11:12:35,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:35,563 INFO L89 Accepts]: Start accepts. Operand has 41 places, 38 transitions, 269 flow [2022-12-13 11:12:35,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:35,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:35,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 38 transitions, 269 flow [2022-12-13 11:12:35,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 38 transitions, 269 flow [2022-12-13 11:12:35,585 INFO L130 PetriNetUnfolder]: 20/121 cut-off events. [2022-12-13 11:12:35,586 INFO L131 PetriNetUnfolder]: For 268/291 co-relation queries the response was YES. [2022-12-13 11:12:35,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 121 events. 20/121 cut-off events. For 268/291 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 642 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 288. Up to 24 conditions per place. [2022-12-13 11:12:35,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 38 transitions, 269 flow [2022-12-13 11:12:35,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-13 11:12:37,292 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:37,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1731 [2022-12-13 11:12:37,294 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 268 flow [2022-12-13 11:12:37,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:12:37,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:37,294 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:37,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:12:37,294 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:37,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1552434696, now seen corresponding path program 1 times [2022-12-13 11:12:37,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:37,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228074065] [2022-12-13 11:12:37,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:37,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:37,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:37,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228074065] [2022-12-13 11:12:37,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228074065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:37,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:37,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:12:37,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353411717] [2022-12-13 11:12:37,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:37,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:12:37,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:37,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:12:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:12:37,692 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 11:12:37,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 268 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-12-13 11:12:37,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:37,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 11:12:37,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:38,207 INFO L130 PetriNetUnfolder]: 381/720 cut-off events. [2022-12-13 11:12:38,207 INFO L131 PetriNetUnfolder]: For 2378/2378 co-relation queries the response was YES. [2022-12-13 11:12:38,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 720 events. 381/720 cut-off events. For 2378/2378 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3602 event pairs, 76 based on Foata normal form. 12/731 useless extension candidates. Maximal degree in co-relation 2637. Up to 252 conditions per place. [2022-12-13 11:12:38,211 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 27 selfloop transitions, 7 changer transitions 81/115 dead transitions. [2022-12-13 11:12:38,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 115 transitions, 924 flow [2022-12-13 11:12:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:12:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 11:12:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-12-13 11:12:38,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-13 11:12:38,232 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 268 flow. Second operand 9 states and 108 transitions. [2022-12-13 11:12:38,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 115 transitions, 924 flow [2022-12-13 11:12:38,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 115 transitions, 898 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 11:12:38,243 INFO L231 Difference]: Finished difference. Result has 52 places, 31 transitions, 255 flow [2022-12-13 11:12:38,243 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=255, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2022-12-13 11:12:38,244 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 31 predicate places. [2022-12-13 11:12:38,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:38,244 INFO L89 Accepts]: Start accepts. Operand has 52 places, 31 transitions, 255 flow [2022-12-13 11:12:38,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:38,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:38,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 31 transitions, 255 flow [2022-12-13 11:12:38,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 31 transitions, 255 flow [2022-12-13 11:12:38,273 INFO L130 PetriNetUnfolder]: 20/89 cut-off events. [2022-12-13 11:12:38,273 INFO L131 PetriNetUnfolder]: For 384/405 co-relation queries the response was YES. [2022-12-13 11:12:38,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 89 events. 20/89 cut-off events. For 384/405 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 377 event pairs, 3 based on Foata normal form. 1/83 useless extension candidates. Maximal degree in co-relation 258. Up to 21 conditions per place. [2022-12-13 11:12:38,275 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 31 transitions, 255 flow [2022-12-13 11:12:38,275 INFO L226 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-13 11:12:38,293 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [781] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_153| v_~f~0.base_125))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_125 (* v_~x2~0_230 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_125 (* 4 .cse2))))) (and (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_194| 4294967293) 4294967296) (mod (+ v_~n~0_95 4294967294) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| (ite (and (< .cse0 v_~size~0_111) (<= 0 .cse0)) 1 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_194|) (not (= (ite (and (<= 0 v_~x2~0_230) (< v_~x2~0_230 v_~size~0_111)) 1 0) 0)) (= v_~x2~0_229 (select .cse1 (+ v_~f~0.offset_125 (* .cse0 4)))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_111)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|))))) InVars {~x2~0=v_~x2~0_230, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, #memory_int=|v_#memory_int_153|, ~n~0=v_~n~0_95, ~f~0.offset=v_~f~0.offset_125} OutVars{~x2~0=v_~x2~0_229, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_194|, ~f~0.offset=v_~f~0.offset_125, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_153|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_95, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_45|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [779] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967296) (mod v_~n~0_91 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 0)) InVars {~n~0=v_~n~0_91} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, ~n~0=v_~n~0_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 11:12:38,542 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:38,543 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-13 11:12:38,545 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 276 flow [2022-12-13 11:12:38,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-12-13 11:12:38,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:38,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:38,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:12:38,546 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:38,547 INFO L85 PathProgramCache]: Analyzing trace with hash 80567893, now seen corresponding path program 1 times [2022-12-13 11:12:38,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:38,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102569614] [2022-12-13 11:12:38,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:38,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:38,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:38,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102569614] [2022-12-13 11:12:38,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102569614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:38,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:38,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:12:38,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045508754] [2022-12-13 11:12:38,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:38,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:12:38,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:38,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:12:38,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:12:38,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 11:12:38,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-13 11:12:38,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:38,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 11:12:38,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:38,873 INFO L130 PetriNetUnfolder]: 157/320 cut-off events. [2022-12-13 11:12:38,873 INFO L131 PetriNetUnfolder]: For 1683/1683 co-relation queries the response was YES. [2022-12-13 11:12:38,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 320 events. 157/320 cut-off events. For 1683/1683 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1324 event pairs, 99 based on Foata normal form. 4/323 useless extension candidates. Maximal degree in co-relation 1281. Up to 316 conditions per place. [2022-12-13 11:12:38,876 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 33 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-12-13 11:12:38,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 35 transitions, 336 flow [2022-12-13 11:12:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:12:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:12:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-13 11:12:38,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2022-12-13 11:12:38,877 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 276 flow. Second operand 3 states and 29 transitions. [2022-12-13 11:12:38,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 35 transitions, 336 flow [2022-12-13 11:12:38,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 284 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-13 11:12:38,882 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 217 flow [2022-12-13 11:12:38,882 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 11:12:38,883 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-13 11:12:38,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:38,883 INFO L89 Accepts]: Start accepts. Operand has 42 places, 32 transitions, 217 flow [2022-12-13 11:12:38,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:38,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:38,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 217 flow [2022-12-13 11:12:38,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 217 flow [2022-12-13 11:12:38,899 INFO L130 PetriNetUnfolder]: 18/101 cut-off events. [2022-12-13 11:12:38,899 INFO L131 PetriNetUnfolder]: For 196/207 co-relation queries the response was YES. [2022-12-13 11:12:38,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 101 events. 18/101 cut-off events. For 196/207 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 475 event pairs, 3 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 247. Up to 23 conditions per place. [2022-12-13 11:12:38,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 217 flow [2022-12-13 11:12:38,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-13 11:12:40,308 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:40,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1425 [2022-12-13 11:12:40,309 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 213 flow [2022-12-13 11:12:40,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-12-13 11:12:40,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:40,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:40,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:12:40,309 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:40,309 INFO L85 PathProgramCache]: Analyzing trace with hash 522569237, now seen corresponding path program 1 times [2022-12-13 11:12:40,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:40,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064922051] [2022-12-13 11:12:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:40,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:40,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:40,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064922051] [2022-12-13 11:12:40,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064922051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:40,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:40,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:12:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632436825] [2022-12-13 11:12:40,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:40,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:12:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:40,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:12:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:12:40,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 11:12:40,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 213 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-12-13 11:12:40,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:40,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 11:12:40,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:41,215 INFO L130 PetriNetUnfolder]: 191/379 cut-off events. [2022-12-13 11:12:41,215 INFO L131 PetriNetUnfolder]: For 1300/1300 co-relation queries the response was YES. [2022-12-13 11:12:41,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 379 events. 191/379 cut-off events. For 1300/1300 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1634 event pairs, 36 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 1395. Up to 313 conditions per place. [2022-12-13 11:12:41,218 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 36 selfloop transitions, 20 changer transitions 8/64 dead transitions. [2022-12-13 11:12:41,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 522 flow [2022-12-13 11:12:41,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:12:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:12:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-13 11:12:41,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-13 11:12:41,219 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 213 flow. Second operand 6 states and 62 transitions. [2022-12-13 11:12:41,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 522 flow [2022-12-13 11:12:41,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 491 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 11:12:41,224 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 383 flow [2022-12-13 11:12:41,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2022-12-13 11:12:41,225 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2022-12-13 11:12:41,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:41,225 INFO L89 Accepts]: Start accepts. Operand has 45 places, 44 transitions, 383 flow [2022-12-13 11:12:41,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:41,226 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:41,226 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 44 transitions, 383 flow [2022-12-13 11:12:41,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 383 flow [2022-12-13 11:12:41,246 INFO L130 PetriNetUnfolder]: 30/129 cut-off events. [2022-12-13 11:12:41,246 INFO L131 PetriNetUnfolder]: For 357/390 co-relation queries the response was YES. [2022-12-13 11:12:41,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 129 events. 30/129 cut-off events. For 357/390 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 605 event pairs, 1 based on Foata normal form. 7/126 useless extension candidates. Maximal degree in co-relation 347. Up to 32 conditions per place. [2022-12-13 11:12:41,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 44 transitions, 383 flow [2022-12-13 11:12:41,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-13 11:12:43,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [781] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_153| v_~f~0.base_125))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_125 (* v_~x2~0_230 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_125 (* 4 .cse2))))) (and (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_194| 4294967293) 4294967296) (mod (+ v_~n~0_95 4294967294) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| (ite (and (< .cse0 v_~size~0_111) (<= 0 .cse0)) 1 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_194|) (not (= (ite (and (<= 0 v_~x2~0_230) (< v_~x2~0_230 v_~size~0_111)) 1 0) 0)) (= v_~x2~0_229 (select .cse1 (+ v_~f~0.offset_125 (* .cse0 4)))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_111)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|))))) InVars {~x2~0=v_~x2~0_230, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, #memory_int=|v_#memory_int_153|, ~n~0=v_~n~0_95, ~f~0.offset=v_~f~0.offset_125} OutVars{~x2~0=v_~x2~0_229, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_194|, ~f~0.offset=v_~f~0.offset_125, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_153|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_95, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_45|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [779] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967296) (mod v_~n~0_91 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 0)) InVars {~n~0=v_~n~0_91} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, ~n~0=v_~n~0_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-13 11:12:43,356 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:12:43,357 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2132 [2022-12-13 11:12:43,357 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 395 flow [2022-12-13 11:12:43,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-12-13 11:12:43,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:43,357 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:43,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:12:43,357 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:43,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:43,358 INFO L85 PathProgramCache]: Analyzing trace with hash 829732024, now seen corresponding path program 1 times [2022-12-13 11:12:43,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:43,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350005818] [2022-12-13 11:12:43,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:43,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:43,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:43,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350005818] [2022-12-13 11:12:43,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350005818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:43,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:43,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:12:43,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587759014] [2022-12-13 11:12:43,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:43,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:12:43,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:43,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:12:43,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:12:43,441 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 11:12:43,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:12:43,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:43,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 11:12:43,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:43,532 INFO L130 PetriNetUnfolder]: 193/389 cut-off events. [2022-12-13 11:12:43,532 INFO L131 PetriNetUnfolder]: For 1564/1564 co-relation queries the response was YES. [2022-12-13 11:12:43,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 389 events. 193/389 cut-off events. For 1564/1564 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1699 event pairs, 102 based on Foata normal form. 4/392 useless extension candidates. Maximal degree in co-relation 1273. Up to 378 conditions per place. [2022-12-13 11:12:43,534 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 43 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2022-12-13 11:12:43,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 502 flow [2022-12-13 11:12:43,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:12:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:12:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-13 11:12:43,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2022-12-13 11:12:43,535 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 395 flow. Second operand 3 states and 32 transitions. [2022-12-13 11:12:43,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 502 flow [2022-12-13 11:12:43,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 464 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-13 11:12:43,538 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 351 flow [2022-12-13 11:12:43,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2022-12-13 11:12:43,538 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 26 predicate places. [2022-12-13 11:12:43,539 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:43,539 INFO L89 Accepts]: Start accepts. Operand has 47 places, 43 transitions, 351 flow [2022-12-13 11:12:43,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:43,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:43,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 43 transitions, 351 flow [2022-12-13 11:12:43,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 43 transitions, 351 flow [2022-12-13 11:12:43,551 INFO L130 PetriNetUnfolder]: 28/128 cut-off events. [2022-12-13 11:12:43,551 INFO L131 PetriNetUnfolder]: For 314/339 co-relation queries the response was YES. [2022-12-13 11:12:43,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 128 events. 28/128 cut-off events. For 314/339 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 633 event pairs, 1 based on Foata normal form. 6/122 useless extension candidates. Maximal degree in co-relation 362. Up to 27 conditions per place. [2022-12-13 11:12:43,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 43 transitions, 351 flow [2022-12-13 11:12:43,552 INFO L226 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-13 11:12:46,688 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:46,689 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3150 [2022-12-13 11:12:46,689 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 350 flow [2022-12-13 11:12:46,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:12:46,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:46,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:46,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 11:12:46,689 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash 367564566, now seen corresponding path program 1 times [2022-12-13 11:12:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:46,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705846556] [2022-12-13 11:12:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:46,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:46,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705846556] [2022-12-13 11:12:46,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705846556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:46,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:46,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:12:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403090718] [2022-12-13 11:12:46,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:46,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:46,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:46,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:46,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 11:12:46,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 350 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:12:46,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:46,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 11:12:46,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:46,918 INFO L130 PetriNetUnfolder]: 186/367 cut-off events. [2022-12-13 11:12:46,918 INFO L131 PetriNetUnfolder]: For 1443/1443 co-relation queries the response was YES. [2022-12-13 11:12:46,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 367 events. 186/367 cut-off events. For 1443/1443 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1546 event pairs, 80 based on Foata normal form. 4/370 useless extension candidates. Maximal degree in co-relation 1434. Up to 295 conditions per place. [2022-12-13 11:12:46,920 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 50 selfloop transitions, 3 changer transitions 5/58 dead transitions. [2022-12-13 11:12:46,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 552 flow [2022-12-13 11:12:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:12:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:12:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 11:12:46,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3942307692307692 [2022-12-13 11:12:46,921 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 350 flow. Second operand 4 states and 41 transitions. [2022-12-13 11:12:46,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 552 flow [2022-12-13 11:12:46,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 528 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 11:12:46,924 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 345 flow [2022-12-13 11:12:46,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-13 11:12:46,925 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 26 predicate places. [2022-12-13 11:12:46,925 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:46,925 INFO L89 Accepts]: Start accepts. Operand has 47 places, 42 transitions, 345 flow [2022-12-13 11:12:46,926 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:46,926 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:46,927 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 345 flow [2022-12-13 11:12:46,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 345 flow [2022-12-13 11:12:46,939 INFO L130 PetriNetUnfolder]: 28/122 cut-off events. [2022-12-13 11:12:46,939 INFO L131 PetriNetUnfolder]: For 308/333 co-relation queries the response was YES. [2022-12-13 11:12:46,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 122 events. 28/122 cut-off events. For 308/333 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 574 event pairs, 1 based on Foata normal form. 6/119 useless extension candidates. Maximal degree in co-relation 314. Up to 25 conditions per place. [2022-12-13 11:12:46,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 345 flow [2022-12-13 11:12:46,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-13 11:12:46,940 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:12:46,941 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 11:12:46,941 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 345 flow [2022-12-13 11:12:46,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:12:46,941 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:46,941 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:46,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 11:12:46,942 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:46,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:46,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1825211203, now seen corresponding path program 1 times [2022-12-13 11:12:46,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:46,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7658471] [2022-12-13 11:12:46,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:46,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:47,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:47,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7658471] [2022-12-13 11:12:47,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7658471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:47,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:47,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:12:47,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450653659] [2022-12-13 11:12:47,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:47,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:12:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:47,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:12:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:12:47,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 11:12:47,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:12:47,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:47,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 11:12:47,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:47,198 INFO L130 PetriNetUnfolder]: 182/363 cut-off events. [2022-12-13 11:12:47,199 INFO L131 PetriNetUnfolder]: For 1420/1420 co-relation queries the response was YES. [2022-12-13 11:12:47,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 363 events. 182/363 cut-off events. For 1420/1420 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1540 event pairs, 96 based on Foata normal form. 4/366 useless extension candidates. Maximal degree in co-relation 1230. Up to 357 conditions per place. [2022-12-13 11:12:47,202 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-13 11:12:47,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 448 flow [2022-12-13 11:12:47,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:12:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:12:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-13 11:12:47,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2022-12-13 11:12:47,202 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 345 flow. Second operand 3 states and 31 transitions. [2022-12-13 11:12:47,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 448 flow [2022-12-13 11:12:47,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 443 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:12:47,206 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 357 flow [2022-12-13 11:12:47,206 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=357, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2022-12-13 11:12:47,207 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 26 predicate places. [2022-12-13 11:12:47,219 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:47,219 INFO L89 Accepts]: Start accepts. Operand has 47 places, 43 transitions, 357 flow [2022-12-13 11:12:47,221 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:47,221 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:47,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 43 transitions, 357 flow [2022-12-13 11:12:47,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 357 flow [2022-12-13 11:12:47,244 INFO L130 PetriNetUnfolder]: 27/123 cut-off events. [2022-12-13 11:12:47,245 INFO L131 PetriNetUnfolder]: For 320/345 co-relation queries the response was YES. [2022-12-13 11:12:47,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 123 events. 27/123 cut-off events. For 320/345 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 585 event pairs, 1 based on Foata normal form. 6/120 useless extension candidates. Maximal degree in co-relation 349. Up to 25 conditions per place. [2022-12-13 11:12:47,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 43 transitions, 357 flow [2022-12-13 11:12:47,246 INFO L226 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-13 11:12:51,023 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:51,023 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3804 [2022-12-13 11:12:51,023 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 356 flow [2022-12-13 11:12:51,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:12:51,023 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:51,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:51,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 11:12:51,024 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:51,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1141988668, now seen corresponding path program 1 times [2022-12-13 11:12:51,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:51,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714326202] [2022-12-13 11:12:51,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:51,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:51,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:51,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714326202] [2022-12-13 11:12:51,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714326202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:51,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:51,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:12:51,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115459028] [2022-12-13 11:12:51,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:51,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:51,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:51,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:51,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:51,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 11:12:51,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:12:51,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:51,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 11:12:51,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:51,225 INFO L130 PetriNetUnfolder]: 182/363 cut-off events. [2022-12-13 11:12:51,225 INFO L131 PetriNetUnfolder]: For 1443/1443 co-relation queries the response was YES. [2022-12-13 11:12:51,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 363 events. 182/363 cut-off events. For 1443/1443 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1539 event pairs, 76 based on Foata normal form. 4/366 useless extension candidates. Maximal degree in co-relation 1422. Up to 295 conditions per place. [2022-12-13 11:12:51,227 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 51 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2022-12-13 11:12:51,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 538 flow [2022-12-13 11:12:51,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:12:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:12:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 11:12:51,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3942307692307692 [2022-12-13 11:12:51,228 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 356 flow. Second operand 4 states and 41 transitions. [2022-12-13 11:12:51,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 538 flow [2022-12-13 11:12:51,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 516 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 11:12:51,233 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 393 flow [2022-12-13 11:12:51,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=393, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-12-13 11:12:51,233 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-13 11:12:51,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:51,233 INFO L89 Accepts]: Start accepts. Operand has 49 places, 45 transitions, 393 flow [2022-12-13 11:12:51,234 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:51,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:51,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 393 flow [2022-12-13 11:12:51,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 393 flow [2022-12-13 11:12:51,246 INFO L130 PetriNetUnfolder]: 27/123 cut-off events. [2022-12-13 11:12:51,246 INFO L131 PetriNetUnfolder]: For 370/401 co-relation queries the response was YES. [2022-12-13 11:12:51,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 123 events. 27/123 cut-off events. For 370/401 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 593 event pairs, 1 based on Foata normal form. 7/124 useless extension candidates. Maximal degree in co-relation 321. Up to 25 conditions per place. [2022-12-13 11:12:51,247 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 393 flow [2022-12-13 11:12:51,247 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 11:12:52,540 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:52,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1308 [2022-12-13 11:12:52,541 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 389 flow [2022-12-13 11:12:52,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:12:52,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:52,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:52,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 11:12:52,541 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:52,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1087394383, now seen corresponding path program 1 times [2022-12-13 11:12:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:52,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238422912] [2022-12-13 11:12:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:52,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:52,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238422912] [2022-12-13 11:12:52,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238422912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:52,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:52,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:12:52,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624219535] [2022-12-13 11:12:52,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:52,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:12:52,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:52,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:12:52,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:12:52,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 11:12:52,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 389 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:12:52,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:52,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 11:12:52,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:52,768 INFO L130 PetriNetUnfolder]: 182/363 cut-off events. [2022-12-13 11:12:52,768 INFO L131 PetriNetUnfolder]: For 1725/1725 co-relation queries the response was YES. [2022-12-13 11:12:52,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 363 events. 182/363 cut-off events. For 1725/1725 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1532 event pairs, 96 based on Foata normal form. 4/366 useless extension candidates. Maximal degree in co-relation 1258. Up to 357 conditions per place. [2022-12-13 11:12:52,771 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-13 11:12:52,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 498 flow [2022-12-13 11:12:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:12:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:12:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-13 11:12:52,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-13 11:12:52,772 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 389 flow. Second operand 3 states and 33 transitions. [2022-12-13 11:12:52,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 498 flow [2022-12-13 11:12:52,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 477 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 11:12:52,778 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 387 flow [2022-12-13 11:12:52,779 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-12-13 11:12:52,779 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-13 11:12:52,779 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:52,779 INFO L89 Accepts]: Start accepts. Operand has 49 places, 45 transitions, 387 flow [2022-12-13 11:12:52,781 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:52,781 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:52,781 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 387 flow [2022-12-13 11:12:52,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 387 flow [2022-12-13 11:12:52,795 INFO L130 PetriNetUnfolder]: 27/123 cut-off events. [2022-12-13 11:12:52,796 INFO L131 PetriNetUnfolder]: For 350/381 co-relation queries the response was YES. [2022-12-13 11:12:52,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 123 events. 27/123 cut-off events. For 350/381 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 592 event pairs, 1 based on Foata normal form. 7/123 useless extension candidates. Maximal degree in co-relation 356. Up to 25 conditions per place. [2022-12-13 11:12:52,797 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 387 flow [2022-12-13 11:12:52,797 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 11:12:58,790 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:12:58,791 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6012 [2022-12-13 11:12:58,791 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 386 flow [2022-12-13 11:12:58,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:12:58,791 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:12:58,791 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:58,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 11:12:58,791 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:12:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1426843153, now seen corresponding path program 1 times [2022-12-13 11:12:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:58,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402389577] [2022-12-13 11:12:58,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:58,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:58,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:58,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402389577] [2022-12-13 11:12:58,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402389577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:58,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:58,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:12:58,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998462008] [2022-12-13 11:12:58,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:58,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:58,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:58,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:58,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:58,872 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 11:12:58,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 386 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:12:58,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:12:58,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 11:12:58,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:12:59,002 INFO L130 PetriNetUnfolder]: 182/363 cut-off events. [2022-12-13 11:12:59,002 INFO L131 PetriNetUnfolder]: For 1549/1549 co-relation queries the response was YES. [2022-12-13 11:12:59,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 363 events. 182/363 cut-off events. For 1549/1549 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1544 event pairs, 76 based on Foata normal form. 4/366 useless extension candidates. Maximal degree in co-relation 1448. Up to 295 conditions per place. [2022-12-13 11:12:59,004 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 51 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2022-12-13 11:12:59,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 548 flow [2022-12-13 11:12:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:12:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:12:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-13 11:12:59,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 11:12:59,004 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 386 flow. Second operand 4 states and 42 transitions. [2022-12-13 11:12:59,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 548 flow [2022-12-13 11:12:59,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 526 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 11:12:59,007 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 393 flow [2022-12-13 11:12:59,007 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=393, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2022-12-13 11:12:59,008 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 29 predicate places. [2022-12-13 11:12:59,008 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:12:59,008 INFO L89 Accepts]: Start accepts. Operand has 50 places, 45 transitions, 393 flow [2022-12-13 11:12:59,008 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:12:59,008 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:12:59,008 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 45 transitions, 393 flow [2022-12-13 11:12:59,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 393 flow [2022-12-13 11:12:59,035 INFO L130 PetriNetUnfolder]: 27/123 cut-off events. [2022-12-13 11:12:59,035 INFO L131 PetriNetUnfolder]: For 361/392 co-relation queries the response was YES. [2022-12-13 11:12:59,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 123 events. 27/123 cut-off events. For 361/392 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 587 event pairs, 1 based on Foata normal form. 7/124 useless extension candidates. Maximal degree in co-relation 321. Up to 25 conditions per place. [2022-12-13 11:12:59,036 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 45 transitions, 393 flow [2022-12-13 11:12:59,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 11:13:00,279 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:13:00,280 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1272 [2022-12-13 11:13:00,280 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 392 flow [2022-12-13 11:13:00,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:13:00,280 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:00,280 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:00,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 11:13:00,280 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:13:00,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1316427591, now seen corresponding path program 1 times [2022-12-13 11:13:00,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:00,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168708317] [2022-12-13 11:13:00,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:00,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:00,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:00,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168708317] [2022-12-13 11:13:00,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168708317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:13:00,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:13:00,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:13:00,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952169978] [2022-12-13 11:13:00,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:13:00,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:13:00,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:00,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:13:00,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:13:00,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 11:13:00,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:13:00,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:00,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 11:13:00,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:00,551 INFO L130 PetriNetUnfolder]: 182/363 cut-off events. [2022-12-13 11:13:00,551 INFO L131 PetriNetUnfolder]: For 1714/1714 co-relation queries the response was YES. [2022-12-13 11:13:00,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 363 events. 182/363 cut-off events. For 1714/1714 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1530 event pairs, 96 based on Foata normal form. 4/366 useless extension candidates. Maximal degree in co-relation 1258. Up to 357 conditions per place. [2022-12-13 11:13:00,554 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-13 11:13:00,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 501 flow [2022-12-13 11:13:00,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:13:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:13:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-13 11:13:00,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-13 11:13:00,555 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 392 flow. Second operand 3 states and 33 transitions. [2022-12-13 11:13:00,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 501 flow [2022-12-13 11:13:00,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 477 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-13 11:13:00,560 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 387 flow [2022-12-13 11:13:00,560 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-12-13 11:13:00,560 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-13 11:13:00,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:00,561 INFO L89 Accepts]: Start accepts. Operand has 49 places, 45 transitions, 387 flow [2022-12-13 11:13:00,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:00,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:00,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 45 transitions, 387 flow [2022-12-13 11:13:00,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 387 flow [2022-12-13 11:13:00,582 INFO L130 PetriNetUnfolder]: 27/123 cut-off events. [2022-12-13 11:13:00,583 INFO L131 PetriNetUnfolder]: For 350/381 co-relation queries the response was YES. [2022-12-13 11:13:00,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 123 events. 27/123 cut-off events. For 350/381 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 592 event pairs, 1 based on Foata normal form. 7/123 useless extension candidates. Maximal degree in co-relation 356. Up to 25 conditions per place. [2022-12-13 11:13:00,584 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 387 flow [2022-12-13 11:13:00,585 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 11:13:10,430 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:13:10,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9870 [2022-12-13 11:13:10,431 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 386 flow [2022-12-13 11:13:10,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:13:10,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:10,431 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:10,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 11:13:10,433 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:13:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash 413105409, now seen corresponding path program 1 times [2022-12-13 11:13:10,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:10,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732010826] [2022-12-13 11:13:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:10,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:10,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:10,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732010826] [2022-12-13 11:13:10,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732010826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:13:10,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:13:10,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:13:10,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640722898] [2022-12-13 11:13:10,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:13:10,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:13:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:10,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:13:10,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:13:10,536 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 11:13:10,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 386 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:13:10,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:10,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 11:13:10,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:10,753 INFO L130 PetriNetUnfolder]: 209/404 cut-off events. [2022-12-13 11:13:10,753 INFO L131 PetriNetUnfolder]: For 1650/1650 co-relation queries the response was YES. [2022-12-13 11:13:10,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 404 events. 209/404 cut-off events. For 1650/1650 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1720 event pairs, 69 based on Foata normal form. 12/415 useless extension candidates. Maximal degree in co-relation 1602. Up to 320 conditions per place. [2022-12-13 11:13:10,755 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 47 selfloop transitions, 12 changer transitions 1/60 dead transitions. [2022-12-13 11:13:10,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 590 flow [2022-12-13 11:13:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:13:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:13:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-13 11:13:10,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2022-12-13 11:13:10,756 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 386 flow. Second operand 4 states and 43 transitions. [2022-12-13 11:13:10,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 590 flow [2022-12-13 11:13:10,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 568 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 11:13:10,759 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 448 flow [2022-12-13 11:13:10,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=448, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2022-12-13 11:13:10,759 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 30 predicate places. [2022-12-13 11:13:10,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:10,759 INFO L89 Accepts]: Start accepts. Operand has 51 places, 49 transitions, 448 flow [2022-12-13 11:13:10,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:10,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:10,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 49 transitions, 448 flow [2022-12-13 11:13:10,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 448 flow [2022-12-13 11:13:10,773 INFO L130 PetriNetUnfolder]: 35/138 cut-off events. [2022-12-13 11:13:10,774 INFO L131 PetriNetUnfolder]: For 507/546 co-relation queries the response was YES. [2022-12-13 11:13:10,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 138 events. 35/138 cut-off events. For 507/546 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 668 event pairs, 1 based on Foata normal form. 7/139 useless extension candidates. Maximal degree in co-relation 399. Up to 26 conditions per place. [2022-12-13 11:13:10,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 49 transitions, 448 flow [2022-12-13 11:13:10,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-13 11:13:10,782 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [779] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967296) (mod v_~n~0_91 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 0)) InVars {~n~0=v_~n~0_91} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, ~n~0=v_~n~0_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 11:13:10,998 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [796] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~n~0_131 4294967296))) (and (= (ite (and (<= 0 v_~x1~0_121) (< v_~x1~0_121 v_~size~0_144)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_54|) (= |v_thread1Thread1of1ForFork0_~i~0#1_98| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_72| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_54|) (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_98| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (= v_~x1~0_120 (select (select |v_#memory_int_199| v_~f~0.base_158) (+ v_~f~0.offset_158 (* v_~x1~0_121 4)))) (< 0 .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_72| 0)))) InVars {~size~0=v_~size~0_144, ~f~0.base=v_~f~0.base_158, #memory_int=|v_#memory_int_199|, ~n~0=v_~n~0_131, ~x1~0=v_~x1~0_121, ~f~0.offset=v_~f~0.offset_158} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_62|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, ~size~0=v_~size~0_144, ~f~0.base=v_~f~0.base_158, ~x1~0=v_~x1~0_120, ~f~0.offset=v_~f~0.offset_158, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_54|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_98|, #memory_int=|v_#memory_int_199|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_72|, ~n~0=v_~n~0_131, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_70|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-13 11:13:11,143 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:13:11,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 384 [2022-12-13 11:13:11,143 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 451 flow [2022-12-13 11:13:11,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:13:11,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:11,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:11,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 11:13:11,144 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:13:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:11,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1545460799, now seen corresponding path program 1 times [2022-12-13 11:13:11,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:11,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841483179] [2022-12-13 11:13:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:11,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:11,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:11,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841483179] [2022-12-13 11:13:11,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841483179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:13:11,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:13:11,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:13:11,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996618913] [2022-12-13 11:13:11,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:13:11,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:13:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:11,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:13:11,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:13:11,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:13:11,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:13:11,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:11,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:13:11,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:11,411 INFO L130 PetriNetUnfolder]: 204/387 cut-off events. [2022-12-13 11:13:11,411 INFO L131 PetriNetUnfolder]: For 1955/1955 co-relation queries the response was YES. [2022-12-13 11:13:11,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 387 events. 204/387 cut-off events. For 1955/1955 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1595 event pairs, 94 based on Foata normal form. 4/390 useless extension candidates. Maximal degree in co-relation 1608. Up to 381 conditions per place. [2022-12-13 11:13:11,414 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 49 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2022-12-13 11:13:11,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 568 flow [2022-12-13 11:13:11,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:13:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:13:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 11:13:11,415 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 11:13:11,415 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 451 flow. Second operand 3 states and 35 transitions. [2022-12-13 11:13:11,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 568 flow [2022-12-13 11:13:11,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 552 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 11:13:11,421 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 454 flow [2022-12-13 11:13:11,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2022-12-13 11:13:11,422 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 31 predicate places. [2022-12-13 11:13:11,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:11,422 INFO L89 Accepts]: Start accepts. Operand has 52 places, 49 transitions, 454 flow [2022-12-13 11:13:11,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:11,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:11,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 49 transitions, 454 flow [2022-12-13 11:13:11,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 49 transitions, 454 flow [2022-12-13 11:13:11,441 INFO L130 PetriNetUnfolder]: 35/132 cut-off events. [2022-12-13 11:13:11,441 INFO L131 PetriNetUnfolder]: For 522/560 co-relation queries the response was YES. [2022-12-13 11:13:11,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 132 events. 35/132 cut-off events. For 522/560 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 604 event pairs, 1 based on Foata normal form. 7/132 useless extension candidates. Maximal degree in co-relation 430. Up to 25 conditions per place. [2022-12-13 11:13:11,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 49 transitions, 454 flow [2022-12-13 11:13:11,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-13 11:13:24,243 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:13:24,244 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12822 [2022-12-13 11:13:24,244 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 455 flow [2022-12-13 11:13:24,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:13:24,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:24,244 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:24,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 11:13:24,244 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:13:24,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:24,248 INFO L85 PathProgramCache]: Analyzing trace with hash -411740749, now seen corresponding path program 2 times [2022-12-13 11:13:24,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:24,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916925172] [2022-12-13 11:13:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:24,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:24,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:24,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916925172] [2022-12-13 11:13:24,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916925172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:13:24,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:13:24,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:13:24,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227343541] [2022-12-13 11:13:24,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:13:24,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:13:24,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:24,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:13:24,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:13:24,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:13:24,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 455 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:13:24,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:24,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:13:24,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:24,713 INFO L130 PetriNetUnfolder]: 205/396 cut-off events. [2022-12-13 11:13:24,713 INFO L131 PetriNetUnfolder]: For 2073/2073 co-relation queries the response was YES. [2022-12-13 11:13:24,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 396 events. 205/396 cut-off events. For 2073/2073 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1662 event pairs, 88 based on Foata normal form. 4/399 useless extension candidates. Maximal degree in co-relation 1728. Up to 343 conditions per place. [2022-12-13 11:13:24,716 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 57 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2022-12-13 11:13:24,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 669 flow [2022-12-13 11:13:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:13:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:13:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-13 11:13:24,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 11:13:24,718 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 455 flow. Second operand 4 states and 48 transitions. [2022-12-13 11:13:24,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 669 flow [2022-12-13 11:13:24,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 648 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-13 11:13:24,726 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 470 flow [2022-12-13 11:13:24,726 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=470, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2022-12-13 11:13:24,726 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-13 11:13:24,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:24,727 INFO L89 Accepts]: Start accepts. Operand has 53 places, 49 transitions, 470 flow [2022-12-13 11:13:24,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:24,728 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:24,728 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 49 transitions, 470 flow [2022-12-13 11:13:24,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 49 transitions, 470 flow [2022-12-13 11:13:24,749 INFO L130 PetriNetUnfolder]: 32/131 cut-off events. [2022-12-13 11:13:24,749 INFO L131 PetriNetUnfolder]: For 594/632 co-relation queries the response was YES. [2022-12-13 11:13:24,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 131 events. 32/131 cut-off events. For 594/632 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 619 event pairs, 1 based on Foata normal form. 7/131 useless extension candidates. Maximal degree in co-relation 387. Up to 26 conditions per place. [2022-12-13 11:13:24,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 49 transitions, 470 flow [2022-12-13 11:13:24,750 INFO L226 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-13 11:13:24,751 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:13:24,752 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 11:13:24,752 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 470 flow [2022-12-13 11:13:24,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:13:24,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:24,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:24,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 11:13:24,752 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:13:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1774494007, now seen corresponding path program 1 times [2022-12-13 11:13:24,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:24,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075768176] [2022-12-13 11:13:24,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:24,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:24,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:24,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075768176] [2022-12-13 11:13:24,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075768176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:13:24,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:13:24,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:13:24,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708951555] [2022-12-13 11:13:24,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:13:24,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:13:24,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:24,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:13:24,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:13:24,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:13:24,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:13:24,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:24,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:13:24,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:25,031 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:13:25,031 INFO L131 PetriNetUnfolder]: For 2281/2281 co-relation queries the response was YES. [2022-12-13 11:13:25,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 403 events. 208/403 cut-off events. For 2281/2281 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1700 event pairs, 104 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1550. Up to 397 conditions per place. [2022-12-13 11:13:25,034 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-13 11:13:25,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 589 flow [2022-12-13 11:13:25,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:13:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:13:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 11:13:25,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 11:13:25,035 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 470 flow. Second operand 3 states and 35 transitions. [2022-12-13 11:13:25,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 589 flow [2022-12-13 11:13:25,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 574 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 11:13:25,042 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 474 flow [2022-12-13 11:13:25,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-13 11:13:25,042 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 11:13:25,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:25,042 INFO L89 Accepts]: Start accepts. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:13:25,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:25,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:25,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:13:25,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:13:25,063 INFO L130 PetriNetUnfolder]: 32/132 cut-off events. [2022-12-13 11:13:25,063 INFO L131 PetriNetUnfolder]: For 590/628 co-relation queries the response was YES. [2022-12-13 11:13:25,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 132 events. 32/132 cut-off events. For 590/628 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 620 event pairs, 1 based on Foata normal form. 7/131 useless extension candidates. Maximal degree in co-relation 429. Up to 26 conditions per place. [2022-12-13 11:13:25,064 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:13:25,064 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:13:31,310 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 343 DAG size of output: 338 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:13:45,386 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:13:45,391 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20349 [2022-12-13 11:13:45,391 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 475 flow [2022-12-13 11:13:45,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:13:45,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:45,392 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:45,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 11:13:45,392 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:13:45,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash -166601537, now seen corresponding path program 1 times [2022-12-13 11:13:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:45,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384264102] [2022-12-13 11:13:45,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:45,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:45,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:45,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384264102] [2022-12-13 11:13:45,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384264102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:13:45,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:13:45,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:13:45,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225833977] [2022-12-13 11:13:45,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:13:45,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:13:45,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:45,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:13:45,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:13:45,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:13:45,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:13:45,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:45,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:13:45,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:45,751 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:13:45,751 INFO L131 PetriNetUnfolder]: For 2293/2293 co-relation queries the response was YES. [2022-12-13 11:13:45,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 403 events. 208/403 cut-off events. For 2293/2293 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1708 event pairs, 93 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1744. Up to 342 conditions per place. [2022-12-13 11:13:45,754 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 11:13:45,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 651 flow [2022-12-13 11:13:45,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:13:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:13:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 11:13:45,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 11:13:45,754 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 475 flow. Second operand 4 states and 44 transitions. [2022-12-13 11:13:45,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 651 flow [2022-12-13 11:13:45,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 625 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 11:13:45,758 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 482 flow [2022-12-13 11:13:45,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2022-12-13 11:13:45,759 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-13 11:13:45,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:45,759 INFO L89 Accepts]: Start accepts. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:13:45,759 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:45,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:45,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:13:45,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:13:45,773 INFO L130 PetriNetUnfolder]: 32/134 cut-off events. [2022-12-13 11:13:45,773 INFO L131 PetriNetUnfolder]: For 619/657 co-relation queries the response was YES. [2022-12-13 11:13:45,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 134 events. 32/134 cut-off events. For 619/657 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 638 event pairs, 1 based on Foata normal form. 7/134 useless extension candidates. Maximal degree in co-relation 398. Up to 26 conditions per place. [2022-12-13 11:13:45,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:13:45,774 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:13:47,766 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:13:47,766 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2007 [2022-12-13 11:13:47,766 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 483 flow [2022-12-13 11:13:47,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:13:47,767 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:13:47,767 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:47,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 11:13:47,767 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:13:47,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:47,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1889010611, now seen corresponding path program 1 times [2022-12-13 11:13:47,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:47,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312349916] [2022-12-13 11:13:47,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:47,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:47,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:47,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312349916] [2022-12-13 11:13:47,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312349916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:13:47,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:13:47,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:13:47,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176579351] [2022-12-13 11:13:47,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:13:47,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:13:47,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:47,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:13:47,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:13:47,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:13:47,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:13:47,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:13:47,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:13:47,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:13:47,996 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:13:47,997 INFO L131 PetriNetUnfolder]: For 2494/2494 co-relation queries the response was YES. [2022-12-13 11:13:47,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 403 events. 208/403 cut-off events. For 2494/2494 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1692 event pairs, 104 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1602. Up to 397 conditions per place. [2022-12-13 11:13:47,999 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-13 11:13:47,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 604 flow [2022-12-13 11:13:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:13:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:13:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 11:13:48,000 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 11:13:48,000 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 483 flow. Second operand 3 states and 35 transitions. [2022-12-13 11:13:48,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 604 flow [2022-12-13 11:13:48,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 574 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 11:13:48,004 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 474 flow [2022-12-13 11:13:48,004 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-13 11:13:48,005 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 11:13:48,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:13:48,005 INFO L89 Accepts]: Start accepts. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:13:48,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:13:48,006 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:13:48,006 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:13:48,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:13:48,019 INFO L130 PetriNetUnfolder]: 32/132 cut-off events. [2022-12-13 11:13:48,019 INFO L131 PetriNetUnfolder]: For 590/628 co-relation queries the response was YES. [2022-12-13 11:13:48,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 132 events. 32/132 cut-off events. For 590/628 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 621 event pairs, 1 based on Foata normal form. 7/131 useless extension candidates. Maximal degree in co-relation 429. Up to 26 conditions per place. [2022-12-13 11:13:48,020 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:13:48,020 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:14:00,926 WARN L233 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 481 DAG size of output: 476 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:14:13,392 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 481 DAG size of output: 476 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:14:15,294 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:14:15,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27289 [2022-12-13 11:14:15,294 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 475 flow [2022-12-13 11:14:15,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:14:15,295 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:15,295 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:15,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 11:14:15,295 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:14:15,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1972793019, now seen corresponding path program 1 times [2022-12-13 11:14:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:15,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356976078] [2022-12-13 11:14:15,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:15,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:15,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356976078] [2022-12-13 11:14:15,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356976078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:14:15,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:14:15,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:14:15,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712711453] [2022-12-13 11:14:15,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:14:15,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:14:15,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:15,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:14:15,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:14:15,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:14:15,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:14:15,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:15,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:14:15,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:15,601 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:14:15,601 INFO L131 PetriNetUnfolder]: For 2293/2293 co-relation queries the response was YES. [2022-12-13 11:14:15,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 403 events. 208/403 cut-off events. For 2293/2293 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1708 event pairs, 93 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1744. Up to 342 conditions per place. [2022-12-13 11:14:15,604 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 11:14:15,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 651 flow [2022-12-13 11:14:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:14:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:14:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 11:14:15,606 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 11:14:15,606 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 475 flow. Second operand 4 states and 44 transitions. [2022-12-13 11:14:15,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 651 flow [2022-12-13 11:14:15,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 625 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 11:14:15,611 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 482 flow [2022-12-13 11:14:15,611 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2022-12-13 11:14:15,614 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-13 11:14:15,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:15,614 INFO L89 Accepts]: Start accepts. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:14:15,615 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:15,615 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:15,615 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:14:15,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:14:15,633 INFO L130 PetriNetUnfolder]: 32/134 cut-off events. [2022-12-13 11:14:15,633 INFO L131 PetriNetUnfolder]: For 619/657 co-relation queries the response was YES. [2022-12-13 11:14:15,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 134 events. 32/134 cut-off events. For 619/657 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 640 event pairs, 1 based on Foata normal form. 7/134 useless extension candidates. Maximal degree in co-relation 398. Up to 26 conditions per place. [2022-12-13 11:14:15,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:14:15,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:14:18,576 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:14:18,577 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2963 [2022-12-13 11:14:18,577 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 483 flow [2022-12-13 11:14:18,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:14:18,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:18,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:18,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 11:14:18,577 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:14:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2118043819, now seen corresponding path program 1 times [2022-12-13 11:14:18,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:18,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408721236] [2022-12-13 11:14:18,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:18,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:18,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:18,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408721236] [2022-12-13 11:14:18,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408721236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:14:18,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:14:18,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:14:18,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600198398] [2022-12-13 11:14:18,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:14:18,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:14:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:18,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:14:18,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:14:18,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:14:18,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:14:18,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:18,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:14:18,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:18,776 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:14:18,776 INFO L131 PetriNetUnfolder]: For 2494/2494 co-relation queries the response was YES. [2022-12-13 11:14:18,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 403 events. 208/403 cut-off events. For 2494/2494 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1697 event pairs, 104 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1602. Up to 397 conditions per place. [2022-12-13 11:14:18,778 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-13 11:14:18,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 604 flow [2022-12-13 11:14:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:14:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:14:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 11:14:18,779 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 11:14:18,779 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 483 flow. Second operand 3 states and 35 transitions. [2022-12-13 11:14:18,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 604 flow [2022-12-13 11:14:18,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 574 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 11:14:18,783 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 474 flow [2022-12-13 11:14:18,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-13 11:14:18,785 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 11:14:18,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:18,785 INFO L89 Accepts]: Start accepts. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:14:18,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:18,785 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:18,785 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:14:18,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:14:18,799 INFO L130 PetriNetUnfolder]: 32/132 cut-off events. [2022-12-13 11:14:18,799 INFO L131 PetriNetUnfolder]: For 586/624 co-relation queries the response was YES. [2022-12-13 11:14:18,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 132 events. 32/132 cut-off events. For 586/624 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 624 event pairs, 1 based on Foata normal form. 7/131 useless extension candidates. Maximal degree in co-relation 429. Up to 26 conditions per place. [2022-12-13 11:14:18,799 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:14:18,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:14:44,936 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 517 DAG size of output: 512 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:14:47,324 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:14:47,328 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28543 [2022-12-13 11:14:47,328 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 475 flow [2022-12-13 11:14:47,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:14:47,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:47,328 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:47,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 11:14:47,328 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:14:47,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash 577756389, now seen corresponding path program 1 times [2022-12-13 11:14:47,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:47,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921706683] [2022-12-13 11:14:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:47,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:47,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:47,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921706683] [2022-12-13 11:14:47,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921706683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:14:47,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:14:47,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:14:47,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789978640] [2022-12-13 11:14:47,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:14:47,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:14:47,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:47,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:14:47,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:14:47,546 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:14:47,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:14:47,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:47,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:14:47,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:47,716 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:14:47,716 INFO L131 PetriNetUnfolder]: For 2293/2293 co-relation queries the response was YES. [2022-12-13 11:14:47,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 403 events. 208/403 cut-off events. For 2293/2293 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1708 event pairs, 93 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1744. Up to 342 conditions per place. [2022-12-13 11:14:47,718 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 11:14:47,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 651 flow [2022-12-13 11:14:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:14:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:14:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 11:14:47,719 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 11:14:47,719 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 475 flow. Second operand 4 states and 44 transitions. [2022-12-13 11:14:47,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 651 flow [2022-12-13 11:14:47,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 625 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 11:14:47,723 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 482 flow [2022-12-13 11:14:47,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2022-12-13 11:14:47,724 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-13 11:14:47,724 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:47,724 INFO L89 Accepts]: Start accepts. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:14:47,725 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:47,725 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:47,725 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:14:47,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:14:47,756 INFO L130 PetriNetUnfolder]: 32/134 cut-off events. [2022-12-13 11:14:47,756 INFO L131 PetriNetUnfolder]: For 623/661 co-relation queries the response was YES. [2022-12-13 11:14:47,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 134 events. 32/134 cut-off events. For 623/661 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 645 event pairs, 1 based on Foata normal form. 7/134 useless extension candidates. Maximal degree in co-relation 398. Up to 26 conditions per place. [2022-12-13 11:14:47,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:14:47,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:14:52,107 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:14:52,109 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4385 [2022-12-13 11:14:52,109 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 483 flow [2022-12-13 11:14:52,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:14:52,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:14:52,110 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:52,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 11:14:52,110 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:14:52,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:52,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1947890269, now seen corresponding path program 1 times [2022-12-13 11:14:52,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:52,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071475658] [2022-12-13 11:14:52,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:52,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:52,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071475658] [2022-12-13 11:14:52,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071475658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:14:52,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:14:52,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:14:52,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021300321] [2022-12-13 11:14:52,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:14:52,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:14:52,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:52,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:14:52,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:14:52,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:14:52,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:14:52,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:14:52,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:14:52,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:14:52,413 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:14:52,413 INFO L131 PetriNetUnfolder]: For 2494/2494 co-relation queries the response was YES. [2022-12-13 11:14:52,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 403 events. 208/403 cut-off events. For 2494/2494 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1690 event pairs, 104 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1602. Up to 397 conditions per place. [2022-12-13 11:14:52,417 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-13 11:14:52,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 604 flow [2022-12-13 11:14:52,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:14:52,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:14:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 11:14:52,418 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 11:14:52,418 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 483 flow. Second operand 3 states and 35 transitions. [2022-12-13 11:14:52,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 604 flow [2022-12-13 11:14:52,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 574 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 11:14:52,423 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 474 flow [2022-12-13 11:14:52,424 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-13 11:14:52,424 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 11:14:52,424 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:14:52,424 INFO L89 Accepts]: Start accepts. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:14:52,425 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:14:52,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:14:52,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:14:52,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:14:52,441 INFO L130 PetriNetUnfolder]: 32/132 cut-off events. [2022-12-13 11:14:52,442 INFO L131 PetriNetUnfolder]: For 590/628 co-relation queries the response was YES. [2022-12-13 11:14:52,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 132 events. 32/132 cut-off events. For 590/628 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 615 event pairs, 1 based on Foata normal form. 7/131 useless extension candidates. Maximal degree in co-relation 429. Up to 26 conditions per place. [2022-12-13 11:14:52,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:14:52,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:15:15,041 WARN L233 SmtUtils]: Spent 15.06s on a formula simplification. DAG size of input: 553 DAG size of output: 548 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:15:25,313 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 424 DAG size of output: 419 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:15:30,910 WARN L233 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 409 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:15:44,466 WARN L233 SmtUtils]: Spent 13.55s on a formula simplification. DAG size of input: 553 DAG size of output: 548 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:15:48,767 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:15:48,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56345 [2022-12-13 11:15:48,769 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 475 flow [2022-12-13 11:15:48,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:15:48,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:15:48,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:15:48,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 11:15:48,770 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:15:48,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:15:48,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1864107861, now seen corresponding path program 1 times [2022-12-13 11:15:48,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:15:48,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654268505] [2022-12-13 11:15:48,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:15:48,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:15:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:15:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:15:48,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:15:48,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654268505] [2022-12-13 11:15:48,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654268505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:15:48,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:15:48,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:15:48,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826017965] [2022-12-13 11:15:48,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:15:48,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:15:48,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:15:48,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:15:48,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:15:48,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:15:48,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:15:48,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:15:48,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:15:48,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:15:49,178 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:15:49,178 INFO L131 PetriNetUnfolder]: For 2293/2293 co-relation queries the response was YES. [2022-12-13 11:15:49,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 403 events. 208/403 cut-off events. For 2293/2293 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1708 event pairs, 93 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1744. Up to 342 conditions per place. [2022-12-13 11:15:49,182 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 11:15:49,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 651 flow [2022-12-13 11:15:49,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:15:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:15:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 11:15:49,184 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 11:15:49,185 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 475 flow. Second operand 4 states and 44 transitions. [2022-12-13 11:15:49,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 651 flow [2022-12-13 11:15:49,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 625 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 11:15:49,191 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 482 flow [2022-12-13 11:15:49,191 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2022-12-13 11:15:49,192 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-13 11:15:49,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:15:49,192 INFO L89 Accepts]: Start accepts. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:15:49,195 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:15:49,195 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:15:49,195 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:15:49,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:15:49,217 INFO L130 PetriNetUnfolder]: 32/134 cut-off events. [2022-12-13 11:15:49,217 INFO L131 PetriNetUnfolder]: For 619/657 co-relation queries the response was YES. [2022-12-13 11:15:49,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 134 events. 32/134 cut-off events. For 619/657 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 640 event pairs, 1 based on Foata normal form. 7/134 useless extension candidates. Maximal degree in co-relation 398. Up to 26 conditions per place. [2022-12-13 11:15:49,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:15:49,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:15:56,179 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:15:56,180 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6988 [2022-12-13 11:15:56,180 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 483 flow [2022-12-13 11:15:56,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:15:56,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:15:56,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:15:56,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 11:15:56,180 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:15:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:15:56,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1718857061, now seen corresponding path program 1 times [2022-12-13 11:15:56,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:15:56,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78869157] [2022-12-13 11:15:56,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:15:56,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:15:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:15:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:15:56,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:15:56,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78869157] [2022-12-13 11:15:56,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78869157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:15:56,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:15:56,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:15:56,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952124492] [2022-12-13 11:15:56,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:15:56,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:15:56,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:15:56,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:15:56,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:15:56,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:15:56,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:15:56,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:15:56,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:15:56,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:15:56,448 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:15:56,448 INFO L131 PetriNetUnfolder]: For 2494/2494 co-relation queries the response was YES. [2022-12-13 11:15:56,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 403 events. 208/403 cut-off events. For 2494/2494 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1692 event pairs, 104 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1602. Up to 397 conditions per place. [2022-12-13 11:15:56,452 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-13 11:15:56,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 604 flow [2022-12-13 11:15:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:15:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:15:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 11:15:56,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 11:15:56,453 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 483 flow. Second operand 3 states and 35 transitions. [2022-12-13 11:15:56,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 604 flow [2022-12-13 11:15:56,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 574 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 11:15:56,458 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 474 flow [2022-12-13 11:15:56,459 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-13 11:15:56,459 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 11:15:56,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:15:56,459 INFO L89 Accepts]: Start accepts. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:15:56,459 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:15:56,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:15:56,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:15:56,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:15:56,480 INFO L130 PetriNetUnfolder]: 32/132 cut-off events. [2022-12-13 11:15:56,481 INFO L131 PetriNetUnfolder]: For 588/626 co-relation queries the response was YES. [2022-12-13 11:15:56,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 132 events. 32/132 cut-off events. For 588/626 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 618 event pairs, 1 based on Foata normal form. 7/131 useless extension candidates. Maximal degree in co-relation 429. Up to 26 conditions per place. [2022-12-13 11:15:56,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:15:56,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:16:06,423 WARN L233 SmtUtils]: Spent 9.93s on a formula simplification. DAG size of input: 451 DAG size of output: 446 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:16:12,240 WARN L233 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 436 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:16:23,617 WARN L233 SmtUtils]: Spent 11.37s on a formula simplification. DAG size of input: 589 DAG size of output: 584 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:16:33,416 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification. DAG size of input: 451 DAG size of output: 446 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:16:51,988 WARN L233 SmtUtils]: Spent 17.83s on a formula simplification. DAG size of input: 589 DAG size of output: 584 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:17:00,227 WARN L233 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 574 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:17:00,229 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:17:00,230 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63771 [2022-12-13 11:17:00,230 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 475 flow [2022-12-13 11:17:00,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:17:00,230 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:17:00,230 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:17:00,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 11:17:00,230 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:17:00,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:17:00,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1635074653, now seen corresponding path program 1 times [2022-12-13 11:17:00,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:17:00,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101570511] [2022-12-13 11:17:00,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:17:00,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:17:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:17:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:17:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:17:00,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101570511] [2022-12-13 11:17:00,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101570511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:17:00,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:17:00,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:17:00,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947163705] [2022-12-13 11:17:00,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:17:00,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:17:00,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:17:00,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:17:00,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:17:00,351 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:17:00,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:17:00,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:17:00,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:17:00,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:17:00,591 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:17:00,591 INFO L131 PetriNetUnfolder]: For 2293/2293 co-relation queries the response was YES. [2022-12-13 11:17:00,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 403 events. 208/403 cut-off events. For 2293/2293 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1708 event pairs, 93 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1744. Up to 342 conditions per place. [2022-12-13 11:17:00,601 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 11:17:00,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 651 flow [2022-12-13 11:17:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:17:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:17:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 11:17:00,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 11:17:00,602 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 475 flow. Second operand 4 states and 44 transitions. [2022-12-13 11:17:00,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 651 flow [2022-12-13 11:17:00,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 625 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 11:17:00,608 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 482 flow [2022-12-13 11:17:00,608 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2022-12-13 11:17:00,608 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-13 11:17:00,608 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:17:00,608 INFO L89 Accepts]: Start accepts. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:17:00,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:17:00,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:17:00,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:17:00,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:17:00,623 INFO L130 PetriNetUnfolder]: 32/134 cut-off events. [2022-12-13 11:17:00,624 INFO L131 PetriNetUnfolder]: For 619/657 co-relation queries the response was YES. [2022-12-13 11:17:00,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 134 events. 32/134 cut-off events. For 619/657 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 641 event pairs, 1 based on Foata normal form. 7/134 useless extension candidates. Maximal degree in co-relation 398. Up to 26 conditions per place. [2022-12-13 11:17:00,624 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:17:00,625 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:17:09,979 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:17:09,980 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9372 [2022-12-13 11:17:09,980 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 483 flow [2022-12-13 11:17:09,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:17:09,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:17:09,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:17:09,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 11:17:09,980 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:17:09,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:17:09,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1489823853, now seen corresponding path program 1 times [2022-12-13 11:17:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:17:09,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569765577] [2022-12-13 11:17:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:17:09,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:17:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:17:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:17:10,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:17:10,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569765577] [2022-12-13 11:17:10,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569765577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:17:10,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:17:10,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:17:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128932163] [2022-12-13 11:17:10,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:17:10,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:17:10,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:17:10,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:17:10,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:17:10,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:17:10,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:17:10,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:17:10,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:17:10,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:17:10,273 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:17:10,273 INFO L131 PetriNetUnfolder]: For 2494/2494 co-relation queries the response was YES. [2022-12-13 11:17:10,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 403 events. 208/403 cut-off events. For 2494/2494 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1693 event pairs, 104 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1602. Up to 397 conditions per place. [2022-12-13 11:17:10,275 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-13 11:17:10,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 604 flow [2022-12-13 11:17:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:17:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:17:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 11:17:10,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 11:17:10,276 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 483 flow. Second operand 3 states and 35 transitions. [2022-12-13 11:17:10,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 604 flow [2022-12-13 11:17:10,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 574 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 11:17:10,281 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 474 flow [2022-12-13 11:17:10,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-13 11:17:10,281 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 11:17:10,281 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:17:10,281 INFO L89 Accepts]: Start accepts. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:17:10,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:17:10,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:17:10,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:17:10,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:17:10,298 INFO L130 PetriNetUnfolder]: 32/132 cut-off events. [2022-12-13 11:17:10,299 INFO L131 PetriNetUnfolder]: For 588/626 co-relation queries the response was YES. [2022-12-13 11:17:10,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 132 events. 32/132 cut-off events. For 588/626 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 633 event pairs, 1 based on Foata normal form. 7/131 useless extension candidates. Maximal degree in co-relation 429. Up to 26 conditions per place. [2022-12-13 11:17:10,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:17:10,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:17:24,137 WARN L233 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 463 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:17:34,783 WARN L233 SmtUtils]: Spent 10.64s on a formula simplification. DAG size of input: 625 DAG size of output: 620 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:18:01,055 WARN L233 SmtUtils]: Spent 22.23s on a formula simplification. DAG size of input: 478 DAG size of output: 473 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:18:09,211 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 463 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:18:20,556 WARN L233 SmtUtils]: Spent 11.34s on a formula simplification. DAG size of input: 625 DAG size of output: 620 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:18:27,122 WARN L233 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 610 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:18:27,125 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:18:27,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76844 [2022-12-13 11:18:27,126 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 475 flow [2022-12-13 11:18:27,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:18:27,126 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:18:27,126 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:18:27,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 11:18:27,126 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:18:27,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:18:27,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1264856013, now seen corresponding path program 1 times [2022-12-13 11:18:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:18:27,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148252878] [2022-12-13 11:18:27,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:18:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:18:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:18:27,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:18:27,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148252878] [2022-12-13 11:18:27,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148252878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:18:27,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:18:27,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:18:27,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268613183] [2022-12-13 11:18:27,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:18:27,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:18:27,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:18:27,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:18:27,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:18:27,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:18:27,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:18:27,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:18:27,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:18:27,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:18:27,399 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:18:27,399 INFO L131 PetriNetUnfolder]: For 2293/2293 co-relation queries the response was YES. [2022-12-13 11:18:27,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 403 events. 208/403 cut-off events. For 2293/2293 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1708 event pairs, 93 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1744. Up to 342 conditions per place. [2022-12-13 11:18:27,401 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 11:18:27,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 651 flow [2022-12-13 11:18:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:18:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:18:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 11:18:27,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 11:18:27,402 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 475 flow. Second operand 4 states and 44 transitions. [2022-12-13 11:18:27,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 651 flow [2022-12-13 11:18:27,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 625 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 11:18:27,406 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 482 flow [2022-12-13 11:18:27,406 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2022-12-13 11:18:27,406 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-13 11:18:27,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:18:27,406 INFO L89 Accepts]: Start accepts. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:18:27,407 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:18:27,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:18:27,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:18:27,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:18:27,421 INFO L130 PetriNetUnfolder]: 32/134 cut-off events. [2022-12-13 11:18:27,421 INFO L131 PetriNetUnfolder]: For 619/657 co-relation queries the response was YES. [2022-12-13 11:18:27,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 134 events. 32/134 cut-off events. For 619/657 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 639 event pairs, 1 based on Foata normal form. 7/134 useless extension candidates. Maximal degree in co-relation 398. Up to 26 conditions per place. [2022-12-13 11:18:27,422 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:18:27,422 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:18:44,810 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:18:44,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17405 [2022-12-13 11:18:44,811 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 483 flow [2022-12-13 11:18:44,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:18:44,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:18:44,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:18:44,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 11:18:44,811 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:18:44,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:18:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1260790645, now seen corresponding path program 1 times [2022-12-13 11:18:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:18:44,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914000903] [2022-12-13 11:18:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:18:44,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:18:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:18:44,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:18:44,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914000903] [2022-12-13 11:18:44,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914000903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:18:44,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:18:44,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:18:44,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964432023] [2022-12-13 11:18:44,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:18:44,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:18:44,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:18:44,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:18:44,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:18:44,918 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:18:44,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:18:44,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:18:44,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:18:44,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:18:45,128 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:18:45,128 INFO L131 PetriNetUnfolder]: For 2494/2494 co-relation queries the response was YES. [2022-12-13 11:18:45,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 403 events. 208/403 cut-off events. For 2494/2494 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1697 event pairs, 104 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1602. Up to 397 conditions per place. [2022-12-13 11:18:45,130 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-13 11:18:45,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 604 flow [2022-12-13 11:18:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:18:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:18:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 11:18:45,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 11:18:45,130 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 483 flow. Second operand 3 states and 35 transitions. [2022-12-13 11:18:45,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 604 flow [2022-12-13 11:18:45,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 574 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 11:18:45,135 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 474 flow [2022-12-13 11:18:45,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-13 11:18:45,136 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 11:18:45,136 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:18:45,136 INFO L89 Accepts]: Start accepts. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:18:45,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:18:45,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:18:45,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:18:45,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:18:45,150 INFO L130 PetriNetUnfolder]: 32/132 cut-off events. [2022-12-13 11:18:45,150 INFO L131 PetriNetUnfolder]: For 586/624 co-relation queries the response was YES. [2022-12-13 11:18:45,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 132 events. 32/132 cut-off events. For 586/624 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 627 event pairs, 1 based on Foata normal form. 7/131 useless extension candidates. Maximal degree in co-relation 429. Up to 26 conditions per place. [2022-12-13 11:18:45,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:18:45,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:19:05,985 WARN L233 SmtUtils]: Spent 20.83s on a formula simplification. DAG size of input: 505 DAG size of output: 500 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:19:12,276 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 490 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:19:42,377 WARN L233 SmtUtils]: Spent 30.10s on a formula simplification. DAG size of input: 661 DAG size of output: 656 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:19:48,969 WARN L233 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 646 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:20:04,708 WARN L233 SmtUtils]: Spent 15.73s on a formula simplification. DAG size of input: 505 DAG size of output: 500 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:20:16,030 WARN L233 SmtUtils]: Spent 11.31s on a formula simplification that was a NOOP. DAG size: 490 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:20:27,855 WARN L233 SmtUtils]: Spent 11.82s on a formula simplification. DAG size of input: 661 DAG size of output: 656 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:20:36,081 WARN L233 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 646 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:20:36,084 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:20:36,085 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110949 [2022-12-13 11:20:36,085 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 475 flow [2022-12-13 11:20:36,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:20:36,085 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:20:36,086 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:20:36,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 11:20:36,086 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:20:36,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:20:36,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1493889221, now seen corresponding path program 1 times [2022-12-13 11:20:36,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:20:36,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274229190] [2022-12-13 11:20:36,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:20:36,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:20:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:20:36,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:20:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:20:36,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274229190] [2022-12-13 11:20:36,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274229190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:20:36,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:20:36,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:20:36,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815822597] [2022-12-13 11:20:36,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:20:36,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:20:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:20:36,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:20:36,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:20:36,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:20:36,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:20:36,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:20:36,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:20:36,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:20:36,467 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:20:36,467 INFO L131 PetriNetUnfolder]: For 2293/2293 co-relation queries the response was YES. [2022-12-13 11:20:36,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 403 events. 208/403 cut-off events. For 2293/2293 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1710 event pairs, 93 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1744. Up to 342 conditions per place. [2022-12-13 11:20:36,469 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 11:20:36,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 651 flow [2022-12-13 11:20:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:20:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:20:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 11:20:36,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 11:20:36,469 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 475 flow. Second operand 4 states and 44 transitions. [2022-12-13 11:20:36,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 651 flow [2022-12-13 11:20:36,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 625 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 11:20:36,473 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 482 flow [2022-12-13 11:20:36,473 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2022-12-13 11:20:36,474 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-13 11:20:36,474 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:20:36,474 INFO L89 Accepts]: Start accepts. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:20:36,474 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:20:36,474 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:20:36,474 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:20:36,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:20:36,489 INFO L130 PetriNetUnfolder]: 32/134 cut-off events. [2022-12-13 11:20:36,489 INFO L131 PetriNetUnfolder]: For 623/661 co-relation queries the response was YES. [2022-12-13 11:20:36,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 134 events. 32/134 cut-off events. For 623/661 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 638 event pairs, 1 based on Foata normal form. 7/134 useless extension candidates. Maximal degree in co-relation 398. Up to 26 conditions per place. [2022-12-13 11:20:36,490 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:20:36,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:21:00,142 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:21:00,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23669 [2022-12-13 11:21:00,143 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 483 flow [2022-12-13 11:21:00,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:21:00,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:21:00,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:00,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 11:21:00,143 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:21:00,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:00,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1031757437, now seen corresponding path program 1 times [2022-12-13 11:21:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:00,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358360856] [2022-12-13 11:21:00,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:21:00,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:00,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358360856] [2022-12-13 11:21:00,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358360856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:00,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:00,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:21:00,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380550065] [2022-12-13 11:21:00,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:00,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:21:00,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:21:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:21:00,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:21:00,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:21:00,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:21:00,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:21:00,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:21:00,393 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:21:00,393 INFO L131 PetriNetUnfolder]: For 2494/2494 co-relation queries the response was YES. [2022-12-13 11:21:00,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 403 events. 208/403 cut-off events. For 2494/2494 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1696 event pairs, 104 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1602. Up to 397 conditions per place. [2022-12-13 11:21:00,394 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-13 11:21:00,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 604 flow [2022-12-13 11:21:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:21:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:21:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 11:21:00,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 11:21:00,395 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 483 flow. Second operand 3 states and 35 transitions. [2022-12-13 11:21:00,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 604 flow [2022-12-13 11:21:00,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 574 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 11:21:00,399 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 474 flow [2022-12-13 11:21:00,399 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-13 11:21:00,399 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 11:21:00,399 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:21:00,400 INFO L89 Accepts]: Start accepts. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:21:00,400 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:21:00,400 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:21:00,400 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:21:00,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:21:00,414 INFO L130 PetriNetUnfolder]: 32/132 cut-off events. [2022-12-13 11:21:00,414 INFO L131 PetriNetUnfolder]: For 590/628 co-relation queries the response was YES. [2022-12-13 11:21:00,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 132 events. 32/132 cut-off events. For 590/628 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 625 event pairs, 1 based on Foata normal form. 7/131 useless extension candidates. Maximal degree in co-relation 429. Up to 26 conditions per place. [2022-12-13 11:21:00,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:21:00,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:21:18,218 WARN L233 SmtUtils]: Spent 17.79s on a formula simplification. DAG size of input: 532 DAG size of output: 527 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:21:35,173 WARN L233 SmtUtils]: Spent 16.95s on a formula simplification that was a NOOP. DAG size: 517 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:21:56,241 WARN L233 SmtUtils]: Spent 21.06s on a formula simplification. DAG size of input: 697 DAG size of output: 692 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:22:07,626 WARN L233 SmtUtils]: Spent 11.38s on a formula simplification that was a NOOP. DAG size: 682 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:22:18,116 WARN L233 SmtUtils]: Spent 10.47s on a formula simplification. DAG size of input: 532 DAG size of output: 527 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:23:00,751 WARN L233 SmtUtils]: Spent 38.41s on a formula simplification. DAG size of input: 697 DAG size of output: 692 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:23:06,820 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 682 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:23:06,823 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:23:06,824 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126425 [2022-12-13 11:23:06,824 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 475 flow [2022-12-13 11:23:06,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:23:06,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:23:06,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:23:06,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 11:23:06,824 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:23:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:23:06,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1722922429, now seen corresponding path program 1 times [2022-12-13 11:23:06,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:23:06,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604706848] [2022-12-13 11:23:06,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:23:06,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:23:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:23:06,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:23:06,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604706848] [2022-12-13 11:23:06,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604706848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:23:06,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:23:06,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:23:06,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685708361] [2022-12-13 11:23:06,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:23:06,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:23:06,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:23:06,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:23:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:23:06,997 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:23:06,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:23:06,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:23:06,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:23:06,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:23:07,188 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:23:07,188 INFO L131 PetriNetUnfolder]: For 2293/2293 co-relation queries the response was YES. [2022-12-13 11:23:07,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1868 conditions, 403 events. 208/403 cut-off events. For 2293/2293 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1713 event pairs, 93 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1744. Up to 342 conditions per place. [2022-12-13 11:23:07,190 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 11:23:07,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 651 flow [2022-12-13 11:23:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:23:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:23:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 11:23:07,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 11:23:07,192 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 475 flow. Second operand 4 states and 44 transitions. [2022-12-13 11:23:07,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 651 flow [2022-12-13 11:23:07,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 625 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 11:23:07,197 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 482 flow [2022-12-13 11:23:07,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2022-12-13 11:23:07,197 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-13 11:23:07,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:23:07,197 INFO L89 Accepts]: Start accepts. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:23:07,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:23:07,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:23:07,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:23:07,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 482 flow [2022-12-13 11:23:07,213 INFO L130 PetriNetUnfolder]: 32/134 cut-off events. [2022-12-13 11:23:07,213 INFO L131 PetriNetUnfolder]: For 619/657 co-relation queries the response was YES. [2022-12-13 11:23:07,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 134 events. 32/134 cut-off events. For 619/657 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 640 event pairs, 1 based on Foata normal form. 7/134 useless extension candidates. Maximal degree in co-relation 398. Up to 26 conditions per place. [2022-12-13 11:23:07,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 482 flow [2022-12-13 11:23:07,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:23:22,184 WARN L233 SmtUtils]: Spent 9.45s on a formula simplification. DAG size of input: 472 DAG size of output: 468 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:23:31,694 WARN L233 SmtUtils]: Spent 9.51s on a formula simplification that was a NOOP. DAG size: 460 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:23:44,106 WARN L233 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 470 DAG size of output: 468 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:23:45,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:23:45,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38761 [2022-12-13 11:23:45,958 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 483 flow [2022-12-13 11:23:45,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12-13 11:23:45,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:23:45,959 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:23:45,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 11:23:45,959 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 11:23:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:23:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash -802724229, now seen corresponding path program 1 times [2022-12-13 11:23:45,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:23:45,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166061429] [2022-12-13 11:23:45,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:23:45,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:23:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:23:46,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:23:46,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166061429] [2022-12-13 11:23:46,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166061429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:23:46,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:23:46,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:23:46,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463922382] [2022-12-13 11:23:46,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:23:46,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:23:46,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:23:46,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:23:46,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:23:46,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 11:23:46,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-12-13 11:23:46,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:23:46,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 11:23:46,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:23:46,267 INFO L130 PetriNetUnfolder]: 208/403 cut-off events. [2022-12-13 11:23:46,267 INFO L131 PetriNetUnfolder]: For 2494/2494 co-relation queries the response was YES. [2022-12-13 11:23:46,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 403 events. 208/403 cut-off events. For 2494/2494 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1694 event pairs, 104 based on Foata normal form. 4/406 useless extension candidates. Maximal degree in co-relation 1602. Up to 397 conditions per place. [2022-12-13 11:23:46,268 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-13 11:23:46,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 604 flow [2022-12-13 11:23:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:23:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:23:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 11:23:46,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 11:23:46,269 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 483 flow. Second operand 3 states and 35 transitions. [2022-12-13 11:23:46,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 604 flow [2022-12-13 11:23:46,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 574 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 11:23:46,273 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 474 flow [2022-12-13 11:23:46,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-13 11:23:46,273 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-13 11:23:46,274 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:23:46,274 INFO L89 Accepts]: Start accepts. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:23:46,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:23:46,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:23:46,274 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:23:46,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 474 flow [2022-12-13 11:23:46,288 INFO L130 PetriNetUnfolder]: 32/132 cut-off events. [2022-12-13 11:23:46,288 INFO L131 PetriNetUnfolder]: For 588/626 co-relation queries the response was YES. [2022-12-13 11:23:46,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 132 events. 32/132 cut-off events. For 588/626 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 627 event pairs, 1 based on Foata normal form. 7/131 useless extension candidates. Maximal degree in co-relation 429. Up to 26 conditions per place. [2022-12-13 11:23:46,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 474 flow [2022-12-13 11:23:46,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 11:24:15,691 WARN L233 SmtUtils]: Spent 29.39s on a formula simplification. DAG size of input: 559 DAG size of output: 554 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:25:17,139 WARN L233 SmtUtils]: Spent 57.87s on a formula simplification. DAG size of input: 733 DAG size of output: 728 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:25:31,038 WARN L233 SmtUtils]: Spent 13.89s on a formula simplification that was a NOOP. DAG size: 718 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:25:51,820 WARN L233 SmtUtils]: Spent 20.78s on a formula simplification. DAG size of input: 559 DAG size of output: 554 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:26:19,936 WARN L233 SmtUtils]: Spent 28.11s on a formula simplification that was a NOOP. DAG size: 544 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:26:39,920 WARN L233 SmtUtils]: Spent 19.98s on a formula simplification. DAG size of input: 733 DAG size of output: 728 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) Received shutdown request... [2022-12-13 11:26:40,902 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 11:26:42,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 11:26:42,047 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition(TransFormulaUtils.java:310) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.structure.IcfgEdgeBuilder.constructSequentialComposition(IcfgEdgeBuilder.java:118) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:125) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:731) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:82) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:290) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:237) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:119) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-12-13 11:26:42,050 INFO L158 Benchmark]: Toolchain (without parser) took 864599.93ms. Allocated memory was 190.8MB in the beginning and 697.3MB in the end (delta: 506.5MB). Free memory was 167.8MB in the beginning and 580.7MB in the end (delta: -412.9MB). Peak memory consumption was 456.0MB. Max. memory is 8.0GB. [2022-12-13 11:26:42,050 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:26:42,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.96ms. Allocated memory is still 190.8MB. Free memory was 167.8MB in the beginning and 156.0MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 11:26:42,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.70ms. Allocated memory is still 190.8MB. Free memory was 156.0MB in the beginning and 153.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:26:42,050 INFO L158 Benchmark]: Boogie Preprocessor took 47.74ms. Allocated memory is still 190.8MB. Free memory was 153.9MB in the beginning and 152.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:26:42,050 INFO L158 Benchmark]: RCFGBuilder took 541.88ms. Allocated memory is still 190.8MB. Free memory was 152.3MB in the beginning and 135.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 11:26:42,050 INFO L158 Benchmark]: TraceAbstraction took 863670.22ms. Allocated memory was 190.8MB in the beginning and 697.3MB in the end (delta: 506.5MB). Free memory was 133.4MB in the beginning and 580.7MB in the end (delta: -447.3MB). Peak memory consumption was 421.4MB. Max. memory is 8.0GB. [2022-12-13 11:26:42,051 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 269.96ms. Allocated memory is still 190.8MB. Free memory was 167.8MB in the beginning and 156.0MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.70ms. Allocated memory is still 190.8MB. Free memory was 156.0MB in the beginning and 153.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.74ms. Allocated memory is still 190.8MB. Free memory was 153.9MB in the beginning and 152.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 541.88ms. Allocated memory is still 190.8MB. Free memory was 152.3MB in the beginning and 135.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 863670.22ms. Allocated memory was 190.8MB in the beginning and 697.3MB in the end (delta: 506.5MB). Free memory was 133.4MB in the beginning and 580.7MB in the end (delta: -447.3MB). Peak memory consumption was 421.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 170 PlacesBefore, 21 PlacesAfterwards, 181 TransitionsBefore, 17 TransitionsAfterwards, 4092 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 85 ConcurrentYvCompositions, 13 ChoiceCompositions, 162 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2768, independent: 2766, independent conditional: 2766, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2535, independent: 2533, independent conditional: 0, independent unconditional: 2533, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2535, independent: 2533, independent conditional: 0, independent unconditional: 2533, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2535, independent: 2533, independent conditional: 0, independent unconditional: 2533, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2768, independent: 233, independent conditional: 233, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2535, unknown conditional: 2535, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2621, Positive cache size: 2619, Positive conditional cache size: 2619, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 24 PlacesBefore, 23 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 9, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 16, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 26 PlacesBefore, 24 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 22, Positive conditional cache size: 22, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 26 PlacesBefore, 26 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 40, Positive conditional cache size: 40, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 27 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 37 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 51, Positive conditional cache size: 51, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 59, Positive conditional cache size: 59, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 40 PlacesBefore, 39 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 59, Positive conditional cache size: 59, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 41 PlacesBefore, 40 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 62, Positive conditional cache size: 62, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 45 PlacesBefore, 46 PlacesAfterwards, 31 TransitionsBefore, 32 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 42 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 69, Positive conditional cache size: 69, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 45 PlacesBefore, 45 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 70, Positive conditional cache size: 70, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 46 PlacesBefore, 45 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 73, Positive conditional cache size: 73, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 47 PlacesBefore, 46 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 76, Positive conditional cache size: 76, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 49 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 82, Positive conditional cache size: 82, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 49 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 85, Positive conditional cache size: 85, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 50 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 91, Positive conditional cache size: 91, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.8s, 49 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 94, Positive conditional cache size: 94, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 51 PlacesBefore, 50 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 97, Positive conditional cache size: 97, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.8s, 52 PlacesBefore, 51 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 100, Positive conditional cache size: 100, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 100, Positive conditional cache size: 100, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.3s, 55 PlacesBefore, 54 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 103, Positive conditional cache size: 103, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 56 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 109, Positive conditional cache size: 109, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.3s, 55 PlacesBefore, 54 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 112, Positive conditional cache size: 112, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 56 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 118, Positive conditional cache size: 118, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.5s, 55 PlacesBefore, 54 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 121, Positive conditional cache size: 121, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 56 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 127, Positive conditional cache size: 127, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.3s, 55 PlacesBefore, 54 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 130, Positive conditional cache size: 130, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 56 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 136, Positive conditional cache size: 136, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 63.7s, 55 PlacesBefore, 54 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 139, Positive conditional cache size: 139, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 56 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 145, Positive conditional cache size: 145, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 76.8s, 55 PlacesBefore, 54 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 148, Positive conditional cache size: 148, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.4s, 56 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 154, Positive conditional cache size: 154, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 110.9s, 55 PlacesBefore, 54 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 157, Positive conditional cache size: 157, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.7s, 56 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 163, Positive conditional cache size: 163, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 126.4s, 55 PlacesBefore, 54 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 166, Positive conditional cache size: 166, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.7s, 56 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 172, Positive conditional cache size: 172, Positive unconditional cache size: 0, Negative cache size: 5, Negative conditional cache size: 5, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown [2022-12-13 11:26:42,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0