/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 04:42:21,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 04:42:21,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 04:42:21,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 04:42:21,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 04:42:21,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 04:42:21,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 04:42:21,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 04:42:21,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 04:42:21,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 04:42:21,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 04:42:21,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 04:42:21,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 04:42:21,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 04:42:21,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 04:42:21,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 04:42:21,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 04:42:21,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 04:42:21,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 04:42:21,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 04:42:21,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 04:42:21,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 04:42:21,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 04:42:21,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 04:42:21,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 04:42:21,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 04:42:21,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 04:42:21,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 04:42:21,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 04:42:21,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 04:42:21,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 04:42:21,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 04:42:21,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 04:42:21,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 04:42:21,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 04:42:21,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 04:42:21,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 04:42:21,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 04:42:21,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 04:42:21,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 04:42:21,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 04:42:21,650 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-RepeatedSemanticLbe.epf [2022-12-13 04:42:21,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 04:42:21,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 04:42:21,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 04:42:21,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 04:42:21,685 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 04:42:21,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 04:42:21,686 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 04:42:21,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 04:42:21,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 04:42:21,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 04:42:21,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 04:42:21,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 04:42:21,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 04:42:21,688 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 04:42:21,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 04:42:21,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 04:42:21,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 04:42:21,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 04:42:21,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 04:42:21,688 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 04:42:21,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 04:42:21,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:42:21,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 04:42:21,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 04:42:21,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 04:42:21,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 04:42:21,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 04:42:21,690 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 04:42:21,690 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 04:42:21,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 04:42:22,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 04:42:22,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 04:42:22,019 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 04:42:22,020 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 04:42:22,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-12-13 04:42:23,245 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 04:42:23,456 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 04:42:23,457 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-12-13 04:42:23,464 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a58cc32/b46d9fe6079244aa8e8e118cc28fe44f/FLAG8c1ab2f37 [2022-12-13 04:42:23,479 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a58cc32/b46d9fe6079244aa8e8e118cc28fe44f [2022-12-13 04:42:23,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 04:42:23,482 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 04:42:23,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 04:42:23,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 04:42:23,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 04:42:23,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e3d7915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23, skipping insertion in model container [2022-12-13 04:42:23,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 04:42:23,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 04:42:23,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:42:23,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:42:23,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:42:23,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:42:23,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:42:23,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:42:23,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:42:23,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:42:23,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:42:23,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:42:23,719 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/popl20-horseshoe.wvr.c[3424,3437] [2022-12-13 04:42:23,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:42:23,742 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 04:42:23,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:42:23,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:42:23,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:42:23,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:42:23,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:42:23,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:42:23,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:42:23,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:42:23,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:42:23,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:42:23,776 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/popl20-horseshoe.wvr.c[3424,3437] [2022-12-13 04:42:23,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:42:23,794 INFO L208 MainTranslator]: Completed translation [2022-12-13 04:42:23,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23 WrapperNode [2022-12-13 04:42:23,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 04:42:23,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 04:42:23,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 04:42:23,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 04:42:23,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,855 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-12-13 04:42:23,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 04:42:23,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 04:42:23,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 04:42:23,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 04:42:23,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 04:42:23,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 04:42:23,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 04:42:23,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 04:42:23,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23" (1/1) ... [2022-12-13 04:42:23,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:42:23,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:42:23,936 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 04:42:23,943 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 04:42:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 04:42:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 04:42:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 04:42:23,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 04:42:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 04:42:23,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 04:42:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 04:42:23,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 04:42:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 04:42:23,964 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 04:42:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 04:42:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 04:42:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 04:42:23,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 04:42:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 04:42:23,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 04:42:23,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 04:42:23,966 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 04:42:24,061 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 04:42:24,063 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 04:42:24,433 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 04:42:24,619 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 04:42:24,619 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 04:42:24,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:42:24 BoogieIcfgContainer [2022-12-13 04:42:24,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 04:42:24,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 04:42:24,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 04:42:24,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 04:42:24,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:42:23" (1/3) ... [2022-12-13 04:42:24,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccf9d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:42:24, skipping insertion in model container [2022-12-13 04:42:24,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:42:23" (2/3) ... [2022-12-13 04:42:24,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccf9d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:42:24, skipping insertion in model container [2022-12-13 04:42:24,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:42:24" (3/3) ... [2022-12-13 04:42:24,631 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2022-12-13 04:42:24,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 04:42:24,647 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 04:42:24,647 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 04:42:24,736 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 04:42:24,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 194 transitions, 412 flow [2022-12-13 04:42:24,876 INFO L130 PetriNetUnfolder]: 18/191 cut-off events. [2022-12-13 04:42:24,876 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:42:24,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 191 events. 18/191 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 111 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2022-12-13 04:42:24,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 194 transitions, 412 flow [2022-12-13 04:42:24,894 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 181 transitions, 380 flow [2022-12-13 04:42:24,896 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:24,915 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 181 transitions, 380 flow [2022-12-13 04:42:24,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 181 transitions, 380 flow [2022-12-13 04:42:24,974 INFO L130 PetriNetUnfolder]: 18/181 cut-off events. [2022-12-13 04:42:24,974 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:42:24,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 181 events. 18/181 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 112 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2022-12-13 04:42:24,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 181 transitions, 380 flow [2022-12-13 04:42:24,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-13 04:42:32,045 INFO L241 LiptonReduction]: Total number of compositions: 152 [2022-12-13 04:42:32,056 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 04:42:32,061 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;@2b26e119, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 04:42:32,061 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 04:42:32,067 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-13 04:42:32,067 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:42:32,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:32,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:32,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:32,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash 717820976, now seen corresponding path program 1 times [2022-12-13 04:42:32,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:32,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353727554] [2022-12-13 04:42:32,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:32,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:32,325 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 04:42:32,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:32,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353727554] [2022-12-13 04:42:32,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353727554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:32,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:42:32,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 04:42:32,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412535791] [2022-12-13 04:42:32,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:32,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 04:42:32,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:32,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 04:42:32,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 04:42:32,350 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-13 04:42:32,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 04:42:32,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:32,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-13 04:42:32,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:32,452 INFO L130 PetriNetUnfolder]: 321/458 cut-off events. [2022-12-13 04:42:32,452 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-13 04:42:32,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 458 events. 321/458 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1460 event pairs, 166 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 732. Up to 449 conditions per place. [2022-12-13 04:42:32,457 INFO L137 encePairwiseOnDemand]: 27/28 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2022-12-13 04:42:32,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 120 flow [2022-12-13 04:42:32,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 04:42:32,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 04:42:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2022-12-13 04:42:32,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2022-12-13 04:42:32,473 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2022-12-13 04:42:32,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 27 transitions, 120 flow [2022-12-13 04:42:32,477 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 27 transitions, 120 flow [2022-12-13 04:42:32,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:32,481 INFO L89 Accepts]: Start accepts. Operand has 33 places, 27 transitions, 120 flow [2022-12-13 04:42:32,484 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:32,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:32,485 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 27 transitions, 120 flow [2022-12-13 04:42:32,488 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 120 flow [2022-12-13 04:42:32,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 04:42:32,492 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:42:32,494 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 04:42:32,494 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 120 flow [2022-12-13 04:42:32,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 04:42:32,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:32,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:32,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 04:42:32,504 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:32,505 INFO L85 PathProgramCache]: Analyzing trace with hash 749797966, now seen corresponding path program 1 times [2022-12-13 04:42:32,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:32,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313537803] [2022-12-13 04:42:32,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:32,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:32,810 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 04:42:32,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:32,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313537803] [2022-12-13 04:42:32,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313537803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:32,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:42:32,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:42:32,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21780243] [2022-12-13 04:42:32,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:32,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:42:32,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:32,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:42:32,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:42:32,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-13 04:42:32,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 04:42:32,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:32,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-13 04:42:32,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:32,925 INFO L130 PetriNetUnfolder]: 326/478 cut-off events. [2022-12-13 04:42:32,925 INFO L131 PetriNetUnfolder]: For 45/47 co-relation queries the response was YES. [2022-12-13 04:42:32,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 478 events. 326/478 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1530 event pairs, 167 based on Foata normal form. 15/336 useless extension candidates. Maximal degree in co-relation 1078. Up to 466 conditions per place. [2022-12-13 04:42:32,929 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 23 selfloop transitions, 2 changer transitions 11/39 dead transitions. [2022-12-13 04:42:32,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 249 flow [2022-12-13 04:42:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:42:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:42:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-12-13 04:42:32,931 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 04:42:32,931 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2022-12-13 04:42:32,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 39 transitions, 249 flow [2022-12-13 04:42:32,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 174 flow [2022-12-13 04:42:32,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:32,937 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 174 flow [2022-12-13 04:42:32,938 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:32,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:32,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 174 flow [2022-12-13 04:42:32,939 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 174 flow [2022-12-13 04:42:32,939 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 04:42:34,176 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:42:34,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1241 [2022-12-13 04:42:34,178 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 168 flow [2022-12-13 04:42:34,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 04:42:34,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:34,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:34,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 04:42:34,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:34,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:34,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1069403605, now seen corresponding path program 1 times [2022-12-13 04:42:34,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:34,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682505825] [2022-12-13 04:42:34,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:34,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:34,356 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 04:42:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:34,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682505825] [2022-12-13 04:42:34,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682505825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:34,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:42:34,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:42:34,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205594664] [2022-12-13 04:42:34,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:34,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:42:34,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:34,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:42:34,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:42:34,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-13 04:42:34,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 04:42:34,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:34,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-13 04:42:34,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:34,493 INFO L130 PetriNetUnfolder]: 368/550 cut-off events. [2022-12-13 04:42:34,493 INFO L131 PetriNetUnfolder]: For 112/136 co-relation queries the response was YES. [2022-12-13 04:42:34,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 550 events. 368/550 cut-off events. For 112/136 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1931 event pairs, 194 based on Foata normal form. 24/402 useless extension candidates. Maximal degree in co-relation 1424. Up to 531 conditions per place. [2022-12-13 04:42:34,500 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 22 selfloop transitions, 3 changer transitions 12/40 dead transitions. [2022-12-13 04:42:34,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 332 flow [2022-12-13 04:42:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:42:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:42:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-13 04:42:34,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2022-12-13 04:42:34,504 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2022-12-13 04:42:34,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 40 transitions, 332 flow [2022-12-13 04:42:34,507 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 28 transitions, 224 flow [2022-12-13 04:42:34,511 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:34,511 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 224 flow [2022-12-13 04:42:34,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:34,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:34,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 28 transitions, 224 flow [2022-12-13 04:42:34,515 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 224 flow [2022-12-13 04:42:34,515 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 04:42:34,809 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:42:34,810 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 299 [2022-12-13 04:42:34,811 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 216 flow [2022-12-13 04:42:34,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 04:42:34,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:34,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:34,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 04:42:34,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -646701779, now seen corresponding path program 1 times [2022-12-13 04:42:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:34,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738640853] [2022-12-13 04:42:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:34,984 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 04:42:34,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:34,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738640853] [2022-12-13 04:42:34,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738640853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:34,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:42:34,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 04:42:34,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060967978] [2022-12-13 04:42:34,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:34,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:42:34,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:34,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:42:34,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:42:34,986 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-13 04:42:34,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 04:42:34,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:34,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-13 04:42:34,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:35,080 INFO L130 PetriNetUnfolder]: 340/484 cut-off events. [2022-12-13 04:42:35,080 INFO L131 PetriNetUnfolder]: For 143/197 co-relation queries the response was YES. [2022-12-13 04:42:35,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2441 conditions, 484 events. 340/484 cut-off events. For 143/197 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1490 event pairs, 48 based on Foata normal form. 16/332 useless extension candidates. Maximal degree in co-relation 1956. Up to 475 conditions per place. [2022-12-13 04:42:35,085 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 31 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-13 04:42:35,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 370 flow [2022-12-13 04:42:35,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:42:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:42:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-13 04:42:35,086 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-13 04:42:35,088 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2022-12-13 04:42:35,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 37 transitions, 370 flow [2022-12-13 04:42:35,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 37 transitions, 370 flow [2022-12-13 04:42:35,094 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:35,094 INFO L89 Accepts]: Start accepts. Operand has 38 places, 37 transitions, 370 flow [2022-12-13 04:42:35,096 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:35,096 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:35,097 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 37 transitions, 370 flow [2022-12-13 04:42:35,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 37 transitions, 370 flow [2022-12-13 04:42:35,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 04:42:35,100 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:42:35,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 04:42:35,108 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 370 flow [2022-12-13 04:42:35,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 04:42:35,108 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:35,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:35,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 04:42:35,108 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:35,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:35,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1384177257, now seen corresponding path program 2 times [2022-12-13 04:42:35,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:35,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509929938] [2022-12-13 04:42:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:36,622 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 04:42:36,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:36,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509929938] [2022-12-13 04:42:36,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509929938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:36,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:42:36,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 04:42:36,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773637482] [2022-12-13 04:42:36,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:36,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 04:42:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:36,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 04:42:36,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 04:42:36,624 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-13 04:42:36,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 370 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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 04:42:36,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:36,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-13 04:42:36,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:37,122 INFO L130 PetriNetUnfolder]: 457/680 cut-off events. [2022-12-13 04:42:37,123 INFO L131 PetriNetUnfolder]: For 190/214 co-relation queries the response was YES. [2022-12-13 04:42:37,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4031 conditions, 680 events. 457/680 cut-off events. For 190/214 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2327 event pairs, 36 based on Foata normal form. 2/470 useless extension candidates. Maximal degree in co-relation 3308. Up to 646 conditions per place. [2022-12-13 04:42:37,129 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 65 selfloop transitions, 18 changer transitions 2/87 dead transitions. [2022-12-13 04:42:37,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 87 transitions, 1066 flow [2022-12-13 04:42:37,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 04:42:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 04:42:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-12-13 04:42:37,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39094650205761317 [2022-12-13 04:42:37,131 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-12-13 04:42:37,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 87 transitions, 1066 flow [2022-12-13 04:42:37,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 85 transitions, 1039 flow [2022-12-13 04:42:37,161 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:37,161 INFO L89 Accepts]: Start accepts. Operand has 46 places, 85 transitions, 1039 flow [2022-12-13 04:42:37,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:37,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:37,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 85 transitions, 1039 flow [2022-12-13 04:42:37,165 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 85 transitions, 1039 flow [2022-12-13 04:42:37,165 INFO L226 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-13 04:42:46,232 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:42:46,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9072 [2022-12-13 04:42:46,233 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 83 transitions, 1015 flow [2022-12-13 04:42:46,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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 04:42:46,233 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:46,233 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:46,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 04:42:46,234 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:46,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash -863161890, now seen corresponding path program 1 times [2022-12-13 04:42:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:46,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847601837] [2022-12-13 04:42:46,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:46,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:46,325 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 04:42:46,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:46,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847601837] [2022-12-13 04:42:46,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847601837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:46,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:42:46,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 04:42:46,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597617033] [2022-12-13 04:42:46,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:46,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:42:46,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:46,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:42:46,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:42:46,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-13 04:42:46,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 83 transitions, 1015 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 04:42:46,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:46,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-13 04:42:46,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:46,452 INFO L130 PetriNetUnfolder]: 318/492 cut-off events. [2022-12-13 04:42:46,452 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2022-12-13 04:42:46,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 492 events. 318/492 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1548 event pairs, 27 based on Foata normal form. 8/360 useless extension candidates. Maximal degree in co-relation 2765. Up to 461 conditions per place. [2022-12-13 04:42:46,457 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 73 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2022-12-13 04:42:46,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 85 transitions, 1205 flow [2022-12-13 04:42:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:42:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:42:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 04:42:46,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4942528735632184 [2022-12-13 04:42:46,459 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-12-13 04:42:46,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 85 transitions, 1205 flow [2022-12-13 04:42:46,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 85 transitions, 1205 flow [2022-12-13 04:42:46,468 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:46,468 INFO L89 Accepts]: Start accepts. Operand has 46 places, 85 transitions, 1205 flow [2022-12-13 04:42:46,470 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:46,470 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:46,470 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 85 transitions, 1205 flow [2022-12-13 04:42:46,472 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 85 transitions, 1205 flow [2022-12-13 04:42:46,472 INFO L226 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-13 04:42:46,473 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:42:46,473 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 04:42:46,474 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 85 transitions, 1205 flow [2022-12-13 04:42:46,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 04:42:46,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:46,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:46,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 04:42:46,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:46,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash -579218860, now seen corresponding path program 2 times [2022-12-13 04:42:46,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:46,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209591635] [2022-12-13 04:42:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:46,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:47,470 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 04:42:47,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:47,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209591635] [2022-12-13 04:42:47,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209591635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:47,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:42:47,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:42:47,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712188106] [2022-12-13 04:42:47,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:47,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:42:47,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:47,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:42:47,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:42:47,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:42:47,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 85 transitions, 1205 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 04:42:47,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:47,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:42:47,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:47,862 INFO L130 PetriNetUnfolder]: 372/608 cut-off events. [2022-12-13 04:42:47,863 INFO L131 PetriNetUnfolder]: For 312/312 co-relation queries the response was YES. [2022-12-13 04:42:47,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4740 conditions, 608 events. 372/608 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2267 event pairs, 36 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 2904. Up to 566 conditions per place. [2022-12-13 04:42:47,869 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 118 selfloop transitions, 15 changer transitions 2/137 dead transitions. [2022-12-13 04:42:47,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 137 transitions, 2237 flow [2022-12-13 04:42:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:42:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:42:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-13 04:42:47,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2022-12-13 04:42:47,873 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-12-13 04:42:47,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 137 transitions, 2237 flow [2022-12-13 04:42:47,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 135 transitions, 2202 flow [2022-12-13 04:42:47,885 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:47,886 INFO L89 Accepts]: Start accepts. Operand has 52 places, 135 transitions, 2202 flow [2022-12-13 04:42:47,887 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:47,888 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:47,888 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 135 transitions, 2202 flow [2022-12-13 04:42:47,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 135 transitions, 2202 flow [2022-12-13 04:42:47,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-13 04:42:47,892 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:42:47,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 04:42:47,894 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 135 transitions, 2202 flow [2022-12-13 04:42:47,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 04:42:47,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:47,894 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:47,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 04:42:47,894 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:47,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:47,895 INFO L85 PathProgramCache]: Analyzing trace with hash -802874120, now seen corresponding path program 3 times [2022-12-13 04:42:47,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:47,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969772730] [2022-12-13 04:42:47,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:47,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:49,259 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 04:42:49,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:49,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969772730] [2022-12-13 04:42:49,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969772730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:49,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:42:49,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:42:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901610608] [2022-12-13 04:42:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:49,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:42:49,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:49,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:42:49,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:42:49,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:42:49,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 135 transitions, 2202 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:42:49,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:49,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:42:49,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:49,700 INFO L130 PetriNetUnfolder]: 390/640 cut-off events. [2022-12-13 04:42:49,700 INFO L131 PetriNetUnfolder]: For 350/350 co-relation queries the response was YES. [2022-12-13 04:42:49,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5630 conditions, 640 events. 390/640 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2412 event pairs, 31 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 3381. Up to 598 conditions per place. [2022-12-13 04:42:49,707 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 134 selfloop transitions, 13 changer transitions 2/151 dead transitions. [2022-12-13 04:42:49,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 151 transitions, 2774 flow [2022-12-13 04:42:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:42:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:42:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-13 04:42:49,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4088669950738916 [2022-12-13 04:42:49,711 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2022-12-13 04:42:49,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 151 transitions, 2774 flow [2022-12-13 04:42:49,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 149 transitions, 2735 flow [2022-12-13 04:42:49,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:49,728 INFO L89 Accepts]: Start accepts. Operand has 58 places, 149 transitions, 2735 flow [2022-12-13 04:42:49,731 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:49,731 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:49,731 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 149 transitions, 2735 flow [2022-12-13 04:42:49,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 149 transitions, 2735 flow [2022-12-13 04:42:49,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-13 04:42:49,736 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:42:49,738 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 04:42:49,738 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 149 transitions, 2735 flow [2022-12-13 04:42:49,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:42:49,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:49,738 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:49,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 04:42:49,739 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:49,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:49,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1279495332, now seen corresponding path program 4 times [2022-12-13 04:42:49,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:49,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546807787] [2022-12-13 04:42:49,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:49,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:50,948 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 04:42:50,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:50,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546807787] [2022-12-13 04:42:50,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546807787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:50,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:42:50,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:42:50,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679675881] [2022-12-13 04:42:50,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:50,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:42:50,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:50,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:42:50,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:42:50,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:42:50,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 149 transitions, 2735 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 04:42:50,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:50,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:42:50,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:51,294 INFO L130 PetriNetUnfolder]: 416/693 cut-off events. [2022-12-13 04:42:51,294 INFO L131 PetriNetUnfolder]: For 355/355 co-relation queries the response was YES. [2022-12-13 04:42:51,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6778 conditions, 693 events. 416/693 cut-off events. For 355/355 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2781 event pairs, 33 based on Foata normal form. 1/525 useless extension candidates. Maximal degree in co-relation 4346. Up to 646 conditions per place. [2022-12-13 04:42:51,306 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 147 selfloop transitions, 25 changer transitions 2/176 dead transitions. [2022-12-13 04:42:51,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 176 transitions, 3589 flow [2022-12-13 04:42:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:42:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:42:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-13 04:42:51,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2022-12-13 04:42:51,309 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2022-12-13 04:42:51,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 176 transitions, 3589 flow [2022-12-13 04:42:51,316 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 174 transitions, 3546 flow [2022-12-13 04:42:51,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:51,324 INFO L89 Accepts]: Start accepts. Operand has 64 places, 174 transitions, 3546 flow [2022-12-13 04:42:51,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:51,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:51,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 174 transitions, 3546 flow [2022-12-13 04:42:51,335 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 174 transitions, 3546 flow [2022-12-13 04:42:51,335 INFO L226 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-13 04:42:51,336 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:42:51,336 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 04:42:51,337 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 174 transitions, 3546 flow [2022-12-13 04:42:51,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 04:42:51,337 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:51,337 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:51,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 04:42:51,337 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:51,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:51,338 INFO L85 PathProgramCache]: Analyzing trace with hash -14057360, now seen corresponding path program 5 times [2022-12-13 04:42:51,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:51,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200884517] [2022-12-13 04:42:51,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:52,362 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 04:42:52,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:52,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200884517] [2022-12-13 04:42:52,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200884517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:52,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:42:52,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:42:52,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682773775] [2022-12-13 04:42:52,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:52,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:42:52,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:52,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:42:52,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:42:52,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:42:52,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 174 transitions, 3546 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 04:42:52,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:52,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:42:52,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:52,733 INFO L130 PetriNetUnfolder]: 434/725 cut-off events. [2022-12-13 04:42:52,733 INFO L131 PetriNetUnfolder]: For 444/444 co-relation queries the response was YES. [2022-12-13 04:42:52,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7817 conditions, 725 events. 434/725 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2962 event pairs, 24 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 5077. Up to 678 conditions per place. [2022-12-13 04:42:52,741 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 165 selfloop transitions, 21 changer transitions 2/190 dead transitions. [2022-12-13 04:42:52,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 190 transitions, 4260 flow [2022-12-13 04:42:52,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:42:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:42:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-13 04:42:52,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4088669950738916 [2022-12-13 04:42:52,743 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2022-12-13 04:42:52,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 190 transitions, 4260 flow [2022-12-13 04:42:52,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 188 transitions, 4213 flow [2022-12-13 04:42:52,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:52,760 INFO L89 Accepts]: Start accepts. Operand has 70 places, 188 transitions, 4213 flow [2022-12-13 04:42:52,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:52,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:52,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 188 transitions, 4213 flow [2022-12-13 04:42:52,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 188 transitions, 4213 flow [2022-12-13 04:42:52,770 INFO L226 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-13 04:42:52,771 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:42:52,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 04:42:52,772 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 188 transitions, 4213 flow [2022-12-13 04:42:52,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 04:42:52,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:52,772 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:52,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 04:42:52,773 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash 979269212, now seen corresponding path program 1 times [2022-12-13 04:42:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:52,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537408137] [2022-12-13 04:42:52,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:52,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:42:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:52,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537408137] [2022-12-13 04:42:52,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537408137] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:42:52,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434572709] [2022-12-13 04:42:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:52,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:42:52,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:42:52,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:42:52,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 04:42:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:53,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 04:42:53,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:42:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:42:53,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:42:53,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434572709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:53,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 04:42:53,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-13 04:42:53,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026012527] [2022-12-13 04:42:53,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:53,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:42:53,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:53,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:42:53,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:42:53,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-13 04:42:53,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 188 transitions, 4213 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 04:42:53,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:53,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-13 04:42:53,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:53,539 INFO L130 PetriNetUnfolder]: 603/1037 cut-off events. [2022-12-13 04:42:53,539 INFO L131 PetriNetUnfolder]: For 644/644 co-relation queries the response was YES. [2022-12-13 04:42:53,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12229 conditions, 1037 events. 603/1037 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4736 event pairs, 40 based on Foata normal form. 76/865 useless extension candidates. Maximal degree in co-relation 5812. Up to 980 conditions per place. [2022-12-13 04:42:53,548 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 91 selfloop transitions, 8 changer transitions 123/226 dead transitions. [2022-12-13 04:42:53,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 226 transitions, 5521 flow [2022-12-13 04:42:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:42:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:42:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-13 04:42:53,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2022-12-13 04:42:53,551 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2022-12-13 04:42:53,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 226 transitions, 5521 flow [2022-12-13 04:42:53,559 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 103 transitions, 2479 flow [2022-12-13 04:42:53,570 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:53,571 INFO L89 Accepts]: Start accepts. Operand has 55 places, 103 transitions, 2479 flow [2022-12-13 04:42:53,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:53,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:53,573 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 103 transitions, 2479 flow [2022-12-13 04:42:53,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 103 transitions, 2479 flow [2022-12-13 04:42:53,576 INFO L226 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-13 04:42:53,576 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:42:53,577 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 04:42:53,577 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 103 transitions, 2479 flow [2022-12-13 04:42:53,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 04:42:53,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:53,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:53,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 04:42:53,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 04:42:53,784 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash 164762401, now seen corresponding path program 1 times [2022-12-13 04:42:53,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:53,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582449238] [2022-12-13 04:42:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:53,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:42:53,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:53,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582449238] [2022-12-13 04:42:53,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582449238] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:42:53,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574057974] [2022-12-13 04:42:53,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:53,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:42:53,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:42:53,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:42:53,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 04:42:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:53,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 04:42:53,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:42:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:42:54,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:42:54,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574057974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:54,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 04:42:54,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 04:42:54,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896746231] [2022-12-13 04:42:54,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:54,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:42:54,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:54,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:42:54,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:42:54,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-13 04:42:54,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 103 transitions, 2479 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 04:42:54,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:54,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-13 04:42:54,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:54,188 INFO L130 PetriNetUnfolder]: 496/795 cut-off events. [2022-12-13 04:42:54,189 INFO L131 PetriNetUnfolder]: For 937/937 co-relation queries the response was YES. [2022-12-13 04:42:54,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10117 conditions, 795 events. 496/795 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3053 event pairs, 65 based on Foata normal form. 76/652 useless extension candidates. Maximal degree in co-relation 4469. Up to 773 conditions per place. [2022-12-13 04:42:54,196 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 73 selfloop transitions, 2 changer transitions 33/111 dead transitions. [2022-12-13 04:42:54,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 2888 flow [2022-12-13 04:42:54,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:42:54,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:42:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-13 04:42:54,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2022-12-13 04:42:54,198 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2022-12-13 04:42:54,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 111 transitions, 2888 flow [2022-12-13 04:42:54,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 78 transitions, 2026 flow [2022-12-13 04:42:54,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:54,214 INFO L89 Accepts]: Start accepts. Operand has 50 places, 78 transitions, 2026 flow [2022-12-13 04:42:54,216 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:54,216 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:54,216 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 78 transitions, 2026 flow [2022-12-13 04:42:54,219 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 78 transitions, 2026 flow [2022-12-13 04:42:54,219 INFO L226 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-13 04:42:54,220 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:42:54,220 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 04:42:54,220 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 78 transitions, 2026 flow [2022-12-13 04:42:54,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 04:42:54,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:42:54,221 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:42:54,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 04:42:54,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 04:42:54,427 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:42:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:42:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash 78136178, now seen corresponding path program 1 times [2022-12-13 04:42:54,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:42:54,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845753349] [2022-12-13 04:42:54,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:42:54,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:42:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:42:55,757 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 04:42:55,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:42:55,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845753349] [2022-12-13 04:42:55,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845753349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:42:55,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:42:55,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:42:55,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098658668] [2022-12-13 04:42:55,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:42:55,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:42:55,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:42:55,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:42:55,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:42:55,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 04:42:55,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 78 transitions, 2026 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 04:42:55,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:42:55,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 04:42:55,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:42:56,220 INFO L130 PetriNetUnfolder]: 436/703 cut-off events. [2022-12-13 04:42:56,221 INFO L131 PetriNetUnfolder]: For 700/700 co-relation queries the response was YES. [2022-12-13 04:42:56,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9596 conditions, 703 events. 436/703 cut-off events. For 700/700 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2620 event pairs, 53 based on Foata normal form. 1/519 useless extension candidates. Maximal degree in co-relation 4817. Up to 693 conditions per place. [2022-12-13 04:42:56,229 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 104 selfloop transitions, 12 changer transitions 2/120 dead transitions. [2022-12-13 04:42:56,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 120 transitions, 3368 flow [2022-12-13 04:42:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:42:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:42:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-12-13 04:42:56,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2022-12-13 04:42:56,231 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2022-12-13 04:42:56,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 120 transitions, 3368 flow [2022-12-13 04:42:56,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 118 transitions, 3309 flow [2022-12-13 04:42:56,247 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:42:56,247 INFO L89 Accepts]: Start accepts. Operand has 57 places, 118 transitions, 3309 flow [2022-12-13 04:42:56,251 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:42:56,251 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:42:56,251 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 118 transitions, 3309 flow [2022-12-13 04:42:56,255 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 118 transitions, 3309 flow [2022-12-13 04:42:56,255 INFO L226 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-13 04:43:01,555 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:43:01,556 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5309 [2022-12-13 04:43:01,556 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 117 transitions, 3281 flow [2022-12-13 04:43:01,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 04:43:01,556 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:01,556 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:01,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 04:43:01,556 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:01,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:01,557 INFO L85 PathProgramCache]: Analyzing trace with hash 865161272, now seen corresponding path program 1 times [2022-12-13 04:43:01,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:01,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354695191] [2022-12-13 04:43:01,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:01,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:02,427 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 04:43:02,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:02,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354695191] [2022-12-13 04:43:02,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354695191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:02,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:02,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:43:02,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051087855] [2022-12-13 04:43:02,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:02,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:43:02,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:02,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:43:02,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:43:02,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:43:02,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 117 transitions, 3281 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 04:43:02,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:02,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:43:02,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:02,742 INFO L130 PetriNetUnfolder]: 465/767 cut-off events. [2022-12-13 04:43:02,742 INFO L131 PetriNetUnfolder]: For 1043/1043 co-relation queries the response was YES. [2022-12-13 04:43:02,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11168 conditions, 767 events. 465/767 cut-off events. For 1043/1043 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3061 event pairs, 64 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 5165. Up to 753 conditions per place. [2022-12-13 04:43:02,749 INFO L137 encePairwiseOnDemand]: 16/29 looper letters, 125 selfloop transitions, 20 changer transitions 2/149 dead transitions. [2022-12-13 04:43:02,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 149 transitions, 4476 flow [2022-12-13 04:43:02,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:43:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:43:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2022-12-13 04:43:02,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4187192118226601 [2022-12-13 04:43:02,751 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2022-12-13 04:43:02,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 149 transitions, 4476 flow [2022-12-13 04:43:02,759 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 147 transitions, 4413 flow [2022-12-13 04:43:02,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:02,767 INFO L89 Accepts]: Start accepts. Operand has 62 places, 147 transitions, 4413 flow [2022-12-13 04:43:02,770 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:02,770 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:02,770 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 147 transitions, 4413 flow [2022-12-13 04:43:02,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 147 transitions, 4413 flow [2022-12-13 04:43:02,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-13 04:43:02,775 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:43:02,776 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 04:43:02,776 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 147 transitions, 4413 flow [2022-12-13 04:43:02,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 04:43:02,777 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:02,777 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:02,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 04:43:02,777 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1620522570, now seen corresponding path program 2 times [2022-12-13 04:43:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:02,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386144742] [2022-12-13 04:43:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:04,454 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 04:43:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:04,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386144742] [2022-12-13 04:43:04,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386144742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:04,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:04,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:43:04,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523027621] [2022-12-13 04:43:04,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:04,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:43:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:04,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:43:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:43:04,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:43:04,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 147 transitions, 4413 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:43:04,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:04,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:43:04,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:05,020 INFO L130 PetriNetUnfolder]: 510/855 cut-off events. [2022-12-13 04:43:05,021 INFO L131 PetriNetUnfolder]: For 1031/1031 co-relation queries the response was YES. [2022-12-13 04:43:05,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13327 conditions, 855 events. 510/855 cut-off events. For 1031/1031 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3606 event pairs, 54 based on Foata normal form. 1/653 useless extension candidates. Maximal degree in co-relation 5513. Up to 840 conditions per place. [2022-12-13 04:43:05,029 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 178 selfloop transitions, 15 changer transitions 2/197 dead transitions. [2022-12-13 04:43:05,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 197 transitions, 6309 flow [2022-12-13 04:43:05,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:43:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:43:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-13 04:43:05,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3793103448275862 [2022-12-13 04:43:05,030 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2022-12-13 04:43:05,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 197 transitions, 6309 flow [2022-12-13 04:43:05,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 195 transitions, 6242 flow [2022-12-13 04:43:05,050 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:05,050 INFO L89 Accepts]: Start accepts. Operand has 68 places, 195 transitions, 6242 flow [2022-12-13 04:43:05,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:05,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:05,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 195 transitions, 6242 flow [2022-12-13 04:43:05,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 195 transitions, 6242 flow [2022-12-13 04:43:05,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-13 04:43:05,063 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:43:05,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 04:43:05,064 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 195 transitions, 6242 flow [2022-12-13 04:43:05,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:43:05,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:05,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:05,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 04:43:05,064 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:05,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1152380816, now seen corresponding path program 3 times [2022-12-13 04:43:05,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:05,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493670318] [2022-12-13 04:43:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:05,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:05,842 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 04:43:05,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:05,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493670318] [2022-12-13 04:43:05,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493670318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:05,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:05,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:43:05,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767512259] [2022-12-13 04:43:05,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:05,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:43:05,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:05,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:43:05,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:43:05,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:43:05,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 195 transitions, 6242 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 04:43:05,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:05,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:43:05,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:06,299 INFO L130 PetriNetUnfolder]: 580/997 cut-off events. [2022-12-13 04:43:06,299 INFO L131 PetriNetUnfolder]: For 1262/1262 co-relation queries the response was YES. [2022-12-13 04:43:06,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16483 conditions, 997 events. 580/997 cut-off events. For 1262/1262 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4592 event pairs, 52 based on Foata normal form. 1/778 useless extension candidates. Maximal degree in co-relation 5861. Up to 978 conditions per place. [2022-12-13 04:43:06,311 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 227 selfloop transitions, 30 changer transitions 2/261 dead transitions. [2022-12-13 04:43:06,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 261 transitions, 8916 flow [2022-12-13 04:43:06,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:43:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:43:06,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-13 04:43:06,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4088669950738916 [2022-12-13 04:43:06,313 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2022-12-13 04:43:06,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 261 transitions, 8916 flow [2022-12-13 04:43:06,326 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 259 transitions, 8845 flow [2022-12-13 04:43:06,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:06,346 INFO L89 Accepts]: Start accepts. Operand has 74 places, 259 transitions, 8845 flow [2022-12-13 04:43:06,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:06,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:06,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 259 transitions, 8845 flow [2022-12-13 04:43:06,363 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 259 transitions, 8845 flow [2022-12-13 04:43:06,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 04:43:06,364 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:43:06,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 04:43:06,365 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 259 transitions, 8845 flow [2022-12-13 04:43:06,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 04:43:06,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:06,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:06,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 04:43:06,367 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:06,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash -313236576, now seen corresponding path program 1 times [2022-12-13 04:43:06,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:06,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632836759] [2022-12-13 04:43:06,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:06,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:43:06,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:06,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632836759] [2022-12-13 04:43:06,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632836759] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:43:06,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978704403] [2022-12-13 04:43:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:06,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:43:06,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:43:06,464 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:43:06,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 04:43:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:06,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 04:43:06,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:43:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:43:06,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:43:06,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978704403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:06,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 04:43:06,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-13 04:43:06,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013452262] [2022-12-13 04:43:06,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:06,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:43:06,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:06,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:43:06,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:43:06,630 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-13 04:43:06,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 259 transitions, 8845 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 04:43:06,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:06,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-13 04:43:06,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:06,970 INFO L130 PetriNetUnfolder]: 822/1428 cut-off events. [2022-12-13 04:43:06,970 INFO L131 PetriNetUnfolder]: For 1850/1850 co-relation queries the response was YES. [2022-12-13 04:43:06,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25227 conditions, 1428 events. 822/1428 cut-off events. For 1850/1850 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7048 event pairs, 56 based on Foata normal form. 76/1172 useless extension candidates. Maximal degree in co-relation 11946. Up to 1409 conditions per place. [2022-12-13 04:43:06,983 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 109 selfloop transitions, 19 changer transitions 164/297 dead transitions. [2022-12-13 04:43:06,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 297 transitions, 10749 flow [2022-12-13 04:43:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:43:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:43:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-13 04:43:06,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.603448275862069 [2022-12-13 04:43:06,985 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 45 predicate places. [2022-12-13 04:43:06,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 297 transitions, 10749 flow [2022-12-13 04:43:06,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 133 transitions, 4774 flow [2022-12-13 04:43:07,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:07,017 INFO L89 Accepts]: Start accepts. Operand has 61 places, 133 transitions, 4774 flow [2022-12-13 04:43:07,021 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:07,021 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:07,021 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 133 transitions, 4774 flow [2022-12-13 04:43:07,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 133 transitions, 4774 flow [2022-12-13 04:43:07,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-13 04:43:07,153 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [883] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_25| 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread2Thread1of1ForFork0_#res#1.base_25| 0) (not (= (ite (and (<= 0 v_~q2_back~0_157) (< v_~q2_back~0_157 v_~n2~0_110)) 1 0) 0)) (= (+ v_~s~0_92 |v_thread2Thread1of1ForFork0_~j~0#1_53|) v_~s~0_91) (not (= (ite (and (< v_~q1_front~0_117 v_~q1_back~0_193) (< v_~q1_front~0_117 v_~n1~0_129) (<= 0 v_~q1_front~0_117)) 1 0) 0)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_53| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~q2_back~0_157 1) v_~q2_back~0_156) (= (+ v_~q1_front~0_117 1) v_~q1_front~0_116) (= (select (select |v_#memory_int_285| v_~q1~0.base_108) (+ v_~q1~0.offset_108 (* v_~q1_front~0_117 4))) |v_thread2Thread1of1ForFork0_~j~0#1_53|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41| (ite (= (+ (select (select |v_#memory_int_285| v_~q2~0.base_115) (+ v_~q2~0.offset_115 (* 4 v_~q2_back~0_157))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_53|) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_108, ~n2~0=v_~n2~0_110, ~q1_front~0=v_~q1_front~0_117, ~q1_back~0=v_~q1_back~0_193, ~q2~0.offset=v_~q2~0.offset_115, ~n1~0=v_~n1~0_129, ~q1~0.base=v_~q1~0.base_108, #memory_int=|v_#memory_int_285|, ~q2~0.base=v_~q2~0.base_115, ~q2_back~0=v_~q2_back~0_157, ~s~0=v_~s~0_92} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_53|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_27|, ~q1~0.offset=v_~q1~0.offset_108, ~n2~0=v_~n2~0_110, ~q1_front~0=v_~q1_front~0_116, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_25|, ~q2~0.offset=v_~q2~0.offset_115, ~n1~0=v_~n1~0_129, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_17|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_17|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_27|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_25|, ~q1_back~0=v_~q1_back~0_193, ~q1~0.base=v_~q1~0.base_108, #memory_int=|v_#memory_int_285|, ~q2~0.base=v_~q2~0.base_115, ~q2_back~0=v_~q2_back~0_156, ~s~0=v_~s~0_91} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:43:07,294 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:43:07,295 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 278 [2022-12-13 04:43:07,295 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 131 transitions, 4704 flow [2022-12-13 04:43:07,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 04:43:07,295 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:07,295 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:07,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 04:43:07,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:43:07,496 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:07,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1819828417, now seen corresponding path program 1 times [2022-12-13 04:43:07,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:07,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683556965] [2022-12-13 04:43:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:08,513 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 04:43:08,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:08,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683556965] [2022-12-13 04:43:08,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683556965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:08,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:08,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:43:08,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668273852] [2022-12-13 04:43:08,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:08,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:43:08,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:08,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:43:08,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:43:08,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-13 04:43:08,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 131 transitions, 4704 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 04:43:08,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:08,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-13 04:43:08,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:08,985 INFO L130 PetriNetUnfolder]: 720/1155 cut-off events. [2022-12-13 04:43:08,985 INFO L131 PetriNetUnfolder]: For 1619/1653 co-relation queries the response was YES. [2022-12-13 04:43:08,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21738 conditions, 1155 events. 720/1155 cut-off events. For 1619/1653 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4846 event pairs, 53 based on Foata normal form. 1/817 useless extension candidates. Maximal degree in co-relation 12598. Up to 1146 conditions per place. [2022-12-13 04:43:08,997 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 126 selfloop transitions, 5 changer transitions 18/154 dead transitions. [2022-12-13 04:43:08,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 154 transitions, 5859 flow [2022-12-13 04:43:08,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:43:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:43:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-13 04:43:08,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35960591133004927 [2022-12-13 04:43:08,999 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2022-12-13 04:43:08,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 154 transitions, 5859 flow [2022-12-13 04:43:09,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 136 transitions, 5149 flow [2022-12-13 04:43:09,023 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:09,024 INFO L89 Accepts]: Start accepts. Operand has 63 places, 136 transitions, 5149 flow [2022-12-13 04:43:09,027 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:09,027 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:09,027 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 136 transitions, 5149 flow [2022-12-13 04:43:09,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 136 transitions, 5149 flow [2022-12-13 04:43:09,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:43:09,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (<= 0 v_~q1_back~0_In_1) (< v_~q1_back~0_In_1 v_~n1~0_In_1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= (+ v_~q1_back~0_In_1 1) v_~q1_back~0_Out_2) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_1| v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (select (select |v_#memory_int_In_3| v_~q1~0.base_In_1) (+ v_~q1~0.offset_In_1 (* v_~q1_back~0_In_1 4))) 0) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_In_1, ~q1_back~0=v_~q1_back~0_In_1, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, ~n1~0=v_~n1~0_In_1, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, ~N~0=v_~N~0_In_1} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_2|, ~q1~0.offset=v_~q1~0.offset_In_1, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_2|, ~n1~0=v_~n1~0_In_1, ~N~0=v_~N~0_In_1, ~q1_back~0=v_~q1_back~0_Out_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [844] L119-3-->L120-3: Formula: (and (= |v_#pthreadsForks_81| |v_ULTIMATE.start_main_#t~pre21#1_43|) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre21#1_43|)) |v_#memory_int_211|) (= |v_#pthreadsForks_80| (+ |v_#pthreadsForks_81| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_43|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_33|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-13 04:43:09,155 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:43:09,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 04:43:09,156 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 135 transitions, 5113 flow [2022-12-13 04:43:09,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 04:43:09,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:09,157 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:09,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 04:43:09,157 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:09,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:09,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1490682921, now seen corresponding path program 1 times [2022-12-13 04:43:09,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:09,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038901630] [2022-12-13 04:43:09,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:09,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:43:10,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:10,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038901630] [2022-12-13 04:43:10,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038901630] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:43:10,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222840809] [2022-12-13 04:43:10,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:10,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:43:10,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:43:10,269 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:43:10,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 04:43:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:10,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-13 04:43:10,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:43:10,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 04:43:10,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:43:10,488 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 04:43:10,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 300 treesize of output 290 [2022-12-13 04:43:10,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:43:10,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:43:10,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 04:43:10,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2022-12-13 04:43:11,098 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 04:43:11,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 18 [2022-12-13 04:43:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:43:11,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:43:11,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222840809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:11,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 04:43:11,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2022-12-13 04:43:11,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700371823] [2022-12-13 04:43:11,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:11,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:43:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:11,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:43:11,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-12-13 04:43:11,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-13 04:43:11,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 135 transitions, 5113 flow. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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 04:43:11,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:11,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-13 04:43:11,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:11,588 INFO L130 PetriNetUnfolder]: 714/1135 cut-off events. [2022-12-13 04:43:11,589 INFO L131 PetriNetUnfolder]: For 1453/1453 co-relation queries the response was YES. [2022-12-13 04:43:11,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22512 conditions, 1135 events. 714/1135 cut-off events. For 1453/1453 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4708 event pairs, 48 based on Foata normal form. 1/803 useless extension candidates. Maximal degree in co-relation 13250. Up to 1128 conditions per place. [2022-12-13 04:43:11,601 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 125 selfloop transitions, 6 changer transitions 19/153 dead transitions. [2022-12-13 04:43:11,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 153 transitions, 6117 flow [2022-12-13 04:43:11,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:43:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:43:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-13 04:43:11,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 04:43:11,604 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2022-12-13 04:43:11,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 153 transitions, 6117 flow [2022-12-13 04:43:11,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 134 transitions, 5371 flow [2022-12-13 04:43:11,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:11,629 INFO L89 Accepts]: Start accepts. Operand has 65 places, 134 transitions, 5371 flow [2022-12-13 04:43:11,635 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:11,635 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:11,635 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 134 transitions, 5371 flow [2022-12-13 04:43:11,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 134 transitions, 5371 flow [2022-12-13 04:43:11,639 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:43:11,641 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L47-4-->thread1EXIT: Formula: (and (not (= (ite (and (<= 0 v_~q1_back~0_In_1) (< v_~q1_back~0_In_1 v_~n1~0_In_1)) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_2| 0) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= (+ v_~q1_back~0_In_1 1) v_~q1_back~0_Out_2) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_1| v_~N~0_In_1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (= (select (select |v_#memory_int_In_3| v_~q1~0.base_In_1) (+ v_~q1~0.offset_In_1 (* v_~q1_back~0_In_1 4))) 0) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_In_1, ~q1_back~0=v_~q1_back~0_In_1, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, ~n1~0=v_~n1~0_In_1, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, ~N~0=v_~N~0_In_1} OutVars{thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_Out_2|, ~q1~0.offset=v_~q1~0.offset_In_1, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_Out_2|, ~n1~0=v_~n1~0_In_1, ~N~0=v_~N~0_In_1, ~q1_back~0=v_~q1_back~0_Out_2, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, ~q1~0.base=v_~q1~0.base_In_1, #memory_int=|v_#memory_int_In_3|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_2|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_2|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~mem4#1, ~q1_back~0, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [844] L119-3-->L120-3: Formula: (and (= |v_#pthreadsForks_81| |v_ULTIMATE.start_main_#t~pre21#1_43|) (= (store |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33| (store (select |v_#memory_int_212| |v_ULTIMATE.start_main_~#t2~0#1.base_33|) |v_ULTIMATE.start_main_~#t2~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre21#1_43|)) |v_#memory_int_211|) (= |v_#pthreadsForks_80| (+ |v_#pthreadsForks_81| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, #memory_int=|v_#memory_int_212|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|} OutVars{#pthreadsForks=|v_#pthreadsForks_80|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_21|, #memory_int=|v_#memory_int_211|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_43|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_33|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_33|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~nondet20#1, #memory_int, ULTIMATE.start_main_#t~pre21#1, ULTIMATE.start_main_#t~pre19#1] [2022-12-13 04:43:11,761 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:43:11,761 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 04:43:11,762 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 133 transitions, 5333 flow [2022-12-13 04:43:11,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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 04:43:11,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:11,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:11,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 04:43:11,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:43:11,962 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:11,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:11,963 INFO L85 PathProgramCache]: Analyzing trace with hash -583426440, now seen corresponding path program 1 times [2022-12-13 04:43:11,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:11,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160403693] [2022-12-13 04:43:11,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:11,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:13,567 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 04:43:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:13,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160403693] [2022-12-13 04:43:13,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160403693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:13,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:13,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:43:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193834745] [2022-12-13 04:43:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:13,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:43:13,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:43:13,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:43:13,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 04:43:13,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 133 transitions, 5333 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:43:13,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:13,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 04:43:13,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:14,228 INFO L130 PetriNetUnfolder]: 732/1168 cut-off events. [2022-12-13 04:43:14,229 INFO L131 PetriNetUnfolder]: For 1409/1409 co-relation queries the response was YES. [2022-12-13 04:43:14,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24260 conditions, 1168 events. 732/1168 cut-off events. For 1409/1409 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4892 event pairs, 53 based on Foata normal form. 1/830 useless extension candidates. Maximal degree in co-relation 13916. Up to 1159 conditions per place. [2022-12-13 04:43:14,279 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 130 selfloop transitions, 7 changer transitions 23/162 dead transitions. [2022-12-13 04:43:14,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 162 transitions, 6826 flow [2022-12-13 04:43:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:43:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:43:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-13 04:43:14,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3619047619047619 [2022-12-13 04:43:14,283 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2022-12-13 04:43:14,283 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 162 transitions, 6826 flow [2022-12-13 04:43:14,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 139 transitions, 5830 flow [2022-12-13 04:43:14,309 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:14,310 INFO L89 Accepts]: Start accepts. Operand has 69 places, 139 transitions, 5830 flow [2022-12-13 04:43:14,314 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:14,314 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:14,314 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 139 transitions, 5830 flow [2022-12-13 04:43:14,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 139 transitions, 5830 flow [2022-12-13 04:43:14,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:43:14,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:43:14,421 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L65-2-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_19| (select (select |v_#memory_int_91| v_~q1~0.base_44) (+ v_~q1~0.offset_44 (* 4 v_~q1_front~0_45)))) (= (+ v_~q1_front~0_45 1) v_~q1_front~0_44) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~q1_front~0_45) (< v_~q1_front~0_45 v_~q1_back~0_94) (< v_~q1_front~0_45 v_~n1~0_39)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|)) InVars {~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_45, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, #memory_int=|v_#memory_int_91|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_19|, ~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_44, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_7|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:43:14,601 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:43:14,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 293 [2022-12-13 04:43:14,602 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 137 transitions, 5750 flow [2022-12-13 04:43:14,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:43:14,603 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:14,603 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:14,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 04:43:14,603 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:14,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1206261753, now seen corresponding path program 1 times [2022-12-13 04:43:14,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:14,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244601080] [2022-12-13 04:43:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:14,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:15,845 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 04:43:15,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:15,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244601080] [2022-12-13 04:43:15,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244601080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:15,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:15,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:43:15,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252810326] [2022-12-13 04:43:15,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:15,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:43:15,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:15,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:43:15,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:43:15,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 04:43:15,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 137 transitions, 5750 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:43:15,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:15,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 04:43:15,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:16,363 INFO L130 PetriNetUnfolder]: 712/1139 cut-off events. [2022-12-13 04:43:16,363 INFO L131 PetriNetUnfolder]: For 2241/2241 co-relation queries the response was YES. [2022-12-13 04:43:16,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24829 conditions, 1139 events. 712/1139 cut-off events. For 2241/2241 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4741 event pairs, 67 based on Foata normal form. 1/804 useless extension candidates. Maximal degree in co-relation 14582. Up to 1130 conditions per place. [2022-12-13 04:43:16,376 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 129 selfloop transitions, 5 changer transitions 20/156 dead transitions. [2022-12-13 04:43:16,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 156 transitions, 6880 flow [2022-12-13 04:43:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:43:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:43:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-12-13 04:43:16,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2890625 [2022-12-13 04:43:16,378 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2022-12-13 04:43:16,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 156 transitions, 6880 flow [2022-12-13 04:43:16,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 136 transitions, 5974 flow [2022-12-13 04:43:16,402 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:16,402 INFO L89 Accepts]: Start accepts. Operand has 71 places, 136 transitions, 5974 flow [2022-12-13 04:43:16,406 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:16,406 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:16,406 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 136 transitions, 5974 flow [2022-12-13 04:43:16,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 136 transitions, 5974 flow [2022-12-13 04:43:16,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:43:16,410 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:43:16,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 04:43:16,411 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 136 transitions, 5974 flow [2022-12-13 04:43:16,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:43:16,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:16,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:16,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 04:43:16,412 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1905861092, now seen corresponding path program 1 times [2022-12-13 04:43:16,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:16,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726519793] [2022-12-13 04:43:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:16,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:17,377 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 04:43:17,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:17,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726519793] [2022-12-13 04:43:17,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726519793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:17,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:17,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:43:17,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611897383] [2022-12-13 04:43:17,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:17,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:43:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:17,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:43:17,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:43:17,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 04:43:17,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 136 transitions, 5974 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:43:17,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:17,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 04:43:17,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:17,885 INFO L130 PetriNetUnfolder]: 716/1139 cut-off events. [2022-12-13 04:43:17,886 INFO L131 PetriNetUnfolder]: For 1829/1829 co-relation queries the response was YES. [2022-12-13 04:43:17,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25978 conditions, 1139 events. 716/1139 cut-off events. For 1829/1829 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4736 event pairs, 48 based on Foata normal form. 1/801 useless extension candidates. Maximal degree in co-relation 15234. Up to 1132 conditions per place. [2022-12-13 04:43:17,898 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 124 selfloop transitions, 3 changer transitions 20/150 dead transitions. [2022-12-13 04:43:17,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 150 transitions, 6900 flow [2022-12-13 04:43:17,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:43:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:43:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 04:43:17,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2022-12-13 04:43:17,901 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 45 predicate places. [2022-12-13 04:43:17,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 150 transitions, 6900 flow [2022-12-13 04:43:17,914 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 130 transitions, 5974 flow [2022-12-13 04:43:17,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:17,926 INFO L89 Accepts]: Start accepts. Operand has 72 places, 130 transitions, 5974 flow [2022-12-13 04:43:17,930 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:17,930 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:17,930 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 130 transitions, 5974 flow [2022-12-13 04:43:17,933 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 130 transitions, 5974 flow [2022-12-13 04:43:17,933 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:43:20,348 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:43:20,348 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2422 [2022-12-13 04:43:20,348 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 129 transitions, 5928 flow [2022-12-13 04:43:20,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:43:20,349 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:20,349 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:20,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 04:43:20,349 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:20,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:20,349 INFO L85 PathProgramCache]: Analyzing trace with hash -69587121, now seen corresponding path program 1 times [2022-12-13 04:43:20,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:20,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049440564] [2022-12-13 04:43:20,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:20,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:21,744 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 04:43:21,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:21,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049440564] [2022-12-13 04:43:21,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049440564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:21,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:21,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:43:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587031823] [2022-12-13 04:43:21,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:21,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:43:21,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:21,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:43:21,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:43:21,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:43:21,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 129 transitions, 5928 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:43:21,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:21,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:43:21,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:22,296 INFO L130 PetriNetUnfolder]: 729/1170 cut-off events. [2022-12-13 04:43:22,296 INFO L131 PetriNetUnfolder]: For 2113/2113 co-relation queries the response was YES. [2022-12-13 04:43:22,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27761 conditions, 1170 events. 729/1170 cut-off events. For 2113/2113 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4959 event pairs, 53 based on Foata normal form. 1/833 useless extension candidates. Maximal degree in co-relation 15900. Up to 1161 conditions per place. [2022-12-13 04:43:22,306 INFO L137 encePairwiseOnDemand]: 16/29 looper letters, 127 selfloop transitions, 9 changer transitions 24/162 dead transitions. [2022-12-13 04:43:22,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 162 transitions, 7782 flow [2022-12-13 04:43:22,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:43:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:43:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 04:43:22,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 04:43:22,309 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 43 predicate places. [2022-12-13 04:43:22,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 162 transitions, 7782 flow [2022-12-13 04:43:22,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 138 transitions, 6600 flow [2022-12-13 04:43:22,335 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:22,336 INFO L89 Accepts]: Start accepts. Operand has 74 places, 138 transitions, 6600 flow [2022-12-13 04:43:22,339 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:22,339 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:22,339 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 138 transitions, 6600 flow [2022-12-13 04:43:22,342 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 138 transitions, 6600 flow [2022-12-13 04:43:22,342 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:43:22,344 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:43:22,548 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:43:22,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-13 04:43:22,549 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 136 transitions, 6506 flow [2022-12-13 04:43:22,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:43:22,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:22,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:22,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 04:43:22,549 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:22,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1401016566, now seen corresponding path program 1 times [2022-12-13 04:43:22,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:22,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589792296] [2022-12-13 04:43:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:22,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:23,856 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 04:43:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589792296] [2022-12-13 04:43:23,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589792296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:23,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:23,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:43:23,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767814365] [2022-12-13 04:43:23,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:23,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:43:23,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:23,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:43:23,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:43:23,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-13 04:43:23,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 136 transitions, 6506 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:43:23,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:23,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-13 04:43:23,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:24,363 INFO L130 PetriNetUnfolder]: 717/1134 cut-off events. [2022-12-13 04:43:24,364 INFO L131 PetriNetUnfolder]: For 2683/2683 co-relation queries the response was YES. [2022-12-13 04:43:24,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28094 conditions, 1134 events. 717/1134 cut-off events. For 2683/2683 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4662 event pairs, 48 based on Foata normal form. 1/796 useless extension candidates. Maximal degree in co-relation 16552. Up to 1127 conditions per place. [2022-12-13 04:43:24,373 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 122 selfloop transitions, 5 changer transitions 20/150 dead transitions. [2022-12-13 04:43:24,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 150 transitions, 7488 flow [2022-12-13 04:43:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:43:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:43:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 04:43:24,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 04:43:24,375 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2022-12-13 04:43:24,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 150 transitions, 7488 flow [2022-12-13 04:43:24,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 130 transitions, 6484 flow [2022-12-13 04:43:24,402 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:24,402 INFO L89 Accepts]: Start accepts. Operand has 74 places, 130 transitions, 6484 flow [2022-12-13 04:43:24,406 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:24,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:24,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 130 transitions, 6484 flow [2022-12-13 04:43:24,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 130 transitions, 6484 flow [2022-12-13 04:43:24,410 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:43:27,889 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:43:27,890 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3488 [2022-12-13 04:43:27,890 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 129 transitions, 6434 flow [2022-12-13 04:43:27,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:43:27,890 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:27,890 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:27,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 04:43:27,891 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:27,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:27,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1677077076, now seen corresponding path program 1 times [2022-12-13 04:43:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:27,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404095055] [2022-12-13 04:43:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:30,368 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 04:43:30,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:30,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404095055] [2022-12-13 04:43:30,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404095055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:30,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:30,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:43:30,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752354716] [2022-12-13 04:43:30,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:30,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:43:30,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:30,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:43:30,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:43:30,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:43:30,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 129 transitions, 6434 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:43:30,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:30,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:43:30,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:30,970 INFO L130 PetriNetUnfolder]: 731/1173 cut-off events. [2022-12-13 04:43:30,970 INFO L131 PetriNetUnfolder]: For 2000/2000 co-relation queries the response was YES. [2022-12-13 04:43:30,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30135 conditions, 1173 events. 731/1173 cut-off events. For 2000/2000 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4999 event pairs, 53 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 17218. Up to 1164 conditions per place. [2022-12-13 04:43:30,985 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 130 selfloop transitions, 7 changer transitions 23/162 dead transitions. [2022-12-13 04:43:30,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 162 transitions, 8418 flow [2022-12-13 04:43:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:43:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:43:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-13 04:43:30,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37438423645320196 [2022-12-13 04:43:30,986 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2022-12-13 04:43:30,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 162 transitions, 8418 flow [2022-12-13 04:43:31,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 139 transitions, 7192 flow [2022-12-13 04:43:31,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:31,017 INFO L89 Accepts]: Start accepts. Operand has 77 places, 139 transitions, 7192 flow [2022-12-13 04:43:31,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:31,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:31,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 139 transitions, 7192 flow [2022-12-13 04:43:31,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 139 transitions, 7192 flow [2022-12-13 04:43:31,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:43:31,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:43:31,137 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L65-2-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_19| (select (select |v_#memory_int_91| v_~q1~0.base_44) (+ v_~q1~0.offset_44 (* 4 v_~q1_front~0_45)))) (= (+ v_~q1_front~0_45 1) v_~q1_front~0_44) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~q1_front~0_45) (< v_~q1_front~0_45 v_~q1_back~0_94) (< v_~q1_front~0_45 v_~n1~0_39)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|)) InVars {~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_45, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, #memory_int=|v_#memory_int_91|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_19|, ~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_44, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_7|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:43:31,332 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:43:31,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 315 [2022-12-13 04:43:31,333 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 137 transitions, 7092 flow [2022-12-13 04:43:31,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:43:31,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:31,333 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:31,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 04:43:31,333 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1376830690, now seen corresponding path program 1 times [2022-12-13 04:43:31,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:31,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906322804] [2022-12-13 04:43:31,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:31,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:32,752 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 04:43:32,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906322804] [2022-12-13 04:43:32,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906322804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:32,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:32,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:43:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257940619] [2022-12-13 04:43:32,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:32,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:43:32,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:32,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:43:32,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:43:32,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-13 04:43:32,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 137 transitions, 7092 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:43:32,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:32,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-13 04:43:32,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:33,187 INFO L130 PetriNetUnfolder]: 721/1150 cut-off events. [2022-12-13 04:43:33,187 INFO L131 PetriNetUnfolder]: For 2331/2331 co-relation queries the response was YES. [2022-12-13 04:43:33,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30760 conditions, 1150 events. 721/1150 cut-off events. For 2331/2331 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4817 event pairs, 48 based on Foata normal form. 1/811 useless extension candidates. Maximal degree in co-relation 17884. Up to 1142 conditions per place. [2022-12-13 04:43:33,200 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 126 selfloop transitions, 2 changer transitions 26/156 dead transitions. [2022-12-13 04:43:33,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 156 transitions, 8412 flow [2022-12-13 04:43:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:43:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:43:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 04:43:33,201 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2022-12-13 04:43:33,202 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2022-12-13 04:43:33,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 156 transitions, 8412 flow [2022-12-13 04:43:33,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 130 transitions, 6996 flow [2022-12-13 04:43:33,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:33,222 INFO L89 Accepts]: Start accepts. Operand has 76 places, 130 transitions, 6996 flow [2022-12-13 04:43:33,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:33,226 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:33,226 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 130 transitions, 6996 flow [2022-12-13 04:43:33,229 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 130 transitions, 6996 flow [2022-12-13 04:43:33,229 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:43:36,968 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:43:36,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3747 [2022-12-13 04:43:36,969 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 129 transitions, 6942 flow [2022-12-13 04:43:36,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:43:36,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:36,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:36,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 04:43:36,969 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:36,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:36,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1363610600, now seen corresponding path program 1 times [2022-12-13 04:43:36,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:36,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365360061] [2022-12-13 04:43:36,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:36,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:39,386 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 04:43:39,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:39,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365360061] [2022-12-13 04:43:39,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365360061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:39,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:39,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:43:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154960515] [2022-12-13 04:43:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:39,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:43:39,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:39,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:43:39,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:43:39,387 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:43:39,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 129 transitions, 6942 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:43:39,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:39,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:43:39,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:39,937 INFO L130 PetriNetUnfolder]: 731/1173 cut-off events. [2022-12-13 04:43:39,937 INFO L131 PetriNetUnfolder]: For 2716/2716 co-relation queries the response was YES. [2022-12-13 04:43:39,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32463 conditions, 1173 events. 731/1173 cut-off events. For 2716/2716 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4968 event pairs, 53 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 18550. Up to 1164 conditions per place. [2022-12-13 04:43:39,948 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 129 selfloop transitions, 8 changer transitions 23/162 dead transitions. [2022-12-13 04:43:39,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 162 transitions, 9058 flow [2022-12-13 04:43:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:43:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:43:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 04:43:39,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 04:43:39,949 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2022-12-13 04:43:39,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 162 transitions, 9058 flow [2022-12-13 04:43:39,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 139 transitions, 7740 flow [2022-12-13 04:43:39,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:39,978 INFO L89 Accepts]: Start accepts. Operand has 80 places, 139 transitions, 7740 flow [2022-12-13 04:43:39,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:39,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:39,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 139 transitions, 7740 flow [2022-12-13 04:43:39,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 139 transitions, 7740 flow [2022-12-13 04:43:39,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:43:39,987 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:43:40,073 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L65-2-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_19| (select (select |v_#memory_int_91| v_~q1~0.base_44) (+ v_~q1~0.offset_44 (* 4 v_~q1_front~0_45)))) (= (+ v_~q1_front~0_45 1) v_~q1_front~0_44) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~q1_front~0_45) (< v_~q1_front~0_45 v_~q1_back~0_94) (< v_~q1_front~0_45 v_~n1~0_39)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|)) InVars {~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_45, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, #memory_int=|v_#memory_int_91|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_19|, ~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_44, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_7|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:43:40,238 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:43:40,239 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 262 [2022-12-13 04:43:40,239 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 137 transitions, 7632 flow [2022-12-13 04:43:40,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:43:40,239 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:40,239 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:40,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 04:43:40,240 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash 56579998, now seen corresponding path program 1 times [2022-12-13 04:43:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:40,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707958562] [2022-12-13 04:43:40,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:41,335 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 04:43:41,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:41,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707958562] [2022-12-13 04:43:41,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707958562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:41,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:41,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:43:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838198896] [2022-12-13 04:43:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:41,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:43:41,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:41,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:43:41,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:43:41,336 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-13 04:43:41,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 137 transitions, 7632 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:43:41,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:41,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-13 04:43:41,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:41,966 INFO L130 PetriNetUnfolder]: 767/1221 cut-off events. [2022-12-13 04:43:41,966 INFO L131 PetriNetUnfolder]: For 2943/2943 co-relation queries the response was YES. [2022-12-13 04:43:41,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35085 conditions, 1221 events. 767/1221 cut-off events. For 2943/2943 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5252 event pairs, 52 based on Foata normal form. 1/859 useless extension candidates. Maximal degree in co-relation 19216. Up to 1212 conditions per place. [2022-12-13 04:43:41,981 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 143 selfloop transitions, 14 changer transitions 6/165 dead transitions. [2022-12-13 04:43:41,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 165 transitions, 9550 flow [2022-12-13 04:43:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:43:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:43:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 04:43:41,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2022-12-13 04:43:41,984 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 53 predicate places. [2022-12-13 04:43:41,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 165 transitions, 9550 flow [2022-12-13 04:43:41,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 159 transitions, 9193 flow [2022-12-13 04:43:42,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:42,010 INFO L89 Accepts]: Start accepts. Operand has 85 places, 159 transitions, 9193 flow [2022-12-13 04:43:42,014 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:42,014 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:42,015 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 159 transitions, 9193 flow [2022-12-13 04:43:42,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 159 transitions, 9193 flow [2022-12-13 04:43:42,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-13 04:43:42,248 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:43:42,249 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-13 04:43:42,249 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 158 transitions, 9135 flow [2022-12-13 04:43:42,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:43:42,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:42,249 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:42,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 04:43:42,250 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:42,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1520735703, now seen corresponding path program 1 times [2022-12-13 04:43:42,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:42,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048590473] [2022-12-13 04:43:42,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:42,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:43,224 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 04:43:43,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:43,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048590473] [2022-12-13 04:43:43,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048590473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:43,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:43,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:43:43,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006462909] [2022-12-13 04:43:43,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:43,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:43:43,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:43,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:43:43,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:43:43,225 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-13 04:43:43,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 158 transitions, 9135 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:43:43,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:43,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-13 04:43:43,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:43,729 INFO L130 PetriNetUnfolder]: 774/1236 cut-off events. [2022-12-13 04:43:43,729 INFO L131 PetriNetUnfolder]: For 3412/3412 co-relation queries the response was YES. [2022-12-13 04:43:43,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36718 conditions, 1236 events. 774/1236 cut-off events. For 3412/3412 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5301 event pairs, 48 based on Foata normal form. 1/874 useless extension candidates. Maximal degree in co-relation 19868. Up to 1227 conditions per place. [2022-12-13 04:43:43,740 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 150 selfloop transitions, 10 changer transitions 15/179 dead transitions. [2022-12-13 04:43:43,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 179 transitions, 10729 flow [2022-12-13 04:43:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:43:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:43:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-13 04:43:43,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.329004329004329 [2022-12-13 04:43:43,742 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2022-12-13 04:43:43,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 179 transitions, 10729 flow [2022-12-13 04:43:43,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 164 transitions, 9809 flow [2022-12-13 04:43:43,772 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:43,773 INFO L89 Accepts]: Start accepts. Operand has 88 places, 164 transitions, 9809 flow [2022-12-13 04:43:43,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:43,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:43,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 164 transitions, 9809 flow [2022-12-13 04:43:43,784 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 164 transitions, 9809 flow [2022-12-13 04:43:43,784 INFO L226 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-13 04:43:43,785 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:43:43,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 04:43:43,786 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 164 transitions, 9809 flow [2022-12-13 04:43:43,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:43:43,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:43,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:43,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 04:43:43,786 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:43,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash -806765308, now seen corresponding path program 1 times [2022-12-13 04:43:43,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:43,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516780999] [2022-12-13 04:43:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:43,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:43:45,252 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 04:43:45,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:43:45,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516780999] [2022-12-13 04:43:45,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516780999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:43:45,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:43:45,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:43:45,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245627119] [2022-12-13 04:43:45,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:43:45,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:43:45,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:43:45,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:43:45,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:43:45,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 04:43:45,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 164 transitions, 9809 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:43:45,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:43:45,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 04:43:45,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:43:45,794 INFO L130 PetriNetUnfolder]: 730/1184 cut-off events. [2022-12-13 04:43:45,794 INFO L131 PetriNetUnfolder]: For 4197/4197 co-relation queries the response was YES. [2022-12-13 04:43:45,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36206 conditions, 1184 events. 730/1184 cut-off events. For 4197/4197 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5080 event pairs, 53 based on Foata normal form. 6/850 useless extension candidates. Maximal degree in co-relation 20534. Up to 1173 conditions per place. [2022-12-13 04:43:45,810 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 129 selfloop transitions, 9 changer transitions 35/175 dead transitions. [2022-12-13 04:43:45,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 175 transitions, 10810 flow [2022-12-13 04:43:45,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:43:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:43:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-13 04:43:45,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.328125 [2022-12-13 04:43:45,812 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 61 predicate places. [2022-12-13 04:43:45,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 175 transitions, 10810 flow [2022-12-13 04:43:45,854 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 140 transitions, 8620 flow [2022-12-13 04:43:45,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:43:45,867 INFO L89 Accepts]: Start accepts. Operand has 89 places, 140 transitions, 8620 flow [2022-12-13 04:43:45,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:43:45,871 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:43:45,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 140 transitions, 8620 flow [2022-12-13 04:43:45,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 140 transitions, 8620 flow [2022-12-13 04:43:45,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-13 04:43:58,849 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [905] L65-2-->thread2EXIT: Formula: (and (= (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_79| (+ (select (select |v_#memory_int_390| v_~q2~0.base_149) (+ v_~q2~0.offset_149 (* 4 v_~q2_back~0_208))) 1)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (= (+ v_~q2_back~0_208 1) v_~q2_back~0_207) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_45| 0) (= v_~q1_front~0_163 (+ v_~q1_front~0_164 1)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|) (= (select (select |v_#memory_int_390| v_~q1~0.base_140) (+ v_~q1~0.offset_140 (* v_~q1_front~0_164 4))) |v_thread2Thread1of1ForFork0_~j~0#1_79|) (not (= (ite (and (<= 0 v_~q2_back~0_208) (< v_~q2_back~0_208 v_~n2~0_140)) 1 0) 0)) (not (= (ite (and (< v_~q1_front~0_164 v_~q1_back~0_230) (< v_~q1_front~0_164 v_~n1~0_161) (<= 0 v_~q1_front~0_164)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_45| 0) (<= |v_thread2Thread1of1ForFork0_~j~0#1_79| 0) (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_79| v_~s~0_143) v_~s~0_142)) InVars {~q1~0.offset=v_~q1~0.offset_140, ~n2~0=v_~n2~0_140, ~q1_front~0=v_~q1_front~0_164, ~q1_back~0=v_~q1_back~0_230, ~q2~0.offset=v_~q2~0.offset_149, ~n1~0=v_~n1~0_161, ~q1~0.base=v_~q1~0.base_140, #memory_int=|v_#memory_int_390|, ~q2~0.base=v_~q2~0.base_149, ~q2_back~0=v_~q2_back~0_208, ~s~0=v_~s~0_143} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_79|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_47|, ~q1~0.offset=v_~q1~0.offset_140, ~n2~0=v_~n2~0_140, ~q1_front~0=v_~q1_front~0_163, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_45|, ~q2~0.offset=v_~q2~0.offset_149, ~n1~0=v_~n1~0_161, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_77|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_35|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_35|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_47|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_77|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_45|, ~q1_back~0=v_~q1_back~0_230, ~q1~0.base=v_~q1~0.base_140, #memory_int=|v_#memory_int_390|, ~q2~0.base=v_~q2~0.base_149, ~q2_back~0=v_~q2_back~0_207, ~s~0=v_~s~0_142} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:43:58,961 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 04:43:58,962 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13095 [2022-12-13 04:43:58,962 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 137 transitions, 8436 flow [2022-12-13 04:43:58,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:43:58,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:43:58,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:43:58,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 04:43:58,963 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:43:58,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:43:58,963 INFO L85 PathProgramCache]: Analyzing trace with hash -800007621, now seen corresponding path program 1 times [2022-12-13 04:43:58,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:43:58,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118322643] [2022-12-13 04:43:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:43:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:43:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:44:00,514 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 04:44:00,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:44:00,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118322643] [2022-12-13 04:44:00,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118322643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:44:00,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:44:00,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:44:00,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217282801] [2022-12-13 04:44:00,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:44:00,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:44:00,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:44:00,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:44:00,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:44:00,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 04:44:00,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 137 transitions, 8436 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 04:44:00,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:44:00,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 04:44:00,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:44:00,817 INFO L130 PetriNetUnfolder]: 717/1140 cut-off events. [2022-12-13 04:44:00,817 INFO L131 PetriNetUnfolder]: For 3164/3164 co-relation queries the response was YES. [2022-12-13 04:44:00,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36135 conditions, 1140 events. 717/1140 cut-off events. For 3164/3164 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4740 event pairs, 48 based on Foata normal form. 1/801 useless extension candidates. Maximal degree in co-relation 21186. Up to 1133 conditions per place. [2022-12-13 04:44:00,829 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 125 selfloop transitions, 3 changer transitions 20/151 dead transitions. [2022-12-13 04:44:00,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 151 transitions, 9616 flow [2022-12-13 04:44:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:44:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:44:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 04:44:00,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 04:44:00,831 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2022-12-13 04:44:00,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 151 transitions, 9616 flow [2022-12-13 04:44:00,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 131 transitions, 8336 flow [2022-12-13 04:44:00,860 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:44:00,860 INFO L89 Accepts]: Start accepts. Operand has 83 places, 131 transitions, 8336 flow [2022-12-13 04:44:00,865 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:44:00,865 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:44:00,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 131 transitions, 8336 flow [2022-12-13 04:44:00,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 131 transitions, 8336 flow [2022-12-13 04:44:00,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:44:06,415 WARN L233 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 229 DAG size of output: 226 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:44:21,468 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:44:21,469 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20609 [2022-12-13 04:44:21,469 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 130 transitions, 8272 flow [2022-12-13 04:44:21,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 04:44:21,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:44:21,469 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:44:21,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 04:44:21,469 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:44:21,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:44:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash -555694711, now seen corresponding path program 1 times [2022-12-13 04:44:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:44:21,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335354139] [2022-12-13 04:44:21,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:44:21,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:44:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:44:22,792 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 04:44:22,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:44:22,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335354139] [2022-12-13 04:44:22,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335354139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:44:22,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:44:22,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:44:22,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437010653] [2022-12-13 04:44:22,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:44:22,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:44:22,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:44:22,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:44:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:44:22,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 04:44:22,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 130 transitions, 8272 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:44:22,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:44:22,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 04:44:22,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:44:23,116 INFO L130 PetriNetUnfolder]: 729/1169 cut-off events. [2022-12-13 04:44:23,116 INFO L131 PetriNetUnfolder]: For 3387/3387 co-relation queries the response was YES. [2022-12-13 04:44:23,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38099 conditions, 1169 events. 729/1169 cut-off events. For 3387/3387 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4942 event pairs, 53 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 21852. Up to 1160 conditions per place. [2022-12-13 04:44:23,129 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 128 selfloop transitions, 7 changer transitions 24/161 dead transitions. [2022-12-13 04:44:23,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 161 transitions, 10584 flow [2022-12-13 04:44:23,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:44:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:44:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-13 04:44:23,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 04:44:23,130 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2022-12-13 04:44:23,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 161 transitions, 10584 flow [2022-12-13 04:44:23,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 137 transitions, 8970 flow [2022-12-13 04:44:23,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:44:23,155 INFO L89 Accepts]: Start accepts. Operand has 87 places, 137 transitions, 8970 flow [2022-12-13 04:44:23,160 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:44:23,160 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:44:23,160 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 137 transitions, 8970 flow [2022-12-13 04:44:23,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 137 transitions, 8970 flow [2022-12-13 04:44:23,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:44:23,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [909] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_49| 0) (= v_~s~0_154 (+ |v_thread2Thread1of1ForFork0_~j~0#1_83| v_~s~0_155)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_83| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_49| 0) (not (= (ite (and (<= 0 v_~q2_back~0_220) (< v_~q2_back~0_220 v_~n2~0_148)) 1 0) 0)) (= (+ v_~q2_back~0_220 1) v_~q2_back~0_219) (<= |v_thread2Thread1of1ForFork0_~j~0#1_83| 0) (= (+ v_~q1_front~0_176 1) v_~q1_front~0_175) (not (= (ite (and (<= 0 v_~q1_front~0_176) (< v_~q1_front~0_176 v_~q1_back~0_238) (< v_~q1_front~0_176 v_~n1~0_169)) 1 0) 0)) (= (select (select |v_#memory_int_408| v_~q1~0.base_148) (+ v_~q1~0.offset_148 (* v_~q1_front~0_176 4))) |v_thread2Thread1of1ForFork0_~j~0#1_83|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83| (ite (= (+ (select (select |v_#memory_int_408| v_~q2~0.base_159) (+ v_~q2~0.offset_159 (* 4 v_~q2_back~0_220))) 1) |v_thread2Thread1of1ForFork0_~j~0#1_83|) 1 0))) InVars {~q1~0.offset=v_~q1~0.offset_148, ~n2~0=v_~n2~0_148, ~q1_front~0=v_~q1_front~0_176, ~q1_back~0=v_~q1_back~0_238, ~q2~0.offset=v_~q2~0.offset_159, ~n1~0=v_~n1~0_169, ~q1~0.base=v_~q1~0.base_148, #memory_int=|v_#memory_int_408|, ~q2~0.base=v_~q2~0.base_159, ~q2_back~0=v_~q2_back~0_220, ~s~0=v_~s~0_155} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_83|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_51|, ~q1~0.offset=v_~q1~0.offset_148, ~n2~0=v_~n2~0_148, ~q1_front~0=v_~q1_front~0_175, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_49|, ~q2~0.offset=v_~q2~0.offset_159, ~n1~0=v_~n1~0_169, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_39|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_39|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_51|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_83|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_49|, ~q1_back~0=v_~q1_back~0_238, ~q1~0.base=v_~q1~0.base_148, #memory_int=|v_#memory_int_408|, ~q2~0.base=v_~q2~0.base_159, ~q2_back~0=v_~q2_back~0_219, ~s~0=v_~s~0_154} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:44:23,380 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:44:23,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-13 04:44:23,380 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 135 transitions, 8840 flow [2022-12-13 04:44:23,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:44:23,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:44:23,381 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:44:23,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 04:44:23,381 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:44:23,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:44:23,381 INFO L85 PathProgramCache]: Analyzing trace with hash 367083330, now seen corresponding path program 1 times [2022-12-13 04:44:23,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:44:23,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671069575] [2022-12-13 04:44:23,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:44:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:44:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:44:24,475 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 04:44:24,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:44:24,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671069575] [2022-12-13 04:44:24,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671069575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:44:24,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:44:24,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:44:24,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758737706] [2022-12-13 04:44:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:44:24,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:44:24,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:44:24,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:44:24,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:44:24,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 04:44:24,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 135 transitions, 8840 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 04:44:24,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:44:24,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 04:44:24,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:44:24,902 INFO L130 PetriNetUnfolder]: 716/1138 cut-off events. [2022-12-13 04:44:24,902 INFO L131 PetriNetUnfolder]: For 4423/4423 co-relation queries the response was YES. [2022-12-13 04:44:24,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38312 conditions, 1138 events. 716/1138 cut-off events. For 4423/4423 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4731 event pairs, 48 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 22504. Up to 1131 conditions per place. [2022-12-13 04:44:24,914 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 124 selfloop transitions, 2 changer transitions 20/149 dead transitions. [2022-12-13 04:44:24,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 149 transitions, 10072 flow [2022-12-13 04:44:24,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:44:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:44:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 04:44:24,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 04:44:24,915 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2022-12-13 04:44:24,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 149 transitions, 10072 flow [2022-12-13 04:44:24,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 129 transitions, 8714 flow [2022-12-13 04:44:24,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:44:24,939 INFO L89 Accepts]: Start accepts. Operand has 86 places, 129 transitions, 8714 flow [2022-12-13 04:44:24,944 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:44:24,944 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:44:24,944 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 129 transitions, 8714 flow [2022-12-13 04:44:24,947 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 129 transitions, 8714 flow [2022-12-13 04:44:24,947 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:44:24,948 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:44:24,948 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 04:44:24,948 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 129 transitions, 8714 flow [2022-12-13 04:44:24,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 04:44:24,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:44:24,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:44:24,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 04:44:24,949 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:44:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:44:24,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1987590599, now seen corresponding path program 1 times [2022-12-13 04:44:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:44:24,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075013184] [2022-12-13 04:44:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:44:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:44:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:44:27,432 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 04:44:27,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:44:27,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075013184] [2022-12-13 04:44:27,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075013184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:44:27,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:44:27,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:44:27,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685337471] [2022-12-13 04:44:27,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:44:27,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:44:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:44:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:44:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:44:27,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:44:27,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 129 transitions, 8714 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:44:27,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:44:27,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:44:27,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:44:28,108 INFO L130 PetriNetUnfolder]: 733/1170 cut-off events. [2022-12-13 04:44:28,109 INFO L131 PetriNetUnfolder]: For 3245/3245 co-relation queries the response was YES. [2022-12-13 04:44:28,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40426 conditions, 1170 events. 733/1170 cut-off events. For 3245/3245 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4935 event pairs, 53 based on Foata normal form. 1/831 useless extension candidates. Maximal degree in co-relation 23170. Up to 1161 conditions per place. [2022-12-13 04:44:28,123 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 130 selfloop transitions, 9 changer transitions 23/164 dead transitions. [2022-12-13 04:44:28,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 164 transitions, 11426 flow [2022-12-13 04:44:28,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:44:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:44:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 04:44:28,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 04:44:28,125 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 61 predicate places. [2022-12-13 04:44:28,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 164 transitions, 11426 flow [2022-12-13 04:44:28,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 141 transitions, 9786 flow [2022-12-13 04:44:28,151 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:44:28,151 INFO L89 Accepts]: Start accepts. Operand has 92 places, 141 transitions, 9786 flow [2022-12-13 04:44:28,186 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:44:28,186 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:44:28,186 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 141 transitions, 9786 flow [2022-12-13 04:44:28,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 141 transitions, 9786 flow [2022-12-13 04:44:28,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:44:28,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L65-2-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_19| (select (select |v_#memory_int_91| v_~q1~0.base_44) (+ v_~q1~0.offset_44 (* 4 v_~q1_front~0_45)))) (= (+ v_~q1_front~0_45 1) v_~q1_front~0_44) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~q1_front~0_45) (< v_~q1_front~0_45 v_~q1_back~0_94) (< v_~q1_front~0_45 v_~n1~0_39)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|)) InVars {~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_45, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, #memory_int=|v_#memory_int_91|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_19|, ~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_44, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_7|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:44:28,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [912] L65-2-->thread2EXIT: Formula: (and (= (+ v_~q2_back~0_228 1) v_~q2_back~0_227) (= |v_thread2Thread1of1ForFork0_#res#1.base_53| 0) (= (select (select |v_#memory_int_418| v_~q1~0.base_154) (+ v_~q1~0.offset_154 (* v_~q1_front~0_188 4))) |v_thread2Thread1of1ForFork0_~j~0#1_89|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91| (ite (= (+ (select (select |v_#memory_int_418| v_~q2~0.base_163) (+ (* 4 v_~q2_back~0_228) v_~q2~0.offset_163)) 1) |v_thread2Thread1of1ForFork0_~j~0#1_89|) 1 0)) (= v_~q1_front~0_187 (+ v_~q1_front~0_188 1)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_53| 0) (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_89| v_~s~0_163) v_~s~0_162) (<= |v_thread2Thread1of1ForFork0_~j~0#1_89| 0) (not (= (ite (and (< v_~q1_front~0_188 v_~n1~0_175) (<= 0 v_~q1_front~0_188) (< v_~q1_front~0_188 v_~q1_back~0_244)) 1 0) 0)) (not (= (ite (and (< v_~q2_back~0_228 v_~n2~0_152) (<= 0 v_~q2_back~0_228)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_91| 0))) InVars {~q1~0.offset=v_~q1~0.offset_154, ~n2~0=v_~n2~0_152, ~q1_front~0=v_~q1_front~0_188, ~q1_back~0=v_~q1_back~0_244, ~q2~0.offset=v_~q2~0.offset_163, ~n1~0=v_~n1~0_175, ~q1~0.base=v_~q1~0.base_154, #memory_int=|v_#memory_int_418|, ~q2~0.base=v_~q2~0.base_163, ~q2_back~0=v_~q2_back~0_228, ~s~0=v_~s~0_163} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_89|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_55|, ~q1~0.offset=v_~q1~0.offset_154, ~n2~0=v_~n2~0_152, ~q1_front~0=v_~q1_front~0_187, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_53|, ~q2~0.offset=v_~q2~0.offset_163, ~n1~0=v_~n1~0_175, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_45|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_45|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_55|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_91|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_53|, ~q1_back~0=v_~q1_back~0_244, ~q1~0.base=v_~q1~0.base_154, #memory_int=|v_#memory_int_418|, ~q2~0.base=v_~q2~0.base_163, ~q2_back~0=v_~q2_back~0_227, ~s~0=v_~s~0_162} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:44:28,691 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 04:44:28,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 541 [2022-12-13 04:44:28,692 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 138 transitions, 9580 flow [2022-12-13 04:44:28,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:44:28,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:44:28,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:44:28,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 04:44:28,693 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:44:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:44:28,693 INFO L85 PathProgramCache]: Analyzing trace with hash 906316637, now seen corresponding path program 1 times [2022-12-13 04:44:28,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:44:28,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117170364] [2022-12-13 04:44:28,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:44:28,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:44:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:44:30,227 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 04:44:30,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:44:30,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117170364] [2022-12-13 04:44:30,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117170364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:44:30,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:44:30,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:44:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666355523] [2022-12-13 04:44:30,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:44:30,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:44:30,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:44:30,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:44:30,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:44:30,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-13 04:44:30,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 138 transitions, 9580 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:44:30,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:44:30,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-13 04:44:30,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:44:30,731 INFO L130 PetriNetUnfolder]: 723/1159 cut-off events. [2022-12-13 04:44:30,731 INFO L131 PetriNetUnfolder]: For 5792/5792 co-relation queries the response was YES. [2022-12-13 04:44:30,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41254 conditions, 1159 events. 723/1159 cut-off events. For 5792/5792 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4875 event pairs, 47 based on Foata normal form. 1/820 useless extension candidates. Maximal degree in co-relation 23836. Up to 1150 conditions per place. [2022-12-13 04:44:30,743 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 132 selfloop transitions, 11 changer transitions 20/165 dead transitions. [2022-12-13 04:44:30,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 165 transitions, 11798 flow [2022-12-13 04:44:30,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:44:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:44:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 04:44:30,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2022-12-13 04:44:30,746 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 64 predicate places. [2022-12-13 04:44:30,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 165 transitions, 11798 flow [2022-12-13 04:44:30,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 145 transitions, 10332 flow [2022-12-13 04:44:30,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:44:30,773 INFO L89 Accepts]: Start accepts. Operand has 95 places, 145 transitions, 10332 flow [2022-12-13 04:44:30,778 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:44:30,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:44:30,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 145 transitions, 10332 flow [2022-12-13 04:44:30,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 145 transitions, 10332 flow [2022-12-13 04:44:30,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 04:44:30,877 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [916] L65-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_57| 0) (= (+ |v_thread2Thread1of1ForFork0_~j~0#1_93| v_~s~0_171) v_~s~0_170) (= (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_93| (+ (select (select |v_#memory_int_436| v_~q2~0.base_169) (+ v_~q2~0.offset_169 (* 4 v_~q2_back~0_236))) 1)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| 0)) (= (+ v_~q2_back~0_236 1) v_~q2_back~0_235) (= (select (select |v_#memory_int_436| v_~q1~0.base_158) (+ (* v_~q1_front~0_196 4) v_~q1~0.offset_158)) |v_thread2Thread1of1ForFork0_~j~0#1_93|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_57| 0) (= (+ v_~q1_front~0_196 1) v_~q1_front~0_195) (<= |v_thread2Thread1of1ForFork0_~j~0#1_93| 0) (not (= (ite (and (<= 0 v_~q2_back~0_236) (< v_~q2_back~0_236 v_~n2~0_156)) 1 0) 0)) (not (= (ite (and (< v_~q1_front~0_196 v_~n1~0_179) (< v_~q1_front~0_196 v_~q1_back~0_248) (<= 0 v_~q1_front~0_196)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|)) InVars {~q1~0.offset=v_~q1~0.offset_158, ~n2~0=v_~n2~0_156, ~q1_front~0=v_~q1_front~0_196, ~q1_back~0=v_~q1_back~0_248, ~q2~0.offset=v_~q2~0.offset_169, ~n1~0=v_~n1~0_179, ~q1~0.base=v_~q1~0.base_158, #memory_int=|v_#memory_int_436|, ~q2~0.base=v_~q2~0.base_169, ~q2_back~0=v_~q2_back~0_236, ~s~0=v_~s~0_171} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_93|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_59|, ~q1~0.offset=v_~q1~0.offset_158, ~n2~0=v_~n2~0_156, ~q1_front~0=v_~q1_front~0_195, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_57|, ~q2~0.offset=v_~q2~0.offset_169, ~n1~0=v_~n1~0_179, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_97|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_49|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_49|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_59|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_57|, ~q1_back~0=v_~q1_back~0_248, ~q1~0.base=v_~q1~0.base_158, #memory_int=|v_#memory_int_436|, ~q2~0.base=v_~q2~0.base_169, ~q2_back~0=v_~q2_back~0_235, ~s~0=v_~s~0_170} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, ~q1_front~0, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:44:30,982 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:44:30,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-13 04:44:30,983 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 143 transitions, 10190 flow [2022-12-13 04:44:30,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:44:30,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:44:30,983 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:44:30,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 04:44:30,983 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:44:30,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:44:30,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2041592197, now seen corresponding path program 1 times [2022-12-13 04:44:30,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:44:30,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670675043] [2022-12-13 04:44:30,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:44:30,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:44:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:44:32,321 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 04:44:32,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:44:32,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670675043] [2022-12-13 04:44:32,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670675043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:44:32,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:44:32,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:44:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767230686] [2022-12-13 04:44:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:44:32,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:44:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:44:32,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:44:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:44:32,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-13 04:44:32,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 143 transitions, 10190 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:44:32,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:44:32,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-13 04:44:32,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:44:32,747 INFO L130 PetriNetUnfolder]: 719/1148 cut-off events. [2022-12-13 04:44:32,747 INFO L131 PetriNetUnfolder]: For 6318/6318 co-relation queries the response was YES. [2022-12-13 04:44:32,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42008 conditions, 1148 events. 719/1148 cut-off events. For 6318/6318 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4779 event pairs, 47 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 24488. Up to 1140 conditions per place. [2022-12-13 04:44:32,760 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 126 selfloop transitions, 6 changer transitions 21/157 dead transitions. [2022-12-13 04:44:32,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 157 transitions, 11520 flow [2022-12-13 04:44:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:44:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:44:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-13 04:44:32,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3246753246753247 [2022-12-13 04:44:32,762 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2022-12-13 04:44:32,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 157 transitions, 11520 flow [2022-12-13 04:44:32,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 136 transitions, 9968 flow [2022-12-13 04:44:32,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:44:32,794 INFO L89 Accepts]: Start accepts. Operand has 96 places, 136 transitions, 9968 flow [2022-12-13 04:44:32,800 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:44:32,800 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:44:32,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 136 transitions, 9968 flow [2022-12-13 04:44:32,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 136 transitions, 9968 flow [2022-12-13 04:44:32,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:44:42,676 WARN L233 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 271 DAG size of output: 266 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:44:54,690 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:45:00,980 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:45:00,981 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28187 [2022-12-13 04:45:00,981 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 135 transitions, 9894 flow [2022-12-13 04:45:00,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:45:00,981 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:45:00,981 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:45:00,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 04:45:00,981 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:45:00,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:45:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1229590032, now seen corresponding path program 1 times [2022-12-13 04:45:00,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:45:00,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022239212] [2022-12-13 04:45:00,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:45:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:45:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:45:02,532 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 04:45:02,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:45:02,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022239212] [2022-12-13 04:45:02,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022239212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:45:02,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:45:02,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:45:02,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756287247] [2022-12-13 04:45:02,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:45:02,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:45:02,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:45:02,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:45:02,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:45:02,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 04:45:02,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 135 transitions, 9894 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:45:02,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:45:02,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 04:45:02,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:45:02,952 INFO L130 PetriNetUnfolder]: 784/1249 cut-off events. [2022-12-13 04:45:02,952 INFO L131 PetriNetUnfolder]: For 4616/4616 co-relation queries the response was YES. [2022-12-13 04:45:02,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46934 conditions, 1249 events. 784/1249 cut-off events. For 4616/4616 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5340 event pairs, 48 based on Foata normal form. 1/884 useless extension candidates. Maximal degree in co-relation 25154. Up to 1241 conditions per place. [2022-12-13 04:45:02,966 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 148 selfloop transitions, 13 changer transitions 6/169 dead transitions. [2022-12-13 04:45:02,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 169 transitions, 12742 flow [2022-12-13 04:45:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:45:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:45:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-12-13 04:45:02,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2022-12-13 04:45:02,967 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2022-12-13 04:45:02,968 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 169 transitions, 12742 flow [2022-12-13 04:45:02,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 163 transitions, 12277 flow [2022-12-13 04:45:02,998 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:45:02,998 INFO L89 Accepts]: Start accepts. Operand has 99 places, 163 transitions, 12277 flow [2022-12-13 04:45:03,035 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:45:03,035 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:45:03,035 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 163 transitions, 12277 flow [2022-12-13 04:45:03,040 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 163 transitions, 12277 flow [2022-12-13 04:45:03,040 INFO L226 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-13 04:45:03,041 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:45:03,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 04:45:03,042 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 163 transitions, 12277 flow [2022-12-13 04:45:03,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:45:03,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:45:03,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:45:03,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 04:45:03,042 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:45:03,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:45:03,043 INFO L85 PathProgramCache]: Analyzing trace with hash 959412242, now seen corresponding path program 1 times [2022-12-13 04:45:03,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:45:03,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060282604] [2022-12-13 04:45:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:45:03,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:45:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:45:05,163 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 04:45:05,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:45:05,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060282604] [2022-12-13 04:45:05,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060282604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:45:05,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:45:05,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:45:05,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083212632] [2022-12-13 04:45:05,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:45:05,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:45:05,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:45:05,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:45:05,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:45:05,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 04:45:05,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 163 transitions, 12277 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:45:05,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:45:05,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 04:45:05,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:45:05,760 INFO L130 PetriNetUnfolder]: 738/1202 cut-off events. [2022-12-13 04:45:05,760 INFO L131 PetriNetUnfolder]: For 5716/5716 co-relation queries the response was YES. [2022-12-13 04:45:05,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46098 conditions, 1202 events. 738/1202 cut-off events. For 5716/5716 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5180 event pairs, 53 based on Foata normal form. 6/869 useless extension candidates. Maximal degree in co-relation 25820. Up to 1190 conditions per place. [2022-12-13 04:45:05,779 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 129 selfloop transitions, 7 changer transitions 40/178 dead transitions. [2022-12-13 04:45:05,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 178 transitions, 13766 flow [2022-12-13 04:45:05,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:45:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:45:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 04:45:05,780 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3375 [2022-12-13 04:45:05,780 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2022-12-13 04:45:05,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 178 transitions, 13766 flow [2022-12-13 04:45:05,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 138 transitions, 10660 flow [2022-12-13 04:45:05,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:45:05,822 INFO L89 Accepts]: Start accepts. Operand has 99 places, 138 transitions, 10660 flow [2022-12-13 04:45:05,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:45:05,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:45:05,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 138 transitions, 10660 flow [2022-12-13 04:45:05,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 138 transitions, 10660 flow [2022-12-13 04:45:05,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:45:05,836 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:45:27,975 WARN L233 SmtUtils]: Spent 14.39s on a formula simplification. DAG size of input: 252 DAG size of output: 249 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:45:34,333 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 230 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:45:41,911 WARN L233 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 273 DAG size of output: 270 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:45:46,200 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 04:45:46,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40379 [2022-12-13 04:45:46,201 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 135 transitions, 10428 flow [2022-12-13 04:45:46,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:45:46,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:45:46,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:45:46,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 04:45:46,201 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:45:46,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:45:46,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2041393763, now seen corresponding path program 1 times [2022-12-13 04:45:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:45:46,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580717692] [2022-12-13 04:45:46,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:45:46,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:45:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:45:47,417 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 04:45:47,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:45:47,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580717692] [2022-12-13 04:45:47,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580717692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:45:47,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:45:47,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:45:47,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921029867] [2022-12-13 04:45:47,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:45:47,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:45:47,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:45:47,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:45:47,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:45:47,418 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 04:45:47,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 135 transitions, 10428 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 04:45:47,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:45:47,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 04:45:47,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:45:47,702 INFO L130 PetriNetUnfolder]: 716/1138 cut-off events. [2022-12-13 04:45:47,703 INFO L131 PetriNetUnfolder]: For 5844/5844 co-relation queries the response was YES. [2022-12-13 04:45:47,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45056 conditions, 1138 events. 716/1138 cut-off events. For 5844/5844 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4748 event pairs, 48 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 26472. Up to 1131 conditions per place. [2022-12-13 04:45:47,716 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 124 selfloop transitions, 2 changer transitions 20/149 dead transitions. [2022-12-13 04:45:47,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 149 transitions, 11828 flow [2022-12-13 04:45:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:45:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:45:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 04:45:47,717 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 04:45:47,718 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 69 predicate places. [2022-12-13 04:45:47,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 149 transitions, 11828 flow [2022-12-13 04:45:47,732 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 129 transitions, 10234 flow [2022-12-13 04:45:47,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:45:47,747 INFO L89 Accepts]: Start accepts. Operand has 96 places, 129 transitions, 10234 flow [2022-12-13 04:45:47,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:45:47,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:45:47,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 129 transitions, 10234 flow [2022-12-13 04:45:47,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 129 transitions, 10234 flow [2022-12-13 04:45:47,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:45:47,755 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:45:47,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 04:45:47,756 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 129 transitions, 10234 flow [2022-12-13 04:45:47,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 04:45:47,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:45:47,756 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:45:47,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 04:45:47,756 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:45:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:45:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash -267060433, now seen corresponding path program 1 times [2022-12-13 04:45:47,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:45:47,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695662999] [2022-12-13 04:45:47,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:45:47,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:45:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:45:50,418 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 04:45:50,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:45:50,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695662999] [2022-12-13 04:45:50,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695662999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:45:50,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:45:50,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:45:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9718496] [2022-12-13 04:45:50,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:45:50,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:45:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:45:50,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:45:50,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:45:50,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:45:50,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 129 transitions, 10234 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:45:50,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:45:50,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:45:50,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:45:51,046 INFO L130 PetriNetUnfolder]: 731/1173 cut-off events. [2022-12-13 04:45:51,046 INFO L131 PetriNetUnfolder]: For 4275/4275 co-relation queries the response was YES. [2022-12-13 04:45:51,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47465 conditions, 1173 events. 731/1173 cut-off events. For 4275/4275 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5011 event pairs, 53 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 27138. Up to 1164 conditions per place. [2022-12-13 04:45:51,060 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 130 selfloop transitions, 7 changer transitions 23/162 dead transitions. [2022-12-13 04:45:51,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 162 transitions, 13198 flow [2022-12-13 04:45:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:45:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:45:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-13 04:45:51,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37438423645320196 [2022-12-13 04:45:51,062 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 70 predicate places. [2022-12-13 04:45:51,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 162 transitions, 13198 flow [2022-12-13 04:45:51,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 139 transitions, 11282 flow [2022-12-13 04:45:51,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:45:51,098 INFO L89 Accepts]: Start accepts. Operand has 101 places, 139 transitions, 11282 flow [2022-12-13 04:45:51,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:45:51,107 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:45:51,107 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 139 transitions, 11282 flow [2022-12-13 04:45:51,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 139 transitions, 11282 flow [2022-12-13 04:45:51,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:45:51,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:45:51,194 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L65-2-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_19| (select (select |v_#memory_int_91| v_~q1~0.base_44) (+ v_~q1~0.offset_44 (* 4 v_~q1_front~0_45)))) (= (+ v_~q1_front~0_45 1) v_~q1_front~0_44) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~q1_front~0_45) (< v_~q1_front~0_45 v_~q1_back~0_94) (< v_~q1_front~0_45 v_~n1~0_39)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|)) InVars {~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_45, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, #memory_int=|v_#memory_int_91|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_19|, ~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_44, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_7|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:45:51,358 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:45:51,359 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 261 [2022-12-13 04:45:51,359 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 137 transitions, 11122 flow [2022-12-13 04:45:51,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:45:51,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:45:51,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:45:51,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 04:45:51,359 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:45:51,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:45:51,360 INFO L85 PathProgramCache]: Analyzing trace with hash -519196899, now seen corresponding path program 1 times [2022-12-13 04:45:51,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:45:51,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10806419] [2022-12-13 04:45:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:45:51,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:45:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:45:52,850 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 04:45:52,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:45:52,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10806419] [2022-12-13 04:45:52,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10806419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:45:52,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:45:52,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:45:52,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315763418] [2022-12-13 04:45:52,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:45:52,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:45:52,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:45:52,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:45:52,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:45:52,851 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-13 04:45:52,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 137 transitions, 11122 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:45:52,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:45:52,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-13 04:45:52,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:45:53,343 INFO L130 PetriNetUnfolder]: 719/1147 cut-off events. [2022-12-13 04:45:53,343 INFO L131 PetriNetUnfolder]: For 6165/6165 co-relation queries the response was YES. [2022-12-13 04:45:53,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47659 conditions, 1147 events. 719/1147 cut-off events. For 6165/6165 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4810 event pairs, 48 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 27804. Up to 1139 conditions per place. [2022-12-13 04:45:53,357 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 129 selfloop transitions, 5 changer transitions 20/156 dead transitions. [2022-12-13 04:45:53,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 156 transitions, 13012 flow [2022-12-13 04:45:53,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:45:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:45:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-12-13 04:45:53,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29838709677419356 [2022-12-13 04:45:53,358 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 74 predicate places. [2022-12-13 04:45:53,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 156 transitions, 13012 flow [2022-12-13 04:45:53,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 136 transitions, 11306 flow [2022-12-13 04:45:53,387 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:45:53,387 INFO L89 Accepts]: Start accepts. Operand has 103 places, 136 transitions, 11306 flow [2022-12-13 04:45:53,392 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:45:53,392 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:45:53,392 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 136 transitions, 11306 flow [2022-12-13 04:45:53,396 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 136 transitions, 11306 flow [2022-12-13 04:45:53,396 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:45:53,396 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:45:53,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 04:45:53,397 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 11306 flow [2022-12-13 04:45:53,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:45:53,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:45:53,397 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:45:53,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 04:45:53,397 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:45:53,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:45:53,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1407331720, now seen corresponding path program 1 times [2022-12-13 04:45:53,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:45:53,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986107625] [2022-12-13 04:45:53,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:45:53,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:45:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:45:55,178 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 04:45:55,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:45:55,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986107625] [2022-12-13 04:45:55,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986107625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:45:55,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:45:55,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:45:55,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303166557] [2022-12-13 04:45:55,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:45:55,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:45:55,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:45:55,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:45:55,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:45:55,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-13 04:45:55,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 136 transitions, 11306 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:45:55,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:45:55,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-13 04:45:55,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:45:55,688 INFO L130 PetriNetUnfolder]: 716/1139 cut-off events. [2022-12-13 04:45:55,688 INFO L131 PetriNetUnfolder]: For 5418/5418 co-relation queries the response was YES. [2022-12-13 04:45:55,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48471 conditions, 1139 events. 716/1139 cut-off events. For 5418/5418 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4752 event pairs, 48 based on Foata normal form. 1/801 useless extension candidates. Maximal degree in co-relation 28456. Up to 1132 conditions per place. [2022-12-13 04:45:55,702 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 124 selfloop transitions, 3 changer transitions 20/150 dead transitions. [2022-12-13 04:45:55,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 150 transitions, 12792 flow [2022-12-13 04:45:55,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:45:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:45:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 04:45:55,703 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 04:45:55,704 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 77 predicate places. [2022-12-13 04:45:55,704 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 150 transitions, 12792 flow [2022-12-13 04:45:55,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 130 transitions, 11080 flow [2022-12-13 04:45:55,735 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:45:55,735 INFO L89 Accepts]: Start accepts. Operand has 104 places, 130 transitions, 11080 flow [2022-12-13 04:45:55,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:45:55,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:45:55,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 130 transitions, 11080 flow [2022-12-13 04:45:55,744 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 130 transitions, 11080 flow [2022-12-13 04:45:55,744 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:46:09,924 WARN L233 SmtUtils]: Spent 11.49s on a formula simplification. DAG size of input: 254 DAG size of output: 252 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:46:10,559 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:46:10,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14825 [2022-12-13 04:46:10,560 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 129 transitions, 10994 flow [2022-12-13 04:46:10,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:46:10,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:46:10,561 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:46:10,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 04:46:10,561 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:46:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:46:10,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1983785738, now seen corresponding path program 1 times [2022-12-13 04:46:10,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:46:10,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646906978] [2022-12-13 04:46:10,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:46:10,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:46:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:46:12,204 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 04:46:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:46:12,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646906978] [2022-12-13 04:46:12,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646906978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:46:12,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:46:12,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:46:12,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773009693] [2022-12-13 04:46:12,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:46:12,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:46:12,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:46:12,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:46:12,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:46:12,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:46:12,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 129 transitions, 10994 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:46:12,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:46:12,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:46:12,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:46:12,621 INFO L130 PetriNetUnfolder]: 729/1170 cut-off events. [2022-12-13 04:46:12,621 INFO L131 PetriNetUnfolder]: For 5747/5747 co-relation queries the response was YES. [2022-12-13 04:46:12,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50799 conditions, 1170 events. 729/1170 cut-off events. For 5747/5747 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4957 event pairs, 53 based on Foata normal form. 1/833 useless extension candidates. Maximal degree in co-relation 29122. Up to 1161 conditions per place. [2022-12-13 04:46:12,635 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 129 selfloop transitions, 7 changer transitions 24/162 dead transitions. [2022-12-13 04:46:12,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 162 transitions, 14154 flow [2022-12-13 04:46:12,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:46:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:46:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 04:46:12,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 04:46:12,637 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 76 predicate places. [2022-12-13 04:46:12,637 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 162 transitions, 14154 flow [2022-12-13 04:46:12,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 138 transitions, 12012 flow [2022-12-13 04:46:12,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:46:12,668 INFO L89 Accepts]: Start accepts. Operand has 107 places, 138 transitions, 12012 flow [2022-12-13 04:46:12,676 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:46:12,676 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:46:12,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 138 transitions, 12012 flow [2022-12-13 04:46:12,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 138 transitions, 12012 flow [2022-12-13 04:46:12,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:46:12,684 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:46:12,900 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:46:12,901 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-13 04:46:12,901 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 136 transitions, 11838 flow [2022-12-13 04:46:12,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:46:12,901 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:46:12,901 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:46:12,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 04:46:12,901 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:46:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:46:12,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1101354326, now seen corresponding path program 1 times [2022-12-13 04:46:12,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:46:12,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77044559] [2022-12-13 04:46:12,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:46:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:46:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:46:14,249 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 04:46:14,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:46:14,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77044559] [2022-12-13 04:46:14,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77044559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:46:14,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:46:14,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:46:14,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604745751] [2022-12-13 04:46:14,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:46:14,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:46:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:46:14,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:46:14,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:46:14,250 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-13 04:46:14,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 136 transitions, 11838 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:46:14,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:46:14,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-13 04:46:14,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:46:14,658 INFO L130 PetriNetUnfolder]: 716/1139 cut-off events. [2022-12-13 04:46:14,658 INFO L131 PetriNetUnfolder]: For 5949/5949 co-relation queries the response was YES. [2022-12-13 04:46:14,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50714 conditions, 1139 events. 716/1139 cut-off events. For 5949/5949 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4761 event pairs, 48 based on Foata normal form. 1/801 useless extension candidates. Maximal degree in co-relation 29774. Up to 1132 conditions per place. [2022-12-13 04:46:14,672 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 124 selfloop transitions, 3 changer transitions 20/150 dead transitions. [2022-12-13 04:46:14,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 150 transitions, 13380 flow [2022-12-13 04:46:14,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:46:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:46:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 04:46:14,673 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 04:46:14,673 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2022-12-13 04:46:14,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 150 transitions, 13380 flow [2022-12-13 04:46:14,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 130 transitions, 11590 flow [2022-12-13 04:46:14,704 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:46:14,704 INFO L89 Accepts]: Start accepts. Operand has 107 places, 130 transitions, 11590 flow [2022-12-13 04:46:14,710 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:46:14,710 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:46:14,710 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 130 transitions, 11590 flow [2022-12-13 04:46:14,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 130 transitions, 11590 flow [2022-12-13 04:46:14,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:46:31,699 WARN L233 SmtUtils]: Spent 16.97s on a formula simplification. DAG size of input: 247 DAG size of output: 245 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:46:40,122 WARN L233 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 238 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:46:53,917 WARN L233 SmtUtils]: Spent 11.33s on a formula simplification that was a NOOP. DAG size: 255 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:46:53,919 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:46:53,920 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39216 [2022-12-13 04:46:53,920 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 129 transitions, 11500 flow [2022-12-13 04:46:53,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:46:53,920 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:46:53,920 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:46:53,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 04:46:53,920 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:46:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:46:53,921 INFO L85 PathProgramCache]: Analyzing trace with hash 757313063, now seen corresponding path program 1 times [2022-12-13 04:46:53,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:46:53,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857673273] [2022-12-13 04:46:53,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:46:53,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:46:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:46:55,378 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 04:46:55,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:46:55,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857673273] [2022-12-13 04:46:55,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857673273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:46:55,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:46:55,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:46:55,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942770219] [2022-12-13 04:46:55,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:46:55,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:46:55,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:46:55,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:46:55,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:46:55,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:46:55,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 129 transitions, 11500 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:46:55,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:46:55,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:46:55,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:46:55,800 INFO L130 PetriNetUnfolder]: 729/1171 cut-off events. [2022-12-13 04:46:55,800 INFO L131 PetriNetUnfolder]: For 8032/8032 co-relation queries the response was YES. [2022-12-13 04:46:55,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53096 conditions, 1171 events. 729/1171 cut-off events. For 8032/8032 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4987 event pairs, 53 based on Foata normal form. 1/834 useless extension candidates. Maximal degree in co-relation 30440. Up to 1161 conditions per place. [2022-12-13 04:46:55,815 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 129 selfloop transitions, 8 changer transitions 23/162 dead transitions. [2022-12-13 04:46:55,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 162 transitions, 14790 flow [2022-12-13 04:46:55,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:46:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:46:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 04:46:55,817 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 04:46:55,817 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 80 predicate places. [2022-12-13 04:46:55,817 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 162 transitions, 14790 flow [2022-12-13 04:46:55,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 139 transitions, 12644 flow [2022-12-13 04:46:55,850 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:46:55,850 INFO L89 Accepts]: Start accepts. Operand has 111 places, 139 transitions, 12644 flow [2022-12-13 04:46:55,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:46:55,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:46:55,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 139 transitions, 12644 flow [2022-12-13 04:46:55,860 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 139 transitions, 12644 flow [2022-12-13 04:46:55,860 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:46:55,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:46:55,947 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L65-2-->L70: Formula: (and (= |v_thread2Thread1of1ForFork0_~j~0#1_19| (select (select |v_#memory_int_91| v_~q1~0.base_44) (+ v_~q1~0.offset_44 (* 4 v_~q1_front~0_45)))) (= (+ v_~q1_front~0_45 1) v_~q1_front~0_44) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~q1_front~0_45) (< v_~q1_front~0_45 v_~q1_back~0_94) (< v_~q1_front~0_45 v_~n1~0_39)) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|)) InVars {~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_45, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, #memory_int=|v_#memory_int_91|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_19|, ~q1~0.offset=v_~q1~0.offset_44, ~q1_front~0=v_~q1_front~0_44, ~q1_back~0=v_~q1_back~0_94, ~n1~0=v_~n1~0_39, ~q1~0.base=v_~q1~0.base_44, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #memory_int=|v_#memory_int_91|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_7|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:46:56,112 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:46:56,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-13 04:46:56,113 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 137 transitions, 12464 flow [2022-12-13 04:46:56,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:46:56,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:46:56,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:46:56,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 04:46:56,114 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:46:56,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:46:56,114 INFO L85 PathProgramCache]: Analyzing trace with hash -487733577, now seen corresponding path program 1 times [2022-12-13 04:46:56,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:46:56,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126062116] [2022-12-13 04:46:56,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:46:56,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:46:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:46:57,416 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 04:46:57,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:46:57,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126062116] [2022-12-13 04:46:57,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126062116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:46:57,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:46:57,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 04:46:57,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962129954] [2022-12-13 04:46:57,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:46:57,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 04:46:57,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:46:57,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 04:46:57,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:46:57,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 04:46:57,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 137 transitions, 12464 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:46:57,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:46:57,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 04:46:57,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:46:57,812 INFO L130 PetriNetUnfolder]: 717/1141 cut-off events. [2022-12-13 04:46:57,813 INFO L131 PetriNetUnfolder]: For 7994/7994 co-relation queries the response was YES. [2022-12-13 04:46:57,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53006 conditions, 1141 events. 717/1141 cut-off events. For 7994/7994 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4766 event pairs, 48 based on Foata normal form. 1/802 useless extension candidates. Maximal degree in co-relation 31092. Up to 1133 conditions per place. [2022-12-13 04:46:57,827 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 127 selfloop transitions, 5 changer transitions 15/151 dead transitions. [2022-12-13 04:46:57,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 151 transitions, 14064 flow [2022-12-13 04:46:57,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:46:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:46:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-13 04:46:57,828 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3271889400921659 [2022-12-13 04:46:57,829 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 83 predicate places. [2022-12-13 04:46:57,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 151 transitions, 14064 flow [2022-12-13 04:46:57,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 136 transitions, 12634 flow [2022-12-13 04:46:57,913 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:46:57,914 INFO L89 Accepts]: Start accepts. Operand has 113 places, 136 transitions, 12634 flow [2022-12-13 04:46:57,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:46:57,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:46:57,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 136 transitions, 12634 flow [2022-12-13 04:46:57,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 136 transitions, 12634 flow [2022-12-13 04:46:57,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:46:57,923 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:46:57,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 04:46:57,924 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 136 transitions, 12634 flow [2022-12-13 04:46:57,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 04:46:57,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:46:57,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:46:57,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 04:46:57,924 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:46:57,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:46:57,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2076425538, now seen corresponding path program 1 times [2022-12-13 04:46:57,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:46:57,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761667981] [2022-12-13 04:46:57,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:46:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:46:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:47:00,904 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 04:47:00,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:47:00,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761667981] [2022-12-13 04:47:00,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761667981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:47:00,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:47:00,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:47:00,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646637176] [2022-12-13 04:47:00,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:47:00,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:47:00,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:47:00,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:47:00,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:47:00,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 04:47:00,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 136 transitions, 12634 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:47:00,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:47:00,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 04:47:00,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:47:01,471 INFO L130 PetriNetUnfolder]: 775/1230 cut-off events. [2022-12-13 04:47:01,471 INFO L131 PetriNetUnfolder]: For 7126/7126 co-relation queries the response was YES. [2022-12-13 04:47:01,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58470 conditions, 1230 events. 775/1230 cut-off events. For 7126/7126 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5297 event pairs, 48 based on Foata normal form. 1/865 useless extension candidates. Maximal degree in co-relation 31758. Up to 1223 conditions per place. [2022-12-13 04:47:01,488 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 143 selfloop transitions, 13 changer transitions 6/164 dead transitions. [2022-12-13 04:47:01,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 164 transitions, 15614 flow [2022-12-13 04:47:01,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:47:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:47:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-12-13 04:47:01,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32916666666666666 [2022-12-13 04:47:01,490 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2022-12-13 04:47:01,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 164 transitions, 15614 flow [2022-12-13 04:47:01,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 158 transitions, 15029 flow [2022-12-13 04:47:01,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:47:01,528 INFO L89 Accepts]: Start accepts. Operand has 120 places, 158 transitions, 15029 flow [2022-12-13 04:47:01,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:47:01,535 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:47:01,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 158 transitions, 15029 flow [2022-12-13 04:47:01,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 158 transitions, 15029 flow [2022-12-13 04:47:01,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-13 04:47:01,740 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:47:01,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-13 04:47:01,740 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 157 transitions, 14933 flow [2022-12-13 04:47:01,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:47:01,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:47:01,741 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:47:01,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 04:47:01,741 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:47:01,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:47:01,741 INFO L85 PathProgramCache]: Analyzing trace with hash -60335387, now seen corresponding path program 1 times [2022-12-13 04:47:01,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:47:01,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968060437] [2022-12-13 04:47:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:47:01,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:47:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:47:03,851 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 04:47:03,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:47:03,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968060437] [2022-12-13 04:47:03,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968060437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:47:03,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:47:03,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:47:03,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056662201] [2022-12-13 04:47:03,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:47:03,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:47:03,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:47:03,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:47:03,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:47:03,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 04:47:03,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 157 transitions, 14933 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:47:03,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:47:03,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 04:47:03,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:47:04,364 INFO L130 PetriNetUnfolder]: 729/1182 cut-off events. [2022-12-13 04:47:04,364 INFO L131 PetriNetUnfolder]: For 9956/9956 co-relation queries the response was YES. [2022-12-13 04:47:04,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57033 conditions, 1182 events. 729/1182 cut-off events. For 9956/9956 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5067 event pairs, 53 based on Foata normal form. 6/849 useless extension candidates. Maximal degree in co-relation 32424. Up to 1171 conditions per place. [2022-12-13 04:47:04,380 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 128 selfloop transitions, 8 changer transitions 34/172 dead transitions. [2022-12-13 04:47:04,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 172 transitions, 16702 flow [2022-12-13 04:47:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:47:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:47:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-13 04:47:04,381 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.328125 [2022-12-13 04:47:04,381 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2022-12-13 04:47:04,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 172 transitions, 16702 flow [2022-12-13 04:47:04,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 138 transitions, 13364 flow [2022-12-13 04:47:04,417 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:47:04,417 INFO L89 Accepts]: Start accepts. Operand has 119 places, 138 transitions, 13364 flow [2022-12-13 04:47:04,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:47:04,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:47:04,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 138 transitions, 13364 flow [2022-12-13 04:47:04,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 138 transitions, 13364 flow [2022-12-13 04:47:04,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:47:04,430 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:47:37,543 WARN L233 SmtUtils]: Spent 33.03s on a formula simplification. DAG size of input: 262 DAG size of output: 260 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:47:44,260 WARN L233 SmtUtils]: Spent 6.71s on a formula simplification that was a NOOP. DAG size: 252 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:48:07,605 WARN L233 SmtUtils]: Spent 23.34s on a formula simplification. DAG size of input: 276 DAG size of output: 274 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:48:47,238 WARN L233 SmtUtils]: Spent 33.78s on a formula simplification. DAG size of input: 306 DAG size of output: 301 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:48:48,798 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 04:48:48,798 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104381 [2022-12-13 04:48:48,798 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 135 transitions, 13072 flow [2022-12-13 04:48:48,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:48:48,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:48:48,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:48:48,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 04:48:48,799 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:48:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:48:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1201970882, now seen corresponding path program 1 times [2022-12-13 04:48:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:48:48,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959131127] [2022-12-13 04:48:48,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:48:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:48:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:48:50,978 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 04:48:50,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:48:50,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959131127] [2022-12-13 04:48:50,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959131127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:48:50,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:48:50,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:48:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517168836] [2022-12-13 04:48:50,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:48:50,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:48:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:48:50,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:48:50,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:48:50,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 04:48:50,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 135 transitions, 13072 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 04:48:50,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:48:50,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 04:48:50,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:48:51,318 INFO L130 PetriNetUnfolder]: 716/1138 cut-off events. [2022-12-13 04:48:51,318 INFO L131 PetriNetUnfolder]: For 8922/8922 co-relation queries the response was YES. [2022-12-13 04:48:51,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56282 conditions, 1138 events. 716/1138 cut-off events. For 8922/8922 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4737 event pairs, 48 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 33076. Up to 1131 conditions per place. [2022-12-13 04:48:51,334 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 122 selfloop transitions, 4 changer transitions 20/149 dead transitions. [2022-12-13 04:48:51,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 149 transitions, 14752 flow [2022-12-13 04:48:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:48:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:48:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 04:48:51,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 04:48:51,336 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2022-12-13 04:48:51,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 149 transitions, 14752 flow [2022-12-13 04:48:51,354 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 129 transitions, 12766 flow [2022-12-13 04:48:51,370 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:48:51,370 INFO L89 Accepts]: Start accepts. Operand has 114 places, 129 transitions, 12766 flow [2022-12-13 04:48:51,376 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:48:51,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:48:51,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 129 transitions, 12766 flow [2022-12-13 04:48:51,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 129 transitions, 12766 flow [2022-12-13 04:48:51,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:48:51,381 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:48:51,381 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 04:48:51,381 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 129 transitions, 12766 flow [2022-12-13 04:48:51,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 04:48:51,381 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:48:51,382 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:48:51,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 04:48:51,382 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:48:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:48:51,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2104456512, now seen corresponding path program 1 times [2022-12-13 04:48:51,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:48:51,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504835384] [2022-12-13 04:48:51,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:48:51,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:48:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:48:53,383 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 04:48:53,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:48:53,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504835384] [2022-12-13 04:48:53,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504835384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:48:53,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:48:53,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:48:53,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598070640] [2022-12-13 04:48:53,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:48:53,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:48:53,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:48:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:48:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:48:53,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:48:53,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 129 transitions, 12766 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:48:53,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:48:53,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:48:53,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:48:53,882 INFO L130 PetriNetUnfolder]: 729/1170 cut-off events. [2022-12-13 04:48:53,882 INFO L131 PetriNetUnfolder]: For 9799/9799 co-relation queries the response was YES. [2022-12-13 04:48:53,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58848 conditions, 1170 events. 729/1170 cut-off events. For 9799/9799 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4977 event pairs, 53 based on Foata normal form. 1/833 useless extension candidates. Maximal degree in co-relation 33742. Up to 1161 conditions per place. [2022-12-13 04:48:53,898 INFO L137 encePairwiseOnDemand]: 16/29 looper letters, 127 selfloop transitions, 9 changer transitions 24/162 dead transitions. [2022-12-13 04:48:53,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 162 transitions, 16382 flow [2022-12-13 04:48:53,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:48:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:48:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-12-13 04:48:53,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3448275862068966 [2022-12-13 04:48:53,900 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 89 predicate places. [2022-12-13 04:48:53,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 162 transitions, 16382 flow [2022-12-13 04:48:53,919 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 138 transitions, 13904 flow [2022-12-13 04:48:53,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:48:53,936 INFO L89 Accepts]: Start accepts. Operand has 120 places, 138 transitions, 13904 flow [2022-12-13 04:48:53,944 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:48:53,944 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:48:53,944 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 138 transitions, 13904 flow [2022-12-13 04:48:53,948 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 138 transitions, 13904 flow [2022-12-13 04:48:53,948 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:48:53,950 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:48:54,027 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:48:54,027 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 04:48:54,027 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 137 transitions, 13804 flow [2022-12-13 04:48:54,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:48:54,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:48:54,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:48:54,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 04:48:54,028 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:48:54,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:48:54,028 INFO L85 PathProgramCache]: Analyzing trace with hash 69560210, now seen corresponding path program 1 times [2022-12-13 04:48:54,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:48:54,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314338739] [2022-12-13 04:48:54,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:48:54,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:48:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:48:55,868 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 04:48:55,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:48:55,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314338739] [2022-12-13 04:48:55,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314338739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:48:55,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:48:55,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:48:55,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228161677] [2022-12-13 04:48:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:48:55,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:48:55,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:48:55,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:48:55,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:48:55,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 04:48:55,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 137 transitions, 13804 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:48:55,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:48:55,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 04:48:55,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:48:56,352 INFO L130 PetriNetUnfolder]: 716/1140 cut-off events. [2022-12-13 04:48:56,352 INFO L131 PetriNetUnfolder]: For 9301/9301 co-relation queries the response was YES. [2022-12-13 04:48:56,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58648 conditions, 1140 events. 716/1140 cut-off events. For 9301/9301 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4779 event pairs, 48 based on Foata normal form. 1/802 useless extension candidates. Maximal degree in co-relation 34408. Up to 1133 conditions per place. [2022-12-13 04:48:56,369 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 125 selfloop transitions, 3 changer transitions 21/151 dead transitions. [2022-12-13 04:48:56,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 151 transitions, 15548 flow [2022-12-13 04:48:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:48:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:48:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-13 04:48:56,370 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333 [2022-12-13 04:48:56,370 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2022-12-13 04:48:56,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 151 transitions, 15548 flow [2022-12-13 04:48:56,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 130 transitions, 13378 flow [2022-12-13 04:48:56,407 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:48:56,407 INFO L89 Accepts]: Start accepts. Operand has 121 places, 130 transitions, 13378 flow [2022-12-13 04:48:56,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:48:56,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:48:56,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 130 transitions, 13378 flow [2022-12-13 04:48:56,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 130 transitions, 13378 flow [2022-12-13 04:48:56,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:49:29,088 WARN L233 SmtUtils]: Spent 32.66s on a formula simplification. DAG size of input: 266 DAG size of output: 264 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:49:52,323 WARN L233 SmtUtils]: Spent 23.23s on a formula simplification that was a NOOP. DAG size: 260 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:49:55,960 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:49:55,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59554 [2022-12-13 04:49:55,961 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 129 transitions, 13274 flow [2022-12-13 04:49:55,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:49:55,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:49:55,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:49:55,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 04:49:55,961 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:49:55,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:49:55,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1701079160, now seen corresponding path program 1 times [2022-12-13 04:49:55,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:49:55,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168466144] [2022-12-13 04:49:55,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:49:55,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:49:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:49:58,255 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 04:49:58,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:49:58,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168466144] [2022-12-13 04:49:58,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168466144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:49:58,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:49:58,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:49:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860931477] [2022-12-13 04:49:58,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:49:58,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:49:58,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:49:58,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:49:58,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:49:58,256 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 04:49:58,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 129 transitions, 13274 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:49:58,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:49:58,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 04:49:58,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:49:59,021 INFO L130 PetriNetUnfolder]: 781/1251 cut-off events. [2022-12-13 04:49:59,021 INFO L131 PetriNetUnfolder]: For 10771/10771 co-relation queries the response was YES. [2022-12-13 04:49:59,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65369 conditions, 1251 events. 781/1251 cut-off events. For 10771/10771 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5424 event pairs, 53 based on Foata normal form. 1/888 useless extension candidates. Maximal degree in co-relation 35074. Up to 1240 conditions per place. [2022-12-13 04:49:59,040 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 149 selfloop transitions, 15 changer transitions 5/171 dead transitions. [2022-12-13 04:49:59,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 171 transitions, 17976 flow [2022-12-13 04:49:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:49:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:49:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-12-13 04:49:59,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3706896551724138 [2022-12-13 04:49:59,041 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2022-12-13 04:49:59,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 171 transitions, 17976 flow [2022-12-13 04:49:59,065 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 166 transitions, 17437 flow [2022-12-13 04:49:59,087 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:49:59,087 INFO L89 Accepts]: Start accepts. Operand has 126 places, 166 transitions, 17437 flow [2022-12-13 04:49:59,096 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:49:59,096 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:49:59,096 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 166 transitions, 17437 flow [2022-12-13 04:49:59,101 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 166 transitions, 17437 flow [2022-12-13 04:49:59,101 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 04:49:59,310 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:49:59,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-13 04:49:59,311 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 165 transitions, 17331 flow [2022-12-13 04:49:59,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:49:59,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:49:59,311 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:49:59,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 04:49:59,311 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:49:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:49:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash 875889362, now seen corresponding path program 2 times [2022-12-13 04:49:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:49:59,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354673618] [2022-12-13 04:49:59,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:49:59,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:49:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:50:01,280 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 04:50:01,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:50:01,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354673618] [2022-12-13 04:50:01,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354673618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:50:01,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:50:01,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:50:01,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960184465] [2022-12-13 04:50:01,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:50:01,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:50:01,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:50:01,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:50:01,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:50:01,281 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-13 04:50:01,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 165 transitions, 17331 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:50:01,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:50:01,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-13 04:50:01,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:50:01,871 INFO L130 PetriNetUnfolder]: 808/1323 cut-off events. [2022-12-13 04:50:01,872 INFO L131 PetriNetUnfolder]: For 10692/10692 co-relation queries the response was YES. [2022-12-13 04:50:01,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70444 conditions, 1323 events. 808/1323 cut-off events. For 10692/10692 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6027 event pairs, 47 based on Foata normal form. 1/949 useless extension candidates. Maximal degree in co-relation 35740. Up to 1311 conditions per place. [2022-12-13 04:50:01,892 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 159 selfloop transitions, 9 changer transitions 40/210 dead transitions. [2022-12-13 04:50:01,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 210 transitions, 22480 flow [2022-12-13 04:50:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:50:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:50:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-12-13 04:50:01,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3185483870967742 [2022-12-13 04:50:01,893 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2022-12-13 04:50:01,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 210 transitions, 22480 flow [2022-12-13 04:50:01,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 170 transitions, 18121 flow [2022-12-13 04:50:01,938 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:50:01,938 INFO L89 Accepts]: Start accepts. Operand has 129 places, 170 transitions, 18121 flow [2022-12-13 04:50:01,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:50:01,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:50:01,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 170 transitions, 18121 flow [2022-12-13 04:50:01,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 170 transitions, 18121 flow [2022-12-13 04:50:01,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-13 04:50:01,954 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:50:01,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 04:50:01,955 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 170 transitions, 18121 flow [2022-12-13 04:50:01,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:50:01,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:50:01,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:50:01,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 04:50:01,955 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:50:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:50:01,956 INFO L85 PathProgramCache]: Analyzing trace with hash -238701506, now seen corresponding path program 1 times [2022-12-13 04:50:01,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:50:01,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326321036] [2022-12-13 04:50:01,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:50:01,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:50:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:50:04,198 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 04:50:04,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:50:04,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326321036] [2022-12-13 04:50:04,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326321036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:50:04,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:50:04,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 04:50:04,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476352159] [2022-12-13 04:50:04,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:50:04,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 04:50:04,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:50:04,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 04:50:04,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 04:50:04,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-13 04:50:04,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 170 transitions, 18121 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:50:04,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:50:04,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-13 04:50:04,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:50:04,828 INFO L130 PetriNetUnfolder]: 739/1202 cut-off events. [2022-12-13 04:50:04,828 INFO L131 PetriNetUnfolder]: For 8613/8613 co-relation queries the response was YES. [2022-12-13 04:50:04,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65032 conditions, 1202 events. 739/1202 cut-off events. For 8613/8613 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5195 event pairs, 48 based on Foata normal form. 6/867 useless extension candidates. Maximal degree in co-relation 36406. Up to 1191 conditions per place. [2022-12-13 04:50:04,848 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 126 selfloop transitions, 4 changer transitions 47/179 dead transitions. [2022-12-13 04:50:04,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 179 transitions, 19426 flow [2022-12-13 04:50:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 04:50:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 04:50:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-12-13 04:50:04,849 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32661290322580644 [2022-12-13 04:50:04,849 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 102 predicate places. [2022-12-13 04:50:04,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 179 transitions, 19426 flow [2022-12-13 04:50:04,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 132 transitions, 14366 flow [2022-12-13 04:50:04,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:50:04,889 INFO L89 Accepts]: Start accepts. Operand has 127 places, 132 transitions, 14366 flow [2022-12-13 04:50:04,898 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:50:04,898 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:50:04,898 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 132 transitions, 14366 flow [2022-12-13 04:50:04,902 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 132 transitions, 14366 flow [2022-12-13 04:50:04,903 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 04:51:17,143 WARN L233 SmtUtils]: Spent 1.20m on a formula simplification. DAG size of input: 288 DAG size of output: 286 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:53:08,404 WARN L233 SmtUtils]: Spent 1.80m on a formula simplification. DAG size of input: 302 DAG size of output: 301 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:53:32,888 WARN L233 SmtUtils]: Spent 24.48s on a formula simplification that was a NOOP. DAG size: 295 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:55:01,874 WARN L233 SmtUtils]: Spent 1.48m on a formula simplification. DAG size of input: 312 DAG size of output: 307 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:55:11,401 WARN L233 SmtUtils]: Spent 7.60s on a formula simplification. DAG size of input: 332 DAG size of output: 328 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:55:13,735 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:55:13,736 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 308847 [2022-12-13 04:55:13,736 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 130 transitions, 14146 flow [2022-12-13 04:55:13,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 04:55:13,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:55:13,736 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:55:13,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 04:55:13,736 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:55:13,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:55:13,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1171034093, now seen corresponding path program 1 times [2022-12-13 04:55:13,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:55:13,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373025219] [2022-12-13 04:55:13,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:55:13,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:55:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:55:16,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 04:55:16,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:55:16,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373025219] [2022-12-13 04:55:16,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373025219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:55:16,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:55:16,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 04:55:16,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697687261] [2022-12-13 04:55:16,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:55:16,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 04:55:16,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:55:16,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 04:55:16,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:55:16,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 04:55:16,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 130 transitions, 14146 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:55:16,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:55:16,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 04:55:16,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:55:17,236 INFO L130 PetriNetUnfolder]: 729/1169 cut-off events. [2022-12-13 04:55:17,236 INFO L131 PetriNetUnfolder]: For 9210/9210 co-relation queries the response was YES. [2022-12-13 04:55:17,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64597 conditions, 1169 events. 729/1169 cut-off events. For 9210/9210 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4936 event pairs, 53 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 37072. Up to 1160 conditions per place. [2022-12-13 04:55:17,253 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 128 selfloop transitions, 7 changer transitions 24/161 dead transitions. [2022-12-13 04:55:17,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 161 transitions, 17870 flow [2022-12-13 04:55:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:55:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:55:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-12-13 04:55:17,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 04:55:17,255 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 97 predicate places. [2022-12-13 04:55:17,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 161 transitions, 17870 flow [2022-12-13 04:55:17,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 137 transitions, 15152 flow [2022-12-13 04:55:17,294 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:55:17,294 INFO L89 Accepts]: Start accepts. Operand has 128 places, 137 transitions, 15152 flow [2022-12-13 04:55:17,305 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:55:17,305 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:55:17,305 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 137 transitions, 15152 flow [2022-12-13 04:55:17,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 137 transitions, 15152 flow [2022-12-13 04:55:17,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 04:55:17,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [786] L70-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21| (ite (= |v_thread2Thread1of1ForFork0_~j~0#1_33| (+ (select (select |v_#memory_int_131| v_~q2~0.base_45) (+ v_~q2~0.offset_45 (* v_~q2_back~0_71 4))) 1)) 1 0)) (not (= (ite (and (< v_~q2_back~0_71 v_~n2~0_36) (<= 0 v_~q2_back~0_71)) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~s~0_23 (+ v_~s~0_24 |v_thread2Thread1of1ForFork0_~j~0#1_33|)) (= v_~q2_back~0_70 (+ v_~q2_back~0_71 1)) (<= |v_thread2Thread1of1ForFork0_~j~0#1_33| 0) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_45, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_71, ~s~0=v_~s~0_24} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_33|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_13|, ~n2~0=v_~n2~0_36, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, ~q2~0.offset=v_~q2~0.offset_45, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_13|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, #memory_int=|v_#memory_int_131|, ~q2~0.base=v_~q2~0.base_45, ~q2_back~0=v_~q2_back~0_70, ~s~0=v_~s~0_23} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, ~s~0] and [784] L120-4-->L121-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_121|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_9|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 04:55:17,524 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 04:55:17,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-13 04:55:17,524 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 135 transitions, 14930 flow [2022-12-13 04:55:17,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 04:55:17,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:55:17,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:55:17,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 04:55:17,525 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:55:17,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:55:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1598237393, now seen corresponding path program 1 times [2022-12-13 04:55:17,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:55:17,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206100239] [2022-12-13 04:55:17,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:55:17,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:55:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:55:19,771 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 04:55:19,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:55:19,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206100239] [2022-12-13 04:55:19,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206100239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:55:19,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:55:19,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:55:19,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268110123] [2022-12-13 04:55:19,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:55:19,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:55:19,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:55:19,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:55:19,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:55:19,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 04:55:19,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 135 transitions, 14930 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 04:55:19,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:55:19,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 04:55:19,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:55:20,225 INFO L130 PetriNetUnfolder]: 717/1140 cut-off events. [2022-12-13 04:55:20,225 INFO L131 PetriNetUnfolder]: For 10764/10764 co-relation queries the response was YES. [2022-12-13 04:55:20,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64292 conditions, 1140 events. 717/1140 cut-off events. For 10764/10764 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4705 event pairs, 48 based on Foata normal form. 1/801 useless extension candidates. Maximal degree in co-relation 37724. Up to 1133 conditions per place. [2022-12-13 04:55:20,243 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 125 selfloop transitions, 3 changer transitions 20/151 dead transitions. [2022-12-13 04:55:20,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 151 transitions, 17034 flow [2022-12-13 04:55:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:55:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:55:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 04:55:20,244 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2022-12-13 04:55:20,244 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 99 predicate places. [2022-12-13 04:55:20,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 151 transitions, 17034 flow [2022-12-13 04:55:20,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 131 transitions, 14770 flow [2022-12-13 04:55:20,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:55:20,284 INFO L89 Accepts]: Start accepts. Operand has 127 places, 131 transitions, 14770 flow [2022-12-13 04:55:20,291 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:55:20,291 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:55:20,291 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 131 transitions, 14770 flow [2022-12-13 04:55:20,295 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 131 transitions, 14770 flow [2022-12-13 04:55:20,295 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 Received shutdown request... [2022-12-13 04:55:52,946 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 04:55:53,193 WARN L249 SmtUtils]: Removed 21 from assertion stack [2022-12-13 04:55:53,194 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 04:55:53,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 04:55:53,195 WARN L619 AbstractCegarLoop]: Verification canceled: while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 313 for 32887ms.. [2022-12-13 04:55:53,196 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 04:55:53,196 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 04:55:53,196 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 04:55:53,196 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:55:53,198 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 04:55:53,198 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 04:55:53,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:55:53 BasicIcfg [2022-12-13 04:55:53,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 04:55:53,201 INFO L158 Benchmark]: Toolchain (without parser) took 809718.40ms. Allocated memory was 178.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 154.8MB in the beginning and 930.2MB in the end (delta: -775.4MB). Peak memory consumption was 531.5MB. Max. memory is 8.0GB. [2022-12-13 04:55:53,201 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 04:55:53,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.35ms. Allocated memory is still 178.3MB. Free memory was 154.6MB in the beginning and 141.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 04:55:53,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.68ms. Allocated memory is still 178.3MB. Free memory was 141.0MB in the beginning and 138.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:55:53,202 INFO L158 Benchmark]: Boogie Preprocessor took 52.75ms. Allocated memory is still 178.3MB. Free memory was 138.9MB in the beginning and 136.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:55:53,202 INFO L158 Benchmark]: RCFGBuilder took 712.16ms. Allocated memory is still 178.3MB. Free memory was 136.8MB in the beginning and 104.3MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-13 04:55:53,202 INFO L158 Benchmark]: TraceAbstraction took 808574.64ms. Allocated memory was 178.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 102.7MB in the beginning and 930.2MB in the end (delta: -827.5MB). Peak memory consumption was 479.0MB. Max. memory is 8.0GB. [2022-12-13 04:55:53,203 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.11ms. Allocated memory is still 178.3MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 310.35ms. Allocated memory is still 178.3MB. Free memory was 154.6MB in the beginning and 141.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.68ms. Allocated memory is still 178.3MB. Free memory was 141.0MB in the beginning and 138.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.75ms. Allocated memory is still 178.3MB. Free memory was 138.9MB in the beginning and 136.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 712.16ms. Allocated memory is still 178.3MB. Free memory was 136.8MB in the beginning and 104.3MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 808574.64ms. Allocated memory was 178.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 102.7MB in the beginning and 930.2MB in the end (delta: -827.5MB). Peak memory consumption was 479.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 173 PlacesBefore, 32 PlacesAfterwards, 181 TransitionsBefore, 28 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 112 TrivialYvCompositions, 29 ConcurrentYvCompositions, 11 ChoiceCompositions, 152 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 932, independent: 913, independent conditional: 913, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 932, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 932, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 932, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 880, independent: 871, independent conditional: 0, independent unconditional: 871, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 880, independent: 864, independent conditional: 0, independent unconditional: 864, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 932, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 880, unknown conditional: 0, unknown unconditional: 880] , Statistics on independence cache: Total cache size (in pairs): 1423, Positive cache size: 1414, Positive conditional cache size: 0, Positive unconditional cache size: 1414, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 35 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.1s, 46 PlacesBefore, 44 PlacesAfterwards, 85 TransitionsBefore, 83 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 149 TransitionsBefore, 149 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 174 TransitionsBefore, 174 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 188 TransitionsBefore, 188 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 57 PlacesBefore, 56 PlacesAfterwards, 118 TransitionsBefore, 117 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 195 TransitionsBefore, 195 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 259 TransitionsBefore, 259 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 61 PlacesBefore, 59 PlacesAfterwards, 133 TransitionsBefore, 131 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 1, Positive unconditional cache size: 1, 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, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 62 PlacesAfterwards, 136 TransitionsBefore, 135 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 2, Positive cache size: 2, Positive conditional cache size: 1, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 65 PlacesBefore, 64 PlacesAfterwards, 134 TransitionsBefore, 133 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 2, Positive cache size: 2, Positive conditional cache size: 1, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 69 PlacesBefore, 67 PlacesAfterwards, 139 TransitionsBefore, 137 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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: 3, independent: 2, independent conditional: 2, 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 72 PlacesBefore, 68 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 74 PlacesBefore, 72 PlacesAfterwards, 138 TransitionsBefore, 136 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 74 PlacesBefore, 72 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 77 PlacesBefore, 75 PlacesAfterwards, 139 TransitionsBefore, 137 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 76 PlacesBefore, 74 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 80 PlacesBefore, 78 PlacesAfterwards, 139 TransitionsBefore, 137 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 85 PlacesBefore, 84 PlacesAfterwards, 159 TransitionsBefore, 158 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 164 TransitionsBefore, 164 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 3, Positive cache size: 3, Positive conditional cache size: 2, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.1s, 89 PlacesBefore, 83 PlacesAfterwards, 140 TransitionsBefore, 137 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 4, Positive cache size: 4, Positive conditional cache size: 3, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.6s, 83 PlacesBefore, 82 PlacesAfterwards, 131 TransitionsBefore, 130 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 4, Positive cache size: 4, Positive conditional cache size: 3, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 87 PlacesBefore, 85 PlacesAfterwards, 137 TransitionsBefore, 135 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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): 5, Positive cache size: 5, Positive conditional cache size: 4, Positive unconditional cache size: 1, 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, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 5, Positive cache size: 5, Positive conditional cache size: 4, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 92 PlacesBefore, 89 PlacesAfterwards, 141 TransitionsBefore, 138 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 95 PlacesBefore, 93 PlacesAfterwards, 145 TransitionsBefore, 143 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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: 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] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.2s, 96 PlacesBefore, 93 PlacesAfterwards, 136 TransitionsBefore, 135 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.4s, 99 PlacesBefore, 96 PlacesAfterwards, 138 TransitionsBefore, 135 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 96 PlacesBefore, 96 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 101 PlacesBefore, 99 PlacesAfterwards, 139 TransitionsBefore, 137 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.8s, 104 PlacesBefore, 101 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 107 PlacesBefore, 105 PlacesAfterwards, 138 TransitionsBefore, 136 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.2s, 107 PlacesBefore, 105 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 111 PlacesBefore, 109 PlacesAfterwards, 139 TransitionsBefore, 137 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 120 PlacesBefore, 119 PlacesAfterwards, 158 TransitionsBefore, 157 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 104.4s, 119 PlacesBefore, 113 PlacesAfterwards, 138 TransitionsBefore, 135 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 114 PlacesBefore, 114 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 120 PlacesBefore, 119 PlacesAfterwards, 138 TransitionsBefore, 137 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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: 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] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.5s, 121 PlacesBefore, 119 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 126 PlacesBefore, 125 PlacesAfterwards, 166 TransitionsBefore, 165 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 170 TransitionsBefore, 170 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 308.8s, 127 PlacesBefore, 123 PlacesAfterwards, 132 TransitionsBefore, 130 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 128 PlacesBefore, 126 PlacesAfterwards, 137 TransitionsBefore, 135 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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): 6, Positive cache size: 6, Positive conditional cache size: 5, Positive unconditional cache size: 1, 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, Eliminated conditions: 1, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 313 for 32887ms.. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 313 for 32887ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 313 for 32887ms.. - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 313 for 32887ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 207 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 808.4s, OverallIterations: 56, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1022 SdHoareTripleChecker+Valid, 11.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1022 mSDsluCounter, 351 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 287 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14020 IncrementalHoareTripleChecker+Invalid, 14284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 64 mSDtfsCounter, 14020 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18121occurred in iteration=53, InterpolantAutomatonStates: 382, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 76.7s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1116 ConstructedInterpolants, 9 QuantifiedInterpolants, 60092 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1164 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 60 InterpolantComputations, 56 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown