/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-counter-fun.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:38:36,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:38:36,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:38:36,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:38:36,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:38:36,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:38:36,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:38:36,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:38:36,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:38:36,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:38:36,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:38:36,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:38:36,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:38:36,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:38:36,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:38:36,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:38:36,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:38:36,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:38:36,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:38:36,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:38:36,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:38:36,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:38:36,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:38:36,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:38:36,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:38:36,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:38:36,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:38:36,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:38:36,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:38:36,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:38:36,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:38:36,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:38:36,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:38:36,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:38:36,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:38:36,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:38:36,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:38:36,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:38:36,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:38:36,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:38:36,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:38:36,887 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-06 02:38:36,911 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:38:36,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:38:36,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:38:36,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:38:36,913 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:38:36,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:38:36,914 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:38:36,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:38:36,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:38:36,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:38:36,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:38:36,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:38:36,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:38:36,915 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:38:36,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:38:36,915 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:38:36,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:38:36,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:38:36,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:38:36,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:38:36,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:38:36,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:38:36,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:38:36,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:38:36,916 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:38:36,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:38:36,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:38:36,917 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:38:36,917 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-06 02:38:37,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:38:37,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:38:37,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:38:37,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:38:37,253 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:38:37,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c [2022-12-06 02:38:38,286 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:38:38,474 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:38:38,474 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c [2022-12-06 02:38:38,480 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f71f58a0/c9d6c1b8a4d9493e814a1b3396b46cd6/FLAG2859accf1 [2022-12-06 02:38:38,490 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f71f58a0/c9d6c1b8a4d9493e814a1b3396b46cd6 [2022-12-06 02:38:38,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:38:38,493 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:38:38,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:38:38,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:38:38,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:38:38,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8dd4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38, skipping insertion in model container [2022-12-06 02:38:38,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:38:38,514 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:38:38,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:38:38,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:38:38,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:38:38,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:38:38,641 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-counter-fun.wvr.c[2681,2694] [2022-12-06 02:38:38,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:38:38,666 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:38:38,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:38:38,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:38:38,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:38:38,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:38:38,700 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-counter-fun.wvr.c[2681,2694] [2022-12-06 02:38:38,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:38:38,713 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:38:38,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38 WrapperNode [2022-12-06 02:38:38,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:38:38,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:38:38,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:38:38,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:38:38,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,767 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 193 [2022-12-06 02:38:38,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:38:38,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:38:38,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:38:38,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:38:38,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,800 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:38:38,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:38:38,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:38:38,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:38:38,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38" (1/1) ... [2022-12-06 02:38:38,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:38:38,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:38,841 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-06 02:38:38,847 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-06 02:38:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:38:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:38:38,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:38:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:38:38,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:38:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:38:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:38:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:38:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:38:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:38:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:38:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:38:38,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:38:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:38:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:38:38,873 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:38:38,986 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:38:38,987 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:38:39,218 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:38:39,408 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:38:39,408 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 02:38:39,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:38:39 BoogieIcfgContainer [2022-12-06 02:38:39,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:38:39,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:38:39,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:38:39,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:38:39,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:38:38" (1/3) ... [2022-12-06 02:38:39,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b518c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:38:39, skipping insertion in model container [2022-12-06 02:38:39,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:38:38" (2/3) ... [2022-12-06 02:38:39,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b518c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:38:39, skipping insertion in model container [2022-12-06 02:38:39,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:38:39" (3/3) ... [2022-12-06 02:38:39,418 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-fun.wvr.c [2022-12-06 02:38:39,431 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:38:39,432 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:38:39,432 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:38:39,468 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 02:38:39,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 150 transitions, 316 flow [2022-12-06 02:38:39,564 INFO L130 PetriNetUnfolder]: 13/148 cut-off events. [2022-12-06 02:38:39,564 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:38:39,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 13/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 84 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 02:38:39,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 150 transitions, 316 flow [2022-12-06 02:38:39,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 140 transitions, 292 flow [2022-12-06 02:38:39,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:39,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 140 transitions, 292 flow [2022-12-06 02:38:39,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 140 transitions, 292 flow [2022-12-06 02:38:39,620 INFO L130 PetriNetUnfolder]: 13/140 cut-off events. [2022-12-06 02:38:39,620 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:38:39,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 140 events. 13/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-06 02:38:39,622 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 140 transitions, 292 flow [2022-12-06 02:38:39,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 02:38:44,793 INFO L203 LiptonReduction]: Total number of compositions: 121 [2022-12-06 02:38:44,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:38:44,808 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;@766ded6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:38:44,808 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 02:38:44,812 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-06 02:38:44,812 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 02:38:44,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:44,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:44,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:44,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:44,816 INFO L85 PathProgramCache]: Analyzing trace with hash 723377221, now seen corresponding path program 1 times [2022-12-06 02:38:44,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:44,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477454151] [2022-12-06 02:38:44,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:44,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:45,133 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-06 02:38:45,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:45,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477454151] [2022-12-06 02:38:45,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477454151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:38:45,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:38:45,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:38:45,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056466972] [2022-12-06 02:38:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:38:45,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:38:45,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:45,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:38:45,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:38:45,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 02:38:45,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06 02:38:45,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:45,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 02:38:45,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:45,218 INFO L130 PetriNetUnfolder]: 67/118 cut-off events. [2022-12-06 02:38:45,218 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 02:38:45,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 118 events. 67/118 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 312 event pairs, 9 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 179. Up to 85 conditions per place. [2022-12-06 02:38:45,221 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 23 selfloop transitions, 3 changer transitions 1/29 dead transitions. [2022-12-06 02:38:45,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 29 transitions, 133 flow [2022-12-06 02:38:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:38:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:38:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 02:38:45,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2022-12-06 02:38:45,231 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2022-12-06 02:38:45,232 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:45,232 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 29 transitions, 133 flow [2022-12-06 02:38:45,235 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 29 transitions, 133 flow [2022-12-06 02:38:45,235 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 02:38:45,235 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:45,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 02:38:45,236 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 29 transitions, 133 flow [2022-12-06 02:38:45,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06 02:38:45,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:45,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:45,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:38:45,237 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:45,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:45,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1532126613, now seen corresponding path program 1 times [2022-12-06 02:38:45,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:45,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025293592] [2022-12-06 02:38:45,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:45,339 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-06 02:38:45,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:45,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025293592] [2022-12-06 02:38:45,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025293592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:38:45,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:38:45,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:38:45,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748025949] [2022-12-06 02:38:45,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:38:45,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:38:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:45,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:38:45,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:38:45,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 02:38:45,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 29 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 02:38:45,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:45,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 02:38:45,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:45,450 INFO L130 PetriNetUnfolder]: 94/179 cut-off events. [2022-12-06 02:38:45,450 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-06 02:38:45,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 179 events. 94/179 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 588 event pairs, 8 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 427. Up to 99 conditions per place. [2022-12-06 02:38:45,452 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 43 selfloop transitions, 5 changer transitions 10/58 dead transitions. [2022-12-06 02:38:45,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 58 transitions, 379 flow [2022-12-06 02:38:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:38:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:38:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 02:38:45,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2022-12-06 02:38:45,453 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 6 predicate places. [2022-12-06 02:38:45,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:45,454 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 58 transitions, 379 flow [2022-12-06 02:38:45,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 58 transitions, 379 flow [2022-12-06 02:38:45,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:45,456 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:45,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 02:38:45,457 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 58 transitions, 379 flow [2022-12-06 02:38:45,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 02:38:45,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:45,457 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:45,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:38:45,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:45,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1968363369, now seen corresponding path program 2 times [2022-12-06 02:38:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:45,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867327583] [2022-12-06 02:38:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:45,522 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-06 02:38:45,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:45,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867327583] [2022-12-06 02:38:45,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867327583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:38:45,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:38:45,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:38:45,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117025505] [2022-12-06 02:38:45,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:38:45,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:38:45,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:45,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:38:45,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:38:45,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 02:38:45,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 58 transitions, 379 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 02:38:45,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:45,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 02:38:45,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:45,607 INFO L130 PetriNetUnfolder]: 120/232 cut-off events. [2022-12-06 02:38:45,607 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-06 02:38:45,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 232 events. 120/232 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 810 event pairs, 8 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 778. Up to 133 conditions per place. [2022-12-06 02:38:45,609 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 59 selfloop transitions, 11 changer transitions 33/103 dead transitions. [2022-12-06 02:38:45,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 103 transitions, 875 flow [2022-12-06 02:38:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 02:38:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 02:38:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-12-06 02:38:45,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-06 02:38:45,611 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2022-12-06 02:38:45,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:45,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 103 transitions, 875 flow [2022-12-06 02:38:45,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 103 transitions, 875 flow [2022-12-06 02:38:45,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:45,614 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:45,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-06 02:38:45,614 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 103 transitions, 875 flow [2022-12-06 02:38:45,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 02:38:45,615 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:45,615 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:45,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:38:45,615 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:45,615 INFO L85 PathProgramCache]: Analyzing trace with hash -788188085, now seen corresponding path program 1 times [2022-12-06 02:38:45,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:45,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241597129] [2022-12-06 02:38:45,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:45,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:45,670 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-06 02:38:45,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:45,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241597129] [2022-12-06 02:38:45,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241597129] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:45,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440949082] [2022-12-06 02:38:45,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:45,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:45,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:45,673 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-06 02:38:45,688 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-06 02:38:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:45,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:38:45,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:45,816 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-06 02:38:45,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:38:45,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440949082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:38:45,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:38:45,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-12-06 02:38:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152194130] [2022-12-06 02:38:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:38:45,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:38:45,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:45,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:38:45,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:38:45,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 02:38:45,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 103 transitions, 875 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-06 02:38:45,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:45,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 02:38:45,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:45,927 INFO L130 PetriNetUnfolder]: 185/408 cut-off events. [2022-12-06 02:38:45,927 INFO L131 PetriNetUnfolder]: For 298/298 co-relation queries the response was YES. [2022-12-06 02:38:45,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1999 conditions, 408 events. 185/408 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1972 event pairs, 8 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 951. Up to 218 conditions per place. [2022-12-06 02:38:45,930 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 65 selfloop transitions, 2 changer transitions 132/203 dead transitions. [2022-12-06 02:38:45,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 203 transitions, 2147 flow [2022-12-06 02:38:45,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:38:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:38:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 02:38:45,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2022-12-06 02:38:45,932 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 15 predicate places. [2022-12-06 02:38:45,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:45,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 203 transitions, 2147 flow [2022-12-06 02:38:45,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 203 transitions, 2147 flow [2022-12-06 02:38:45,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:47,967 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:38:47,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2036 [2022-12-06 02:38:47,968 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 202 transitions, 2137 flow [2022-12-06 02:38:47,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-06 02:38:47,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:47,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:47,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 02:38:48,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:48,174 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:48,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:48,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1809256439, now seen corresponding path program 1 times [2022-12-06 02:38:48,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:48,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230096031] [2022-12-06 02:38:48,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:48,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:48,222 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-06 02:38:48,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:48,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230096031] [2022-12-06 02:38:48,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230096031] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:48,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241005813] [2022-12-06 02:38:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:48,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:48,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:48,225 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-06 02:38:48,227 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-06 02:38:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:48,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:38:48,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:48,356 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-06 02:38:48,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 02:38:48,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241005813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:38:48,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 02:38:48,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-12-06 02:38:48,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413185862] [2022-12-06 02:38:48,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:38:48,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:38:48,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:48,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:38:48,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 02:38:48,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 02:38:48,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 202 transitions, 2137 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-06 02:38:48,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:48,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 02:38:48,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:48,452 INFO L130 PetriNetUnfolder]: 217/494 cut-off events. [2022-12-06 02:38:48,452 INFO L131 PetriNetUnfolder]: For 718/718 co-relation queries the response was YES. [2022-12-06 02:38:48,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2836 conditions, 494 events. 217/494 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2598 event pairs, 14 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 1124. Up to 288 conditions per place. [2022-12-06 02:38:48,457 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 65 selfloop transitions, 2 changer transitions 180/251 dead transitions. [2022-12-06 02:38:48,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 251 transitions, 3156 flow [2022-12-06 02:38:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:38:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:38:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 02:38:48,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-06 02:38:48,460 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 17 predicate places. [2022-12-06 02:38:48,461 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:48,461 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 251 transitions, 3156 flow [2022-12-06 02:38:48,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 251 transitions, 3156 flow [2022-12-06 02:38:48,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:48,467 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:48,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:38:48,469 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 251 transitions, 3156 flow [2022-12-06 02:38:48,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-06 02:38:48,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:48,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:48,481 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-06 02:38:48,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:48,674 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:48,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:48,675 INFO L85 PathProgramCache]: Analyzing trace with hash -270149123, now seen corresponding path program 1 times [2022-12-06 02:38:48,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:48,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45443784] [2022-12-06 02:38:48,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:48,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:48,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:48,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45443784] [2022-12-06 02:38:48,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45443784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:48,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078691689] [2022-12-06 02:38:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:48,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:48,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:48,738 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-06 02:38:48,764 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-06 02:38:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:48,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 02:38:48,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:48,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:48,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078691689] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:38:48,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:38:48,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 02:38:48,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672846463] [2022-12-06 02:38:48,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:38:48,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 02:38:48,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:48,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 02:38:48,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 02:38:48,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:38:48,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 251 transitions, 3156 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-06 02:38:48,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:48,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:38:48,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:49,031 INFO L130 PetriNetUnfolder]: 225/508 cut-off events. [2022-12-06 02:38:49,032 INFO L131 PetriNetUnfolder]: For 697/697 co-relation queries the response was YES. [2022-12-06 02:38:49,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3430 conditions, 508 events. 225/508 cut-off events. For 697/697 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2650 event pairs, 6 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 1420. Up to 338 conditions per place. [2022-12-06 02:38:49,035 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 72 selfloop transitions, 9 changer transitions 180/261 dead transitions. [2022-12-06 02:38:49,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 261 transitions, 3795 flow [2022-12-06 02:38:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:38:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:38:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 02:38:49,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 02:38:49,039 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 21 predicate places. [2022-12-06 02:38:49,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:49,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 261 transitions, 3795 flow [2022-12-06 02:38:49,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 261 transitions, 3795 flow [2022-12-06 02:38:49,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:49,046 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:49,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 02:38:49,047 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 261 transitions, 3795 flow [2022-12-06 02:38:49,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-06 02:38:49,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:49,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:49,054 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-06 02:38:49,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:49,255 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:49,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:49,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1935470031, now seen corresponding path program 1 times [2022-12-06 02:38:49,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:49,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439541822] [2022-12-06 02:38:49,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:49,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:49,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439541822] [2022-12-06 02:38:49,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439541822] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:49,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362220345] [2022-12-06 02:38:49,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:49,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:49,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:49,335 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-06 02:38:49,363 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-06 02:38:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:49,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 02:38:49,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:49,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:49,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362220345] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:38:49,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:38:49,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 02:38:49,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146597199] [2022-12-06 02:38:49,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:38:49,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 02:38:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:49,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 02:38:49,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 02:38:49,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:38:49,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 261 transitions, 3795 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-06 02:38:49,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:49,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:38:49,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:49,593 INFO L130 PetriNetUnfolder]: 231/518 cut-off events. [2022-12-06 02:38:49,593 INFO L131 PetriNetUnfolder]: For 709/709 co-relation queries the response was YES. [2022-12-06 02:38:49,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4019 conditions, 518 events. 231/518 cut-off events. For 709/709 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2699 event pairs, 2 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 1711. Up to 344 conditions per place. [2022-12-06 02:38:49,596 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 80 selfloop transitions, 11 changer transitions 180/271 dead transitions. [2022-12-06 02:38:49,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 271 transitions, 4474 flow [2022-12-06 02:38:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:38:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:38:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 02:38:49,597 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41 [2022-12-06 02:38:49,597 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 25 predicate places. [2022-12-06 02:38:49,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:49,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 271 transitions, 4474 flow [2022-12-06 02:38:49,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 271 transitions, 4474 flow [2022-12-06 02:38:49,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:49,604 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:49,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 02:38:49,604 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 271 transitions, 4474 flow [2022-12-06 02:38:49,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-06 02:38:49,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:49,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:49,613 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-06 02:38:49,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:49,810 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:49,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:49,810 INFO L85 PathProgramCache]: Analyzing trace with hash -819012613, now seen corresponding path program 2 times [2022-12-06 02:38:49,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:49,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81599357] [2022-12-06 02:38:49,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:49,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:49,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81599357] [2022-12-06 02:38:49,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81599357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:38:49,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:38:49,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 02:38:49,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676907754] [2022-12-06 02:38:49,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:38:49,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:38:49,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:49,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:38:49,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:38:49,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:38:49,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 271 transitions, 4474 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-06 02:38:49,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:49,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:38:49,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:49,983 INFO L130 PetriNetUnfolder]: 225/512 cut-off events. [2022-12-06 02:38:49,983 INFO L131 PetriNetUnfolder]: For 713/713 co-relation queries the response was YES. [2022-12-06 02:38:49,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4484 conditions, 512 events. 225/512 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2682 event pairs, 4 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 1878. Up to 340 conditions per place. [2022-12-06 02:38:49,986 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 73 selfloop transitions, 10 changer transitions 186/269 dead transitions. [2022-12-06 02:38:49,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 269 transitions, 4980 flow [2022-12-06 02:38:49,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:38:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:38:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 02:38:49,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47 [2022-12-06 02:38:49,987 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 29 predicate places. [2022-12-06 02:38:49,988 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:49,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 269 transitions, 4980 flow [2022-12-06 02:38:49,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 269 transitions, 4980 flow [2022-12-06 02:38:49,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:49,994 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:49,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 02:38:49,994 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 269 transitions, 4980 flow [2022-12-06 02:38:49,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-06 02:38:49,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:49,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:49,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 02:38:49,995 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:49,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash -924021821, now seen corresponding path program 3 times [2022-12-06 02:38:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:49,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580767040] [2022-12-06 02:38:49,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:49,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:50,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:50,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580767040] [2022-12-06 02:38:50,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580767040] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:50,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29056352] [2022-12-06 02:38:50,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:38:50,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:50,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:50,056 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:38:50,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 02:38:50,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:38:50,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:38:50,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 02:38:50,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:50,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:50,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29056352] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:38:50,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:38:50,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 02:38:50,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206326283] [2022-12-06 02:38:50,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:38:50,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:38:50,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:50,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:38:50,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:38:50,179 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:38:50,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 269 transitions, 4980 flow. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-06 02:38:50,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:50,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:38:50,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:50,333 INFO L130 PetriNetUnfolder]: 231/522 cut-off events. [2022-12-06 02:38:50,333 INFO L131 PetriNetUnfolder]: For 703/703 co-relation queries the response was YES. [2022-12-06 02:38:50,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5097 conditions, 522 events. 231/522 cut-off events. For 703/703 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2763 event pairs, 2 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 2193. Up to 346 conditions per place. [2022-12-06 02:38:50,336 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 76 selfloop transitions, 11 changer transitions 186/273 dead transitions. [2022-12-06 02:38:50,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 273 transitions, 5598 flow [2022-12-06 02:38:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:38:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:38:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 02:38:50,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 02:38:50,339 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 33 predicate places. [2022-12-06 02:38:50,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:50,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 273 transitions, 5598 flow [2022-12-06 02:38:50,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 273 transitions, 5598 flow [2022-12-06 02:38:50,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:50,346 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:50,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 02:38:50,347 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 273 transitions, 5598 flow [2022-12-06 02:38:50,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-06 02:38:50,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:50,347 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:50,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 02:38:50,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:50,553 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1999872967, now seen corresponding path program 2 times [2022-12-06 02:38:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:50,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410254466] [2022-12-06 02:38:50,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:50,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:50,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:50,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410254466] [2022-12-06 02:38:50,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410254466] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:50,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236975259] [2022-12-06 02:38:50,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:38:50,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:50,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:50,603 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:38:50,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 02:38:50,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:38:50,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:38:50,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 02:38:50,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:50,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:50,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236975259] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:38:50,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:38:50,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 02:38:50,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795518920] [2022-12-06 02:38:50,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:38:50,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:38:50,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:50,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:38:50,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:38:50,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:38:50,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 273 transitions, 5598 flow. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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-06 02:38:50,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:50,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:38:50,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:50,992 INFO L130 PetriNetUnfolder]: 247/550 cut-off events. [2022-12-06 02:38:50,992 INFO L131 PetriNetUnfolder]: For 715/715 co-relation queries the response was YES. [2022-12-06 02:38:50,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5930 conditions, 550 events. 247/550 cut-off events. For 715/715 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2916 event pairs, 2 based on Foata normal form. 0/484 useless extension candidates. Maximal degree in co-relation 2728. Up to 346 conditions per place. [2022-12-06 02:38:50,995 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 83 selfloop transitions, 16 changer transitions 186/285 dead transitions. [2022-12-06 02:38:50,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 285 transitions, 6414 flow [2022-12-06 02:38:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:38:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:38:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-12-06 02:38:50,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40625 [2022-12-06 02:38:50,997 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 40 predicate places. [2022-12-06 02:38:50,997 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:50,997 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 285 transitions, 6414 flow [2022-12-06 02:38:51,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 285 transitions, 6414 flow [2022-12-06 02:38:51,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:51,004 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:51,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 02:38:51,005 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 285 transitions, 6414 flow [2022-12-06 02:38:51,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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-06 02:38:51,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:51,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:51,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 02:38:51,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:51,213 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:51,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:51,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2066931433, now seen corresponding path program 4 times [2022-12-06 02:38:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:51,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632833226] [2022-12-06 02:38:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:51,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:51,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632833226] [2022-12-06 02:38:51,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632833226] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:51,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104051837] [2022-12-06 02:38:51,294 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:38:51,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:51,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:51,295 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:38:51,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 02:38:51,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:38:51,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:38:51,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 02:38:51,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:51,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:51,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104051837] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:38:51,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:38:51,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 02:38:51,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841595857] [2022-12-06 02:38:51,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:38:51,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:38:51,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:51,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:38:51,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:38:51,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:38:51,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 285 transitions, 6414 flow. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-06 02:38:51,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:51,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:38:51,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:51,573 INFO L130 PetriNetUnfolder]: 243/540 cut-off events. [2022-12-06 02:38:51,573 INFO L131 PetriNetUnfolder]: For 702/702 co-relation queries the response was YES. [2022-12-06 02:38:51,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6358 conditions, 540 events. 243/540 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2847 event pairs, 2 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 2883. Up to 332 conditions per place. [2022-12-06 02:38:51,577 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 78 selfloop transitions, 17 changer transitions 186/281 dead transitions. [2022-12-06 02:38:51,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 281 transitions, 6882 flow [2022-12-06 02:38:51,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:38:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:38:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-12-06 02:38:51,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35625 [2022-12-06 02:38:51,578 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 47 predicate places. [2022-12-06 02:38:51,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:51,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 281 transitions, 6882 flow [2022-12-06 02:38:51,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 281 transitions, 6882 flow [2022-12-06 02:38:51,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:51,586 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:51,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:38:51,587 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 281 transitions, 6882 flow [2022-12-06 02:38:51,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-06 02:38:51,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:51,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:51,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 02:38:51,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:51,792 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:51,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:51,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1152184717, now seen corresponding path program 3 times [2022-12-06 02:38:51,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:51,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184185161] [2022-12-06 02:38:51,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:51,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:51,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:51,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184185161] [2022-12-06 02:38:51,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184185161] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:51,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418261258] [2022-12-06 02:38:51,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:38:51,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:51,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:51,856 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:38:51,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 02:38:51,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:38:51,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:38:51,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 02:38:51,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:51,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:51,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418261258] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:38:51,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:38:51,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 02:38:51,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624480654] [2022-12-06 02:38:51,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:38:51,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:38:51,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:51,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:38:51,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:38:51,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 02:38:51,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 281 transitions, 6882 flow. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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-06 02:38:51,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:51,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 02:38:51,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:52,173 INFO L130 PetriNetUnfolder]: 235/524 cut-off events. [2022-12-06 02:38:52,173 INFO L131 PetriNetUnfolder]: For 708/708 co-relation queries the response was YES. [2022-12-06 02:38:52,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6689 conditions, 524 events. 235/524 cut-off events. For 708/708 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2775 event pairs, 4 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 2945. Up to 332 conditions per place. [2022-12-06 02:38:52,177 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 75 selfloop transitions, 12 changer transitions 186/273 dead transitions. [2022-12-06 02:38:52,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 273 transitions, 7230 flow [2022-12-06 02:38:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:38:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:38:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 02:38:52,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-06 02:38:52,179 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 51 predicate places. [2022-12-06 02:38:52,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:52,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 273 transitions, 7230 flow [2022-12-06 02:38:52,186 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 273 transitions, 7230 flow [2022-12-06 02:38:52,186 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:52,187 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:52,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 02:38:52,188 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 273 transitions, 7230 flow [2022-12-06 02:38:52,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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-06 02:38:52,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:52,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:52,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 02:38:52,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 02:38:52,392 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:52,393 INFO L85 PathProgramCache]: Analyzing trace with hash 212702857, now seen corresponding path program 1 times [2022-12-06 02:38:52,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:52,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134610126] [2022-12-06 02:38:52,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:52,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:52,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:52,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134610126] [2022-12-06 02:38:52,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134610126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:52,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382546] [2022-12-06 02:38:52,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:52,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:52,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:52,585 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:38:52,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 02:38:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:52,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 02:38:52,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:52,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 34 treesize of output 10 [2022-12-06 02:38:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:38:52,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:52,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 36 treesize of output 12 [2022-12-06 02:38:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:38:52,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382546] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:38:52,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:38:52,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-12-06 02:38:52,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359206023] [2022-12-06 02:38:52,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:38:52,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 02:38:52,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:52,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 02:38:52,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 02:38:52,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 02:38:52,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 273 transitions, 7230 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-06 02:38:52,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:52,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 02:38:52,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:53,075 INFO L130 PetriNetUnfolder]: 488/1024 cut-off events. [2022-12-06 02:38:53,075 INFO L131 PetriNetUnfolder]: For 1949/1949 co-relation queries the response was YES. [2022-12-06 02:38:53,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14013 conditions, 1024 events. 488/1024 cut-off events. For 1949/1949 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6023 event pairs, 4 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 4334. Up to 760 conditions per place. [2022-12-06 02:38:53,082 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 157 selfloop transitions, 34 changer transitions 291/488 dead transitions. [2022-12-06 02:38:53,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 488 transitions, 13915 flow [2022-12-06 02:38:53,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 02:38:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 02:38:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-12-06 02:38:53,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5875 [2022-12-06 02:38:53,083 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 58 predicate places. [2022-12-06 02:38:53,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:53,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 488 transitions, 13915 flow [2022-12-06 02:38:53,095 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 488 transitions, 13915 flow [2022-12-06 02:38:53,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:55,357 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:38:55,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2275 [2022-12-06 02:38:55,358 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 487 transitions, 13887 flow [2022-12-06 02:38:55,358 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-06 02:38:55,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:55,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:55,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 02:38:55,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 02:38:55,563 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:55,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash -28816793, now seen corresponding path program 1 times [2022-12-06 02:38:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:55,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856582940] [2022-12-06 02:38:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:55,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:55,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856582940] [2022-12-06 02:38:55,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856582940] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:55,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62016303] [2022-12-06 02:38:55,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:55,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:55,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:55,800 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:38:55,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 02:38:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:55,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 02:38:55,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:55,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 34 treesize of output 10 [2022-12-06 02:38:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:55,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:55,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 36 treesize of output 12 [2022-12-06 02:38:55,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:38:55,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62016303] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:38:55,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:38:55,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 02:38:55,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584406270] [2022-12-06 02:38:55,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:38:55,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:38:55,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:55,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:38:55,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:38:55,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 02:38:55,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 487 transitions, 13887 flow. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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-06 02:38:55,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:55,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 02:38:55,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:56,463 INFO L130 PetriNetUnfolder]: 942/1897 cut-off events. [2022-12-06 02:38:56,463 INFO L131 PetriNetUnfolder]: For 4945/4945 co-relation queries the response was YES. [2022-12-06 02:38:56,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27721 conditions, 1897 events. 942/1897 cut-off events. For 4945/4945 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12355 event pairs, 10 based on Foata normal form. 4/1590 useless extension candidates. Maximal degree in co-relation 4625. Up to 1483 conditions per place. [2022-12-06 02:38:56,474 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 249 selfloop transitions, 35 changer transitions 558/848 dead transitions. [2022-12-06 02:38:56,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 848 transitions, 25900 flow [2022-12-06 02:38:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:38:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:38:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 150 transitions. [2022-12-06 02:38:56,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 02:38:56,475 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 71 predicate places. [2022-12-06 02:38:56,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:56,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 848 transitions, 25900 flow [2022-12-06 02:38:56,516 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 848 transitions, 25900 flow [2022-12-06 02:38:56,516 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:57,630 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 02:38:57,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1156 [2022-12-06 02:38:57,631 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 846 transitions, 25840 flow [2022-12-06 02:38:57,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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-06 02:38:57,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:57,631 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:57,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 02:38:57,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 02:38:57,837 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:38:57,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1100136706, now seen corresponding path program 1 times [2022-12-06 02:38:57,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:57,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686186971] [2022-12-06 02:38:57,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:57,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:38:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:58,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686186971] [2022-12-06 02:38:58,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686186971] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:58,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762223309] [2022-12-06 02:38:58,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:58,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:58,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:58,433 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:38:58,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 02:38:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:58,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 02:38:58,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:58,557 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-06 02:38:58,560 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-06 02:38:58,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:58,649 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 02:38:58,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2022-12-06 02:38:58,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 29 treesize of output 21 [2022-12-06 02:38:58,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 19 treesize of output 7 [2022-12-06 02:38:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:38:58,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:58,737 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_487) c_~f_inv~0.base) (+ (* c_~counter~0 4) c_~f_inv~0.offset)) 0)) is different from false [2022-12-06 02:38:58,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:58,815 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 1 case distinctions, treesize of input 128 treesize of output 88 [2022-12-06 02:38:58,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:58,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 537 treesize of output 447 [2022-12-06 02:38:58,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:58,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 420 treesize of output 372 [2022-12-06 02:38:58,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:58,890 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 230 treesize of output 210 [2022-12-06 02:39:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 02:39:00,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762223309] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:00,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:00,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 02:39:00,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687539475] [2022-12-06 02:39:00,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:00,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 02:39:00,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:00,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 02:39:00,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=162, Unknown=1, NotChecked=26, Total=240 [2022-12-06 02:39:00,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 02:39:00,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 846 transitions, 25840 flow. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 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-06 02:39:00,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:00,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 02:39:00,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:39:01,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:39:03,074 INFO L130 PetriNetUnfolder]: 1437/2849 cut-off events. [2022-12-06 02:39:03,074 INFO L131 PetriNetUnfolder]: For 9753/9753 co-relation queries the response was YES. [2022-12-06 02:39:03,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44311 conditions, 2849 events. 1437/2849 cut-off events. For 9753/9753 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20063 event pairs, 12 based on Foata normal form. 3/2340 useless extension candidates. Maximal degree in co-relation 6680. Up to 2356 conditions per place. [2022-12-06 02:39:03,086 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 215 selfloop transitions, 56 changer transitions 954/1231 dead transitions. [2022-12-06 02:39:03,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 1231 transitions, 40100 flow [2022-12-06 02:39:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:39:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:39:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 155 transitions. [2022-12-06 02:39:03,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4813664596273292 [2022-12-06 02:39:03,088 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 82 predicate places. [2022-12-06 02:39:03,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:03,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 1231 transitions, 40100 flow [2022-12-06 02:39:03,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 1231 transitions, 40100 flow [2022-12-06 02:39:03,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:03,159 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:39:03,160 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 02:39:03,160 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 1231 transitions, 40100 flow [2022-12-06 02:39:03,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 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-06 02:39:03,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:39:03,160 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:03,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 02:39:03,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 02:39:03,361 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:39:03,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:39:03,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1223027474, now seen corresponding path program 2 times [2022-12-06 02:39:03,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:39:03,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156218216] [2022-12-06 02:39:03,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:03,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:39:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:03,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:39:03,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156218216] [2022-12-06 02:39:03,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156218216] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:39:03,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015630090] [2022-12-06 02:39:03,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:39:03,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:03,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:39:03,426 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:39:03,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 02:39:03,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:39:03,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:39:03,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:39:03,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:39:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:03,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:39:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:03,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015630090] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:03,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:03,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-06 02:39:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207754826] [2022-12-06 02:39:03,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:03,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:39:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:03,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:39:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:39:03,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 02:39:03,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 1231 transitions, 40100 flow. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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-06 02:39:03,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:03,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 02:39:03,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:39:04,847 INFO L130 PetriNetUnfolder]: 1647/3339 cut-off events. [2022-12-06 02:39:04,847 INFO L131 PetriNetUnfolder]: For 9702/9702 co-relation queries the response was YES. [2022-12-06 02:39:04,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55557 conditions, 3339 events. 1647/3339 cut-off events. For 9702/9702 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 24460 event pairs, 6 based on Foata normal form. 0/2713 useless extension candidates. Maximal degree in co-relation 9021. Up to 2846 conditions per place. [2022-12-06 02:39:04,863 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 343 selfloop transitions, 80 changer transitions 1269/1692 dead transitions. [2022-12-06 02:39:04,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1692 transitions, 58485 flow [2022-12-06 02:39:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:39:04,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:39:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 122 transitions. [2022-12-06 02:39:04,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2791762013729977 [2022-12-06 02:39:04,864 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 100 predicate places. [2022-12-06 02:39:04,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:04,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 1692 transitions, 58485 flow [2022-12-06 02:39:04,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 1692 transitions, 58485 flow [2022-12-06 02:39:04,906 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:04,909 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:39:04,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 02:39:04,910 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 1692 transitions, 58485 flow [2022-12-06 02:39:04,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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-06 02:39:04,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:39:04,910 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:04,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 02:39:05,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 02:39:05,116 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:39:05,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:39:05,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1118018266, now seen corresponding path program 3 times [2022-12-06 02:39:05,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:39:05,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132651259] [2022-12-06 02:39:05,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:05,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:39:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:05,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:39:05,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132651259] [2022-12-06 02:39:05,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132651259] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:39:05,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585852925] [2022-12-06 02:39:05,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:39:05,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:05,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:39:05,189 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:39:05,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 02:39:05,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:39:05,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:39:05,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:39:05,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:39:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:05,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:39:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:39:05,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585852925] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:05,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:05,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-06 02:39:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119136676] [2022-12-06 02:39:05,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:05,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:39:05,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:05,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:39:05,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:39:05,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 02:39:05,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 1692 transitions, 58485 flow. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-06 02:39:05,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:05,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 02:39:05,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:39:06,944 INFO L130 PetriNetUnfolder]: 1667/3381 cut-off events. [2022-12-06 02:39:06,944 INFO L131 PetriNetUnfolder]: For 9737/9737 co-relation queries the response was YES. [2022-12-06 02:39:06,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59645 conditions, 3381 events. 1667/3381 cut-off events. For 9737/9737 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 24997 event pairs, 0 based on Foata normal form. 0/2755 useless extension candidates. Maximal degree in co-relation 9756. Up to 2888 conditions per place. [2022-12-06 02:39:06,962 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 366 selfloop transitions, 58 changer transitions 1322/1746 dead transitions. [2022-12-06 02:39:06,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 1746 transitions, 63813 flow [2022-12-06 02:39:06,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 02:39:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 02:39:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2022-12-06 02:39:06,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32806324110671936 [2022-12-06 02:39:06,963 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 109 predicate places. [2022-12-06 02:39:06,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:06,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 1746 transitions, 63813 flow [2022-12-06 02:39:07,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 1746 transitions, 63813 flow [2022-12-06 02:39:07,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:07,014 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:39:07,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 02:39:07,014 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 1746 transitions, 63813 flow [2022-12-06 02:39:07,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-06 02:39:07,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:39:07,015 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:07,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 02:39:07,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 02:39:07,220 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:39:07,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:39:07,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1896449178, now seen corresponding path program 4 times [2022-12-06 02:39:07,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:39:07,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245017805] [2022-12-06 02:39:07,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:07,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:39:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:07,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:39:07,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245017805] [2022-12-06 02:39:07,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245017805] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:39:07,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442823794] [2022-12-06 02:39:07,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:39:07,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:07,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:39:07,283 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:39:07,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 02:39:07,360 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:39:07,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:39:07,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:39:07,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:39:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:07,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:39:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:07,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442823794] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:07,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:07,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-06 02:39:07,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712270311] [2022-12-06 02:39:07,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:07,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:39:07,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:07,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:39:07,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:39:07,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 02:39:07,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 1746 transitions, 63813 flow. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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-06 02:39:07,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:07,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 02:39:07,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:39:09,465 INFO L130 PetriNetUnfolder]: 1883/3898 cut-off events. [2022-12-06 02:39:09,465 INFO L131 PetriNetUnfolder]: For 9719/9719 co-relation queries the response was YES. [2022-12-06 02:39:09,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72922 conditions, 3898 events. 1883/3898 cut-off events. For 9719/9719 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 29877 event pairs, 0 based on Foata normal form. 0/3152 useless extension candidates. Maximal degree in co-relation 12597. Up to 3405 conditions per place. [2022-12-06 02:39:09,482 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 443 selfloop transitions, 113 changer transitions 1551/2107 dead transitions. [2022-12-06 02:39:09,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 2107 transitions, 81263 flow [2022-12-06 02:39:09,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 02:39:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 02:39:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 136 transitions. [2022-12-06 02:39:09,483 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2463768115942029 [2022-12-06 02:39:09,483 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 132 predicate places. [2022-12-06 02:39:09,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:09,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 2107 transitions, 81263 flow [2022-12-06 02:39:09,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 2107 transitions, 81263 flow [2022-12-06 02:39:09,540 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:09,543 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:39:09,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 02:39:09,543 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 2107 transitions, 81263 flow [2022-12-06 02:39:09,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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-06 02:39:09,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:39:09,544 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:09,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 02:39:09,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:09,749 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:39:09,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:39:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2001458386, now seen corresponding path program 5 times [2022-12-06 02:39:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:39:09,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194534272] [2022-12-06 02:39:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:39:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:09,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:39:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194534272] [2022-12-06 02:39:09,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194534272] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:39:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039556338] [2022-12-06 02:39:09,818 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:39:09,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:09,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:39:09,819 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:39:09,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 02:39:09,926 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:39:09,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:39:09,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:39:09,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:39:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:09,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:39:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:39:09,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039556338] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:09,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:09,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-06 02:39:09,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936163740] [2022-12-06 02:39:09,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:09,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:39:09,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:09,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:39:09,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:39:09,998 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 02:39:09,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 2107 transitions, 81263 flow. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-06 02:39:09,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:09,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 02:39:09,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:39:12,262 INFO L130 PetriNetUnfolder]: 1919/3943 cut-off events. [2022-12-06 02:39:12,263 INFO L131 PetriNetUnfolder]: For 9819/9819 co-relation queries the response was YES. [2022-12-06 02:39:12,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77705 conditions, 3943 events. 1919/3943 cut-off events. For 9819/9819 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30269 event pairs, 0 based on Foata normal form. 0/3197 useless extension candidates. Maximal degree in co-relation 13524. Up to 3450 conditions per place. [2022-12-06 02:39:12,280 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 465 selfloop transitions, 81 changer transitions 1586/2132 dead transitions. [2022-12-06 02:39:12,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 2132 transitions, 86429 flow [2022-12-06 02:39:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:39:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:39:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 99 transitions. [2022-12-06 02:39:12,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28695652173913044 [2022-12-06 02:39:12,281 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 145 predicate places. [2022-12-06 02:39:12,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:12,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 2132 transitions, 86429 flow [2022-12-06 02:39:12,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 2132 transitions, 86429 flow [2022-12-06 02:39:12,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:12,344 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:39:12,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 02:39:12,344 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 2132 transitions, 86429 flow [2022-12-06 02:39:12,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-06 02:39:12,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:39:12,344 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:12,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 02:39:12,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:12,550 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:39:12,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:39:12,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1349064722, now seen corresponding path program 6 times [2022-12-06 02:39:12,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:39:12,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678350819] [2022-12-06 02:39:12,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:12,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:39:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:12,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:39:12,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678350819] [2022-12-06 02:39:12,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678350819] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:39:12,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934990216] [2022-12-06 02:39:12,690 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:39:12,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:12,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:39:12,692 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:39:12,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 02:39:12,841 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 02:39:12,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:39:12,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:39:12,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:39:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:12,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:39:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:12,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934990216] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:12,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:12,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-06 02:39:12,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188386462] [2022-12-06 02:39:12,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:12,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:39:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:12,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:39:12,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:39:12,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 02:39:12,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 2132 transitions, 86429 flow. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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-06 02:39:12,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:12,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 02:39:12,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:39:15,470 INFO L130 PetriNetUnfolder]: 2111/4349 cut-off events. [2022-12-06 02:39:15,470 INFO L131 PetriNetUnfolder]: For 9869/9869 co-relation queries the response was YES. [2022-12-06 02:39:15,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90223 conditions, 4349 events. 2111/4349 cut-off events. For 9869/9869 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 33884 event pairs, 0 based on Foata normal form. 0/3507 useless extension candidates. Maximal degree in co-relation 16231. Up to 3856 conditions per place. [2022-12-06 02:39:15,491 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 499 selfloop transitions, 150 changer transitions 1737/2386 dead transitions. [2022-12-06 02:39:15,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 2386 transitions, 101505 flow [2022-12-06 02:39:15,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 02:39:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 02:39:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-12-06 02:39:15,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25691699604743085 [2022-12-06 02:39:15,492 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 166 predicate places. [2022-12-06 02:39:15,493 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:15,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 2386 transitions, 101505 flow [2022-12-06 02:39:15,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 2386 transitions, 101505 flow [2022-12-06 02:39:15,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:15,574 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:39:15,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-06 02:39:15,575 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 2386 transitions, 101505 flow [2022-12-06 02:39:15,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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-06 02:39:15,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:39:15,575 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:15,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 02:39:15,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:15,780 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:39:15,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:39:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash 977550994, now seen corresponding path program 7 times [2022-12-06 02:39:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:39:15,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000691251] [2022-12-06 02:39:15,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:15,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:39:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:15,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:39:15,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000691251] [2022-12-06 02:39:15,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000691251] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:39:15,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547367024] [2022-12-06 02:39:15,842 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:39:15,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:15,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:39:15,843 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:39:15,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 02:39:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:15,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:39:15,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:39:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:15,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:39:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:16,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547367024] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:16,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:16,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-06 02:39:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268325052] [2022-12-06 02:39:16,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:16,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:39:16,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:16,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:39:16,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:39:16,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 02:39:16,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 2386 transitions, 101505 flow. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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-06 02:39:16,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:16,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 02:39:16,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:39:19,113 INFO L130 PetriNetUnfolder]: 2099/4314 cut-off events. [2022-12-06 02:39:19,113 INFO L131 PetriNetUnfolder]: For 9747/9747 co-relation queries the response was YES. [2022-12-06 02:39:19,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93787 conditions, 4314 events. 2099/4314 cut-off events. For 9747/9747 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 33589 event pairs, 0 based on Foata normal form. 0/3488 useless extension candidates. Maximal degree in co-relation 16853. Up to 3821 conditions per place. [2022-12-06 02:39:19,133 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 517 selfloop transitions, 104 changer transitions 1742/2363 dead transitions. [2022-12-06 02:39:19,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 2363 transitions, 105217 flow [2022-12-06 02:39:19,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:39:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:39:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 95 transitions. [2022-12-06 02:39:19,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2950310559006211 [2022-12-06 02:39:19,134 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 178 predicate places. [2022-12-06 02:39:19,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:19,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 2363 transitions, 105217 flow [2022-12-06 02:39:19,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 2363 transitions, 105217 flow [2022-12-06 02:39:19,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:19,202 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:39:19,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 02:39:19,203 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 2363 transitions, 105217 flow [2022-12-06 02:39:19,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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-06 02:39:19,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:39:19,203 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:19,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 02:39:19,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:19,408 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:39:19,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:39:19,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1013916225, now seen corresponding path program 1 times [2022-12-06 02:39:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:39:19,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938639145] [2022-12-06 02:39:19,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:39:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:20,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:39:20,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938639145] [2022-12-06 02:39:20,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938639145] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:39:20,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251327752] [2022-12-06 02:39:20,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:20,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:20,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:39:20,111 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:39:20,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 02:39:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:20,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 02:39:20,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:39:20,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:39:20,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2022-12-06 02:39:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:39:20,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:39:20,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:39:20,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 31 [2022-12-06 02:39:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:39:20,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251327752] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:20,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:20,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 2, 2] total 8 [2022-12-06 02:39:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656183167] [2022-12-06 02:39:20,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:20,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 02:39:20,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 02:39:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:39:20,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 02:39:20,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 2363 transitions, 105217 flow. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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-06 02:39:20,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:20,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 02:39:20,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:39:23,641 INFO L130 PetriNetUnfolder]: 2564/5256 cut-off events. [2022-12-06 02:39:23,641 INFO L131 PetriNetUnfolder]: For 13909/13909 co-relation queries the response was YES. [2022-12-06 02:39:23,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119400 conditions, 5256 events. 2564/5256 cut-off events. For 13909/13909 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 42150 event pairs, 0 based on Foata normal form. 12/4233 useless extension candidates. Maximal degree in co-relation 22363. Up to 4739 conditions per place. [2022-12-06 02:39:23,772 INFO L137 encePairwiseOnDemand]: 10/23 looper letters, 594 selfloop transitions, 135 changer transitions 2203/2939 dead transitions. [2022-12-06 02:39:23,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 2939 transitions, 136661 flow [2022-12-06 02:39:23,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 02:39:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 02:39:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-12-06 02:39:23,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3952569169960474 [2022-12-06 02:39:23,774 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 188 predicate places. [2022-12-06 02:39:23,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:23,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 2939 transitions, 136661 flow [2022-12-06 02:39:23,872 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 2939 transitions, 136661 flow [2022-12-06 02:39:23,872 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:34,573 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 02:39:34,574 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10800 [2022-12-06 02:39:34,574 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 2937 transitions, 136569 flow [2022-12-06 02:39:34,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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-06 02:39:34,574 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:39:34,574 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:34,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-06 02:39:34,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:34,779 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:39:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:39:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1130482531, now seen corresponding path program 1 times [2022-12-06 02:39:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:39:34,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041829591] [2022-12-06 02:39:34,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:39:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:35,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:39:35,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041829591] [2022-12-06 02:39:35,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041829591] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:39:35,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608311386] [2022-12-06 02:39:35,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:35,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:35,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:39:35,319 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:39:35,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 02:39:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:35,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 02:39:35,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:39:35,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 32 [2022-12-06 02:39:35,500 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 02:39:35,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 36 [2022-12-06 02:39:35,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 15 [2022-12-06 02:39:35,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 23 treesize of output 7 [2022-12-06 02:39:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:35,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:39:35,547 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_869 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_869) c_~f_inv~0.base) (+ (* c_~counter~0 4) c_~f_inv~0.offset)) 0)) is different from false [2022-12-06 02:39:35,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:39:35,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 49 [2022-12-06 02:39:35,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2022-12-06 02:39:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 02:39:35,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608311386] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:35,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:35,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 02:39:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606791466] [2022-12-06 02:39:35,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:35,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:39:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:35,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:39:35,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2022-12-06 02:39:35,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 02:39:35,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 2937 transitions, 136569 flow. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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-06 02:39:35,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:35,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 02:39:35,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:39:38,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-06 02:39:40,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:39:44,352 INFO L130 PetriNetUnfolder]: 2805/5686 cut-off events. [2022-12-06 02:39:44,352 INFO L131 PetriNetUnfolder]: For 19747/19747 co-relation queries the response was YES. [2022-12-06 02:39:44,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134519 conditions, 5686 events. 2805/5686 cut-off events. For 19747/19747 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 45774 event pairs, 0 based on Foata normal form. 1/4539 useless extension candidates. Maximal degree in co-relation 24502. Up to 5143 conditions per place. [2022-12-06 02:39:44,380 INFO L137 encePairwiseOnDemand]: 9/27 looper letters, 722 selfloop transitions, 113 changer transitions 2296/3138 dead transitions. [2022-12-06 02:39:44,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 3138 transitions, 152208 flow [2022-12-06 02:39:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:39:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:39:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 127 transitions. [2022-12-06 02:39:44,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36182336182336183 [2022-12-06 02:39:44,382 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 198 predicate places. [2022-12-06 02:39:44,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:44,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 3138 transitions, 152208 flow [2022-12-06 02:39:44,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 3138 transitions, 152208 flow [2022-12-06 02:39:44,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:44,485 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:39:44,486 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 02:39:44,486 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 3138 transitions, 152208 flow [2022-12-06 02:39:44,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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-06 02:39:44,486 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:39:44,486 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:44,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-06 02:39:44,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:44,688 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:39:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:39:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1282604702, now seen corresponding path program 1 times [2022-12-06 02:39:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:39:44,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325548484] [2022-12-06 02:39:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:39:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:45,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:39:45,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325548484] [2022-12-06 02:39:45,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325548484] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:39:45,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738652035] [2022-12-06 02:39:45,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:45,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:45,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:39:45,421 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:39:45,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 02:39:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:45,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 02:39:45,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:39:45,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 32 [2022-12-06 02:39:45,613 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 02:39:45,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 36 [2022-12-06 02:39:45,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 15 [2022-12-06 02:39:45,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 23 treesize of output 7 [2022-12-06 02:39:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:45,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:39:45,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:39:45,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 49 [2022-12-06 02:39:45,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 7 [2022-12-06 02:39:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:45,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738652035] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:45,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:45,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 02:39:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240922925] [2022-12-06 02:39:45,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:45,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 02:39:45,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:45,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 02:39:45,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=141, Unknown=2, NotChecked=0, Total=182 [2022-12-06 02:39:45,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-06 02:39:45,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 3138 transitions, 152208 flow. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-06 02:39:45,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:45,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-06 02:39:45,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:39:49,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 02:39:54,231 INFO L130 PetriNetUnfolder]: 3209/6465 cut-off events. [2022-12-06 02:39:54,231 INFO L131 PetriNetUnfolder]: For 28696/28696 co-relation queries the response was YES. [2022-12-06 02:39:54,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159036 conditions, 6465 events. 3209/6465 cut-off events. For 28696/28696 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 52952 event pairs, 0 based on Foata normal form. 1/5118 useless extension candidates. Maximal degree in co-relation 27000. Up to 5875 conditions per place. [2022-12-06 02:39:54,267 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 857 selfloop transitions, 174 changer transitions 2478/3516 dead transitions. [2022-12-06 02:39:54,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 3516 transitions, 177630 flow [2022-12-06 02:39:54,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:39:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:39:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 132 transitions. [2022-12-06 02:39:54,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3492063492063492 [2022-12-06 02:39:54,268 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 211 predicate places. [2022-12-06 02:39:54,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:54,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 233 places, 3516 transitions, 177630 flow [2022-12-06 02:39:54,389 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 3516 transitions, 177630 flow [2022-12-06 02:39:54,389 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:54,395 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:39:54,396 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 02:39:54,396 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 3516 transitions, 177630 flow [2022-12-06 02:39:54,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-06 02:39:54,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:39:54,396 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:54,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 02:39:54,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-06 02:39:54,601 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:39:54,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:39:54,601 INFO L85 PathProgramCache]: Analyzing trace with hash -615767172, now seen corresponding path program 2 times [2022-12-06 02:39:54,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:39:54,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242888408] [2022-12-06 02:39:54,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:39:54,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:39:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:39:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:54,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:39:54,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242888408] [2022-12-06 02:39:54,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242888408] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:39:54,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550986346] [2022-12-06 02:39:54,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:39:54,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:39:54,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:39:54,661 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:39:54,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-06 02:39:54,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:39:54,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:39:54,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:39:54,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:39:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:54,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:39:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:39:54,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550986346] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:39:54,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:39:54,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-06 02:39:54,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176284117] [2022-12-06 02:39:54,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:39:54,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:39:54,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:39:54,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:39:54,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:39:54,851 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:39:54,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 3516 transitions, 177630 flow. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 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-06 02:39:54,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:39:54,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:39:54,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:03,583 INFO L130 PetriNetUnfolder]: 3981/8022 cut-off events. [2022-12-06 02:40:03,584 INFO L131 PetriNetUnfolder]: For 28874/28874 co-relation queries the response was YES. [2022-12-06 02:40:03,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206163 conditions, 8022 events. 3981/8022 cut-off events. For 28874/28874 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 68128 event pairs, 3 based on Foata normal form. 0/6298 useless extension candidates. Maximal degree in co-relation 35004. Up to 7432 conditions per place. [2022-12-06 02:40:03,626 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 1114 selfloop transitions, 164 changer transitions 3006/4284 dead transitions. [2022-12-06 02:40:03,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 4284 transitions, 225135 flow [2022-12-06 02:40:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 02:40:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 02:40:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 119 transitions. [2022-12-06 02:40:03,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3148148148148148 [2022-12-06 02:40:03,630 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 224 predicate places. [2022-12-06 02:40:03,630 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:03,630 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 4284 transitions, 225135 flow [2022-12-06 02:40:03,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 246 places, 4284 transitions, 225135 flow [2022-12-06 02:40:03,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:03,792 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:03,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 02:40:03,792 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 4284 transitions, 225135 flow [2022-12-06 02:40:03,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 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-06 02:40:03,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:03,793 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:03,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-06 02:40:03,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-06 02:40:03,993 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:40:03,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:03,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1208757999, now seen corresponding path program 2 times [2022-12-06 02:40:03,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:03,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503846659] [2022-12-06 02:40:03,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:03,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:04,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:04,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503846659] [2022-12-06 02:40:04,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503846659] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:04,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915615424] [2022-12-06 02:40:04,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:40:04,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:04,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:04,181 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:40:04,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-06 02:40:04,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:40:04,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:04,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:40:04,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:04,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:04,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915615424] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:04,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:04,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-06 02:40:04,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951989636] [2022-12-06 02:40:04,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:04,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:40:04,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:04,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:40:04,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:40:04,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:40:04,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 4284 transitions, 225135 flow. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-06 02:40:04,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:04,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:40:04,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:18,217 INFO L130 PetriNetUnfolder]: 4288/8574 cut-off events. [2022-12-06 02:40:18,217 INFO L131 PetriNetUnfolder]: For 29979/29979 co-relation queries the response was YES. [2022-12-06 02:40:18,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229035 conditions, 8574 events. 4288/8574 cut-off events. For 29979/29979 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 73266 event pairs, 0 based on Foata normal form. 0/6752 useless extension candidates. Maximal degree in co-relation 38686. Up to 7972 conditions per place. [2022-12-06 02:40:18,263 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 1179 selfloop transitions, 171 changer transitions 3176/4526 dead transitions. [2022-12-06 02:40:18,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 4526 transitions, 246894 flow [2022-12-06 02:40:18,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 02:40:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 02:40:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-12-06 02:40:18,264 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-06 02:40:18,264 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 230 predicate places. [2022-12-06 02:40:18,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:18,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 4526 transitions, 246894 flow [2022-12-06 02:40:18,431 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 4526 transitions, 246894 flow [2022-12-06 02:40:18,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:18,437 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:18,438 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 02:40:18,438 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 4526 transitions, 246894 flow [2022-12-06 02:40:18,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-06 02:40:18,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:18,438 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:18,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-06 02:40:18,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-06 02:40:18,639 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:40:18,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:18,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1792485613, now seen corresponding path program 3 times [2022-12-06 02:40:18,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:18,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079412338] [2022-12-06 02:40:18,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:18,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:18,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:18,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079412338] [2022-12-06 02:40:18,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079412338] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:18,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927618177] [2022-12-06 02:40:18,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:40:18,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:18,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:18,718 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:40:18,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-06 02:40:18,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:40:18,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:18,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:40:18,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:18,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:18,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927618177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:18,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:18,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-06 02:40:18,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016472655] [2022-12-06 02:40:18,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:18,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 02:40:18,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:18,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 02:40:18,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-06 02:40:18,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:40:18,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 4526 transitions, 246894 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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-06 02:40:18,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:18,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:40:18,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:40:39,052 INFO L130 PetriNetUnfolder]: 4367/8853 cut-off events. [2022-12-06 02:40:39,053 INFO L131 PetriNetUnfolder]: For 30145/30145 co-relation queries the response was YES. [2022-12-06 02:40:39,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245484 conditions, 8853 events. 4367/8853 cut-off events. For 30145/30145 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 77237 event pairs, 2 based on Foata normal form. 0/7031 useless extension candidates. Maximal degree in co-relation 40720. Up to 8251 conditions per place. [2022-12-06 02:40:39,104 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 1125 selfloop transitions, 272 changer transitions 3535/4932 dead transitions. [2022-12-06 02:40:39,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 4932 transitions, 278895 flow [2022-12-06 02:40:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:40:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:40:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 98 transitions. [2022-12-06 02:40:39,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2419753086419753 [2022-12-06 02:40:39,106 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 244 predicate places. [2022-12-06 02:40:39,106 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:40:39,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 4932 transitions, 278895 flow [2022-12-06 02:40:39,317 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 4932 transitions, 278895 flow [2022-12-06 02:40:39,317 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:40:39,324 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:40:39,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 02:40:39,325 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 4932 transitions, 278895 flow [2022-12-06 02:40:39,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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-06 02:40:39,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:40:39,325 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:40:39,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-06 02:40:39,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:39,527 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:40:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:40:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash -593604395, now seen corresponding path program 4 times [2022-12-06 02:40:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:40:39,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620990915] [2022-12-06 02:40:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:40:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:40:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:40:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:39,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:40:39,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620990915] [2022-12-06 02:40:39,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620990915] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:40:39,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728121902] [2022-12-06 02:40:39,599 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:40:39,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:40:39,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:40:39,604 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:40:39,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-06 02:40:39,705 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:40:39,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:40:39,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:40:39,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:40:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:39,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:40:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:40:39,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728121902] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:40:39,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:40:39,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-06 02:40:39,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808474165] [2022-12-06 02:40:39,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:40:39,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:40:39,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:40:39,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:40:39,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:40:39,766 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:40:39,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 4932 transitions, 278895 flow. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-06 02:40:39,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:40:39,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:40:39,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:03,242 INFO L130 PetriNetUnfolder]: 4392/8879 cut-off events. [2022-12-06 02:41:03,242 INFO L131 PetriNetUnfolder]: For 29902/29902 co-relation queries the response was YES. [2022-12-06 02:41:03,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255107 conditions, 8879 events. 4392/8879 cut-off events. For 29902/29902 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 77515 event pairs, 0 based on Foata normal form. 0/7083 useless extension candidates. Maximal degree in co-relation 42188. Up to 8277 conditions per place. [2022-12-06 02:41:03,288 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 1101 selfloop transitions, 293 changer transitions 3965/5359 dead transitions. [2022-12-06 02:41:03,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 5359 transitions, 313573 flow [2022-12-06 02:41:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 02:41:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 02:41:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 129 transitions. [2022-12-06 02:41:03,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2275132275132275 [2022-12-06 02:41:03,290 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 264 predicate places. [2022-12-06 02:41:03,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:03,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 5359 transitions, 313573 flow [2022-12-06 02:41:03,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 286 places, 5359 transitions, 313573 flow [2022-12-06 02:41:03,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:03,516 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:03,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 02:41:03,517 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 5359 transitions, 313573 flow [2022-12-06 02:41:03,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-06 02:41:03,517 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:03,517 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:03,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:03,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 02:41:03,722 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:41:03,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:03,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1721554181, now seen corresponding path program 5 times [2022-12-06 02:41:03,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:03,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573622004] [2022-12-06 02:41:03,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:03,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:03,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:03,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573622004] [2022-12-06 02:41:03,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573622004] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:03,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005334988] [2022-12-06 02:41:03,797 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:41:03,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:03,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:03,798 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:41:03,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-06 02:41:03,919 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:41:03,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:03,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:41:03,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:03,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:03,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005334988] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:03,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:03,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-06 02:41:03,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737479242] [2022-12-06 02:41:03,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:03,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:41:03,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:03,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:41:03,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:41:03,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:41:03,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 5359 transitions, 313573 flow. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-06 02:41:03,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:03,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:41:03,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:32,791 INFO L130 PetriNetUnfolder]: 4508/9243 cut-off events. [2022-12-06 02:41:32,792 INFO L131 PetriNetUnfolder]: For 29939/29939 co-relation queries the response was YES. [2022-12-06 02:41:32,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274982 conditions, 9243 events. 4508/9243 cut-off events. For 29939/29939 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 82644 event pairs, 0 based on Foata normal form. 0/7401 useless extension candidates. Maximal degree in co-relation 45308. Up to 8641 conditions per place. [2022-12-06 02:41:32,841 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 1084 selfloop transitions, 300 changer transitions 4222/5606 dead transitions. [2022-12-06 02:41:32,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 5606 transitions, 339336 flow [2022-12-06 02:41:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:41:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:41:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 133 transitions. [2022-12-06 02:41:32,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25925925925925924 [2022-12-06 02:41:32,843 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 282 predicate places. [2022-12-06 02:41:32,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:32,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 304 places, 5606 transitions, 339336 flow [2022-12-06 02:41:33,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 304 places, 5606 transitions, 339336 flow [2022-12-06 02:41:33,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:41:33,167 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:41:33,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 325 [2022-12-06 02:41:33,168 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 5606 transitions, 339336 flow [2022-12-06 02:41:33,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-06 02:41:33,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:41:33,168 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:41:33,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 02:41:33,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-06 02:41:33,374 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:41:33,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:41:33,374 INFO L85 PathProgramCache]: Analyzing trace with hash 324319315, now seen corresponding path program 6 times [2022-12-06 02:41:33,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:41:33,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728786254] [2022-12-06 02:41:33,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:41:33,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:41:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:41:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:41:33,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728786254] [2022-12-06 02:41:33,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728786254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:41:33,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436590939] [2022-12-06 02:41:33,441 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:41:33,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:41:33,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:41:33,443 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:41:33,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-06 02:41:33,578 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:41:33,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:41:33,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:41:33,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:41:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:33,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:41:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:41:33,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436590939] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:41:33,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:41:33,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-06 02:41:33,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279369094] [2022-12-06 02:41:33,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:41:33,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:41:33,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:41:33,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:41:33,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:41:33,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:41:33,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 5606 transitions, 339336 flow. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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-06 02:41:33,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:41:33,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:41:33,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:41:59,755 INFO L130 PetriNetUnfolder]: 4780/9845 cut-off events. [2022-12-06 02:41:59,755 INFO L131 PetriNetUnfolder]: For 29694/29694 co-relation queries the response was YES. [2022-12-06 02:41:59,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302964 conditions, 9845 events. 4780/9845 cut-off events. For 29694/29694 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 89192 event pairs, 0 based on Foata normal form. 0/7903 useless extension candidates. Maximal degree in co-relation 50494. Up to 9243 conditions per place. [2022-12-06 02:41:59,810 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 1116 selfloop transitions, 367 changer transitions 4506/5989 dead transitions. [2022-12-06 02:41:59,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 5989 transitions, 374522 flow [2022-12-06 02:41:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 02:41:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 02:41:59,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 142 transitions. [2022-12-06 02:41:59,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27680311890838205 [2022-12-06 02:41:59,811 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 300 predicate places. [2022-12-06 02:41:59,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:41:59,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 322 places, 5989 transitions, 374522 flow [2022-12-06 02:42:00,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 322 places, 5989 transitions, 374522 flow [2022-12-06 02:42:00,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:42:00,078 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:42:00,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 02:42:00,078 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 5989 transitions, 374522 flow [2022-12-06 02:42:00,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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-06 02:42:00,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:00,079 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:00,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-06 02:42:00,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:42:00,280 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:42:00,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash 219310107, now seen corresponding path program 7 times [2022-12-06 02:42:00,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:00,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435262610] [2022-12-06 02:42:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:00,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:00,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:00,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435262610] [2022-12-06 02:42:00,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435262610] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:42:00,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633123306] [2022-12-06 02:42:00,336 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:42:00,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:42:00,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:42:00,340 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:42:00,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-06 02:42:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:00,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:42:00,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:42:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:00,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:42:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:00,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633123306] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:42:00,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:42:00,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-06 02:42:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945319749] [2022-12-06 02:42:00,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:42:00,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 02:42:00,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:00,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 02:42:00,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-06 02:42:00,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:42:00,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 5989 transitions, 374522 flow. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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-06 02:42:00,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:00,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:42:00,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:42:30,076 INFO L130 PetriNetUnfolder]: 4880/10070 cut-off events. [2022-12-06 02:42:30,077 INFO L131 PetriNetUnfolder]: For 29772/29772 co-relation queries the response was YES. [2022-12-06 02:42:30,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320032 conditions, 10070 events. 4880/10070 cut-off events. For 29772/29772 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 91806 event pairs, 0 based on Foata normal form. 0/8080 useless extension candidates. Maximal degree in co-relation 54053. Up to 9468 conditions per place. [2022-12-06 02:42:30,132 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 1231 selfloop transitions, 301 changer transitions 4600/6132 dead transitions. [2022-12-06 02:42:30,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 6132 transitions, 395718 flow [2022-12-06 02:42:30,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:42:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:42:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-12-06 02:42:30,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32193732193732194 [2022-12-06 02:42:30,134 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 312 predicate places. [2022-12-06 02:42:30,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:42:30,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 334 places, 6132 transitions, 395718 flow [2022-12-06 02:42:30,392 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 334 places, 6132 transitions, 395718 flow [2022-12-06 02:42:30,392 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:42:30,401 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:42:30,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 02:42:30,402 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 6132 transitions, 395718 flow [2022-12-06 02:42:30,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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-06 02:42:30,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:42:30,402 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:30,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 02:42:30,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:42:30,609 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:42:30,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:42:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash -746220967, now seen corresponding path program 8 times [2022-12-06 02:42:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:42:30,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134097779] [2022-12-06 02:42:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:42:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:42:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:42:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:30,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:42:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134097779] [2022-12-06 02:42:30,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134097779] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:42:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502679635] [2022-12-06 02:42:30,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:42:30,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:42:30,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:42:30,678 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:42:30,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-06 02:42:30,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:42:30,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:42:30,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:42:30,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:42:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:30,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:42:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:42:30,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502679635] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:42:30,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:42:30,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-06 02:42:30,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938730197] [2022-12-06 02:42:30,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:42:30,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:42:30,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:42:30,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:42:30,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:42:30,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:42:30,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 6132 transitions, 395718 flow. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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-06 02:42:30,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:42:30,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:42:30,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:05,775 INFO L130 PetriNetUnfolder]: 5226/10934 cut-off events. [2022-12-06 02:43:05,775 INFO L131 PetriNetUnfolder]: For 29992/29992 co-relation queries the response was YES. [2022-12-06 02:43:05,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358751 conditions, 10934 events. 5226/10934 cut-off events. For 29992/29992 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 102201 event pairs, 0 based on Foata normal form. 0/8760 useless extension candidates. Maximal degree in co-relation 61838. Up to 10332 conditions per place. [2022-12-06 02:43:05,913 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 1368 selfloop transitions, 345 changer transitions 4995/6708 dead transitions. [2022-12-06 02:43:05,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 6708 transitions, 446406 flow [2022-12-06 02:43:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:43:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:43:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 149 transitions. [2022-12-06 02:43:05,915 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22074074074074074 [2022-12-06 02:43:05,915 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 336 predicate places. [2022-12-06 02:43:05,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:05,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 358 places, 6708 transitions, 446406 flow [2022-12-06 02:43:06,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 358 places, 6708 transitions, 446406 flow [2022-12-06 02:43:06,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:06,259 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:06,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 345 [2022-12-06 02:43:06,261 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 6708 transitions, 446406 flow [2022-12-06 02:43:06,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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-06 02:43:06,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:06,261 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:06,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-06 02:43:06,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:06,467 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:43:06,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:06,467 INFO L85 PathProgramCache]: Analyzing trace with hash -898553455, now seen corresponding path program 9 times [2022-12-06 02:43:06,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:06,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923292719] [2022-12-06 02:43:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:06,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:06,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:06,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923292719] [2022-12-06 02:43:06,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923292719] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:06,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999413971] [2022-12-06 02:43:06,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:43:06,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:06,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:06,628 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:06,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 02:43:06,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:43:06,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:06,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:43:06,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:06,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:06,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999413971] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:06,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:06,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-06 02:43:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250149355] [2022-12-06 02:43:06,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:06,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:43:06,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:06,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:43:06,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:43:06,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:43:06,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 6708 transitions, 446406 flow. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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-06 02:43:06,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:06,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:43:06,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:43:49,784 INFO L130 PetriNetUnfolder]: 6204/12958 cut-off events. [2022-12-06 02:43:49,784 INFO L131 PetriNetUnfolder]: For 30199/30199 co-relation queries the response was YES. [2022-12-06 02:43:49,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438745 conditions, 12958 events. 6204/12958 cut-off events. For 30199/30199 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 124110 event pairs, 0 based on Foata normal form. 0/10394 useless extension candidates. Maximal degree in co-relation 76334. Up to 12356 conditions per place. [2022-12-06 02:43:49,854 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 1696 selfloop transitions, 352 changer transitions 5909/7957 dead transitions. [2022-12-06 02:43:49,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 7957 transitions, 545483 flow [2022-12-06 02:43:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:43:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:43:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 125 transitions. [2022-12-06 02:43:49,856 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30864197530864196 [2022-12-06 02:43:49,856 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 350 predicate places. [2022-12-06 02:43:49,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:43:49,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 372 places, 7957 transitions, 545483 flow [2022-12-06 02:43:50,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 7957 transitions, 545483 flow [2022-12-06 02:43:50,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:43:50,205 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:43:50,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 350 [2022-12-06 02:43:50,206 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 7957 transitions, 545483 flow [2022-12-06 02:43:50,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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-06 02:43:50,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:43:50,206 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:43:50,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-06 02:43:50,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:50,411 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:43:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:43:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash 384712163, now seen corresponding path program 10 times [2022-12-06 02:43:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:43:50,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963595074] [2022-12-06 02:43:50,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:43:50,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:43:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:43:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:50,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:43:50,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963595074] [2022-12-06 02:43:50,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963595074] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:43:50,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434647171] [2022-12-06 02:43:50,482 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:43:50,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:43:50,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:43:50,484 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:43:50,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 02:43:50,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:43:50,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:43:50,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:43:50,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:43:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:43:50,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:43:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:43:50,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434647171] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:43:50,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:43:50,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-06 02:43:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237114448] [2022-12-06 02:43:50,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:43:50,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:43:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:43:50,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:43:50,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:43:50,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:43:50,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 7957 transitions, 545483 flow. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-06 02:43:50,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:43:50,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:43:50,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:44:55,642 INFO L130 PetriNetUnfolder]: 6372/13377 cut-off events. [2022-12-06 02:44:55,642 INFO L131 PetriNetUnfolder]: For 30668/30668 co-relation queries the response was YES. [2022-12-06 02:44:55,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466432 conditions, 13377 events. 6372/13377 cut-off events. For 30668/30668 co-relation queries the response was YES. Maximal size of possible extension queue 1058. Compared 129671 event pairs, 0 based on Foata normal form. 0/10743 useless extension candidates. Maximal degree in co-relation 82690. Up to 12775 conditions per place. [2022-12-06 02:44:55,716 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 1745 selfloop transitions, 385 changer transitions 6109/8239 dead transitions. [2022-12-06 02:44:55,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 8239 transitions, 581326 flow [2022-12-06 02:44:55,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 02:44:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 02:44:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 154 transitions. [2022-12-06 02:44:55,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24798711755233493 [2022-12-06 02:44:55,718 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 372 predicate places. [2022-12-06 02:44:55,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:44:55,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 394 places, 8239 transitions, 581326 flow [2022-12-06 02:44:56,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 394 places, 8239 transitions, 581326 flow [2022-12-06 02:44:56,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:44:56,127 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:44:56,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 410 [2022-12-06 02:44:56,128 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 8239 transitions, 581326 flow [2022-12-06 02:44:56,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-06 02:44:56,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:44:56,128 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:44:56,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 02:44:56,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-06 02:44:56,329 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:44:56,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:44:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1064770533, now seen corresponding path program 11 times [2022-12-06 02:44:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:44:56,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006829358] [2022-12-06 02:44:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:44:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:44:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:44:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:56,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:44:56,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006829358] [2022-12-06 02:44:56,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006829358] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:44:56,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186345949] [2022-12-06 02:44:56,391 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:44:56,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:44:56,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:44:56,396 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:44:56,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 02:44:56,550 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:44:56,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:44:56,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:44:56,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:44:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:56,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:44:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:44:56,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186345949] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:44:56,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:44:56,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-06 02:44:56,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201093372] [2022-12-06 02:44:56,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:44:56,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:44:56,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:44:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:44:56,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:44:56,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:44:56,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 8239 transitions, 581326 flow. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-06 02:44:56,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:44:56,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:44:56,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:46:10,834 INFO L130 PetriNetUnfolder]: 6688/14026 cut-off events. [2022-12-06 02:46:10,835 INFO L131 PetriNetUnfolder]: For 30853/30853 co-relation queries the response was YES. [2022-12-06 02:46:10,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503244 conditions, 14026 events. 6688/14026 cut-off events. For 30853/30853 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 136698 event pairs, 0 based on Foata normal form. 0/11318 useless extension candidates. Maximal degree in co-relation 89604. Up to 13424 conditions per place. [2022-12-06 02:46:10,918 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 2056 selfloop transitions, 156 changer transitions 6416/8628 dead transitions. [2022-12-06 02:46:10,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 8628 transitions, 626022 flow [2022-12-06 02:46:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:46:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:46:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-12-06 02:46:10,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3162393162393162 [2022-12-06 02:46:10,919 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 384 predicate places. [2022-12-06 02:46:10,920 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:46:10,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 406 places, 8628 transitions, 626022 flow [2022-12-06 02:46:11,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 406 places, 8628 transitions, 626022 flow [2022-12-06 02:46:11,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:46:11,445 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:46:11,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 527 [2022-12-06 02:46:11,446 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 8628 transitions, 626022 flow [2022-12-06 02:46:11,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-06 02:46:11,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:46:11,446 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:46:11,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-06 02:46:11,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:11,647 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:46:11,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:46:11,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1781947029, now seen corresponding path program 12 times [2022-12-06 02:46:11,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:46:11,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064612277] [2022-12-06 02:46:11,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:46:11,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:46:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:46:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:11,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:46:11,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064612277] [2022-12-06 02:46:11,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064612277] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:46:11,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690082443] [2022-12-06 02:46:11,717 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:46:11,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:46:11,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:46:11,718 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:46:11,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-06 02:46:11,861 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:46:11,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:46:11,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:46:11,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:46:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:11,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:46:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:46:11,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690082443] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:46:11,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:46:11,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-06 02:46:11,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864839348] [2022-12-06 02:46:11,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:46:11,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:46:11,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:46:11,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:46:11,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:46:11,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:46:11,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 8628 transitions, 626022 flow. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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-06 02:46:11,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:46:11,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:46:11,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:47:29,524 INFO L130 PetriNetUnfolder]: 6656/14021 cut-off events. [2022-12-06 02:47:29,524 INFO L131 PetriNetUnfolder]: For 30736/30736 co-relation queries the response was YES. [2022-12-06 02:47:29,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517089 conditions, 14021 events. 6656/14021 cut-off events. For 30736/30736 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 137129 event pairs, 0 based on Foata normal form. 0/11363 useless extension candidates. Maximal degree in co-relation 91021. Up to 13419 conditions per place. [2022-12-06 02:47:29,604 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 1822 selfloop transitions, 378 changer transitions 6451/8651 dead transitions. [2022-12-06 02:47:29,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 8651 transitions, 644989 flow [2022-12-06 02:47:29,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 02:47:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 02:47:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 146 transitions. [2022-12-06 02:47:29,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2162962962962963 [2022-12-06 02:47:29,605 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 408 predicate places. [2022-12-06 02:47:29,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:47:29,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 430 places, 8651 transitions, 644989 flow [2022-12-06 02:47:30,132 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 430 places, 8651 transitions, 644989 flow [2022-12-06 02:47:30,132 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:47:30,142 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:47:30,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 538 [2022-12-06 02:47:30,143 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 8651 transitions, 644989 flow [2022-12-06 02:47:30,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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-06 02:47:30,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:47:30,143 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:47:30,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-06 02:47:30,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:47:30,346 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:47:30,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:47:30,346 INFO L85 PathProgramCache]: Analyzing trace with hash 13198435, now seen corresponding path program 13 times [2022-12-06 02:47:30,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:47:30,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879399698] [2022-12-06 02:47:30,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:47:30,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:47:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:47:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:47:30,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:47:30,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879399698] [2022-12-06 02:47:30,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879399698] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:47:30,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42843310] [2022-12-06 02:47:30,408 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:47:30,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:47:30,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:47:30,411 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:47:30,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-06 02:47:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:47:30,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:47:30,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:47:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:47:30,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:47:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:47:30,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42843310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:47:30,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:47:30,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-06 02:47:30,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028393157] [2022-12-06 02:47:30,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:47:30,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:47:30,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:47:30,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:47:30,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:47:30,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:47:30,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 8651 transitions, 644989 flow. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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-06 02:47:30,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:47:30,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:47:30,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:48:47,134 INFO L130 PetriNetUnfolder]: 6790/14282 cut-off events. [2022-12-06 02:48:47,134 INFO L131 PetriNetUnfolder]: For 30751/30751 co-relation queries the response was YES. [2022-12-06 02:48:47,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541040 conditions, 14282 events. 6790/14282 cut-off events. For 30751/30751 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 139908 event pairs, 0 based on Foata normal form. 0/11572 useless extension candidates. Maximal degree in co-relation 95994. Up to 13680 conditions per place. [2022-12-06 02:48:47,219 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 1991 selfloop transitions, 282 changer transitions 6542/8815 dead transitions. [2022-12-06 02:48:47,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 8815 transitions, 674788 flow [2022-12-06 02:48:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:48:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:48:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 117 transitions. [2022-12-06 02:48:47,220 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2022-12-06 02:48:47,220 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 422 predicate places. [2022-12-06 02:48:47,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:48:47,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 444 places, 8815 transitions, 674788 flow [2022-12-06 02:48:47,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 444 places, 8815 transitions, 674788 flow [2022-12-06 02:48:47,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:48:47,725 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:48:47,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 506 [2022-12-06 02:48:47,726 INFO L495 AbstractCegarLoop]: Abstraction has has 444 places, 8815 transitions, 674788 flow [2022-12-06 02:48:47,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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-06 02:48:47,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:48:47,726 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:48:47,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-06 02:48:47,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-06 02:48:47,931 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:48:47,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:48:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash 276937189, now seen corresponding path program 14 times [2022-12-06 02:48:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:48:47,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372157767] [2022-12-06 02:48:47,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:48:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:48:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:48:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:48:47,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:48:47,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372157767] [2022-12-06 02:48:47,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372157767] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:48:47,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934226941] [2022-12-06 02:48:47,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:48:47,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:48:47,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:48:47,991 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:48:47,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-06 02:48:48,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:48:48,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:48:48,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:48:48,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:48:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:48:48,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:48:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:48:48,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934226941] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:48:48,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:48:48,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-06 02:48:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466922482] [2022-12-06 02:48:48,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:48:48,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:48:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:48:48,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:48:48,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:48:48,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:48:48,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 8815 transitions, 674788 flow. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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-06 02:48:48,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:48:48,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:48:48,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:50:19,089 INFO L130 PetriNetUnfolder]: 7652/16185 cut-off events. [2022-12-06 02:50:19,089 INFO L131 PetriNetUnfolder]: For 31237/31237 co-relation queries the response was YES. [2022-12-06 02:50:19,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629794 conditions, 16185 events. 7652/16185 cut-off events. For 31237/31237 co-relation queries the response was YES. Maximal size of possible extension queue 1283. Compared 162216 event pairs, 0 based on Foata normal form. 0/13001 useless extension candidates. Maximal degree in co-relation 115489. Up to 15583 conditions per place. [2022-12-06 02:50:19,186 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 2460 selfloop transitions, 242 changer transitions 7321/10023 dead transitions. [2022-12-06 02:50:19,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 10023 transitions, 787404 flow [2022-12-06 02:50:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 02:50:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 02:50:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2022-12-06 02:50:19,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32098765432098764 [2022-12-06 02:50:19,187 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 433 predicate places. [2022-12-06 02:50:19,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:50:19,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 455 places, 10023 transitions, 787404 flow [2022-12-06 02:50:19,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 455 places, 10023 transitions, 787404 flow [2022-12-06 02:50:19,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:50:19,768 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:50:19,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 582 [2022-12-06 02:50:19,769 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 10023 transitions, 787404 flow [2022-12-06 02:50:19,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 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-06 02:50:19,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:50:19,770 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:50:19,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-06 02:50:19,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 02:50:19,976 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:50:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:50:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash 429269677, now seen corresponding path program 15 times [2022-12-06 02:50:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:50:19,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438765603] [2022-12-06 02:50:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:50:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:50:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:50:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:20,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:50:20,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438765603] [2022-12-06 02:50:20,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438765603] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:50:20,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814805485] [2022-12-06 02:50:20,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:50:20,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:50:20,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:50:20,076 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:50:20,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-06 02:50:20,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 02:50:20,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:50:20,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:50:20,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:50:20,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:20,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:50:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:50:20,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814805485] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:50:20,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:50:20,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-06 02:50:20,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651302982] [2022-12-06 02:50:20,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:50:20,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 02:50:20,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:50:20,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 02:50:20,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-06 02:50:20,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:50:20,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 10023 transitions, 787404 flow. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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-06 02:50:20,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:50:20,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:50:20,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:52:15,719 INFO L130 PetriNetUnfolder]: 7618/16131 cut-off events. [2022-12-06 02:52:15,719 INFO L131 PetriNetUnfolder]: For 32638/32638 co-relation queries the response was YES. [2022-12-06 02:52:15,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643803 conditions, 16131 events. 7618/16131 cut-off events. For 32638/32638 co-relation queries the response was YES. Maximal size of possible extension queue 1281. Compared 161795 event pairs, 0 based on Foata normal form. 0/13033 useless extension candidates. Maximal degree in co-relation 116047. Up to 15520 conditions per place. [2022-12-06 02:52:15,815 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 2267 selfloop transitions, 417 changer transitions 7289/9973 dead transitions. [2022-12-06 02:52:15,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 9973 transitions, 803399 flow [2022-12-06 02:52:15,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-06 02:52:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-06 02:52:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 140 transitions. [2022-12-06 02:52:15,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21604938271604937 [2022-12-06 02:52:15,817 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 456 predicate places. [2022-12-06 02:52:15,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:52:15,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 478 places, 9973 transitions, 803399 flow [2022-12-06 02:52:16,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 478 places, 9973 transitions, 803399 flow [2022-12-06 02:52:16,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:52:16,434 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:52:16,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 618 [2022-12-06 02:52:16,435 INFO L495 AbstractCegarLoop]: Abstraction has has 478 places, 9973 transitions, 803399 flow [2022-12-06 02:52:16,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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-06 02:52:16,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:52:16,435 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:52:16,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-06 02:52:16,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-06 02:52:16,638 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 02:52:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:52:16,638 INFO L85 PathProgramCache]: Analyzing trace with hash -533211547, now seen corresponding path program 16 times [2022-12-06 02:52:16,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:52:16,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210484728] [2022-12-06 02:52:16,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:52:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:52:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:52:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:52:16,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:52:16,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210484728] [2022-12-06 02:52:16,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210484728] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:52:16,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400705729] [2022-12-06 02:52:16,701 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:52:16,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:52:16,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:52:16,702 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:52:16,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-06 02:52:16,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:52:16,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:52:16,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:52:16,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:52:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:52:16,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:52:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:52:16,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400705729] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:52:16,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:52:16,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-06 02:52:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470127994] [2022-12-06 02:52:16,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:52:16,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:52:16,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:52:16,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:52:16,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:52:16,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 02:52:16,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 9973 transitions, 803399 flow. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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-06 02:52:16,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:52:16,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 02:52:16,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 02:52:45,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 02:52:45,024 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 02:52:45,026 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-06 02:52:45,026 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:52:45,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-06 02:52:45,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 02:52:45,224 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/27 universal loopers) in iteration 40,while PetriNetUnfolder was constructing finite prefix that currently has 189774 conditions, 4694 events (2349/4693 cut-off events. For 28075/28075 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 43749 event pairs, 0 based on Foata normal form. 0/4657 useless extension candidates. Maximal degree in co-relation 55404. Up to 4169 conditions per place.). [2022-12-06 02:52:45,226 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 02:52:45,226 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 02:52:45,226 INFO L458 BasicCegarLoop]: Path program histogram: [16, 7, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-06 02:52:45,228 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:52:45,228 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:52:45,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:52:45 BasicIcfg [2022-12-06 02:52:45,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:52:45,230 INFO L158 Benchmark]: Toolchain (without parser) took 846737.03ms. Allocated memory was 178.3MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 154.8MB in the beginning and 1.0GB in the end (delta: -882.0MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-06 02:52:45,230 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 178.3MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:52:45,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.46ms. Allocated memory is still 178.3MB. Free memory was 154.6MB in the beginning and 142.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 02:52:45,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.84ms. Allocated memory is still 178.3MB. Free memory was 142.3MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:52:45,230 INFO L158 Benchmark]: Boogie Preprocessor took 43.10ms. Allocated memory is still 178.3MB. Free memory was 140.2MB in the beginning and 138.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:52:45,231 INFO L158 Benchmark]: RCFGBuilder took 596.94ms. Allocated memory is still 178.3MB. Free memory was 138.5MB in the beginning and 150.0MB in the end (delta: -11.6MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. [2022-12-06 02:52:45,231 INFO L158 Benchmark]: TraceAbstraction took 845817.73ms. Allocated memory was 178.3MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 149.5MB in the beginning and 1.0GB in the end (delta: -887.3MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-06 02:52:45,232 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.13ms. Allocated memory is still 178.3MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.46ms. Allocated memory is still 178.3MB. Free memory was 154.6MB in the beginning and 142.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.84ms. Allocated memory is still 178.3MB. Free memory was 142.3MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.10ms. Allocated memory is still 178.3MB. Free memory was 140.2MB in the beginning and 138.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 596.94ms. Allocated memory is still 178.3MB. Free memory was 138.5MB in the beginning and 150.0MB in the end (delta: -11.6MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. * TraceAbstraction took 845817.73ms. Allocated memory was 178.3MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 149.5MB in the beginning and 1.0GB in the end (delta: -887.3MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 134 PlacesBefore, 22 PlacesAfterwards, 140 TransitionsBefore, 19 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 93 TrivialYvCompositions, 19 ConcurrentYvCompositions, 9 ChoiceCompositions, 121 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 253, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 257, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 257, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 257, unknown conditional: 0, unknown unconditional: 257] , Statistics on independence cache: Total cache size (in pairs): 395, Positive cache size: 391, Positive conditional cache size: 0, Positive unconditional cache size: 391, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 24 PlacesBefore, 24 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 38 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, 28 PlacesBefore, 28 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 0 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, 33 PlacesBefore, 33 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 0 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: 2.0s, 37 PlacesBefore, 36 PlacesAfterwards, 203 TransitionsBefore, 202 TransitionsAfterwards, 0 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, 39 PlacesBefore, 39 PlacesAfterwards, 251 TransitionsBefore, 251 TransitionsAfterwards, 0 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, 43 PlacesBefore, 43 PlacesAfterwards, 261 TransitionsBefore, 261 TransitionsAfterwards, 0 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, 47 PlacesBefore, 47 PlacesAfterwards, 271 TransitionsBefore, 271 TransitionsAfterwards, 0 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, 51 PlacesBefore, 51 PlacesAfterwards, 269 TransitionsBefore, 269 TransitionsAfterwards, 0 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, 273 TransitionsBefore, 273 TransitionsAfterwards, 0 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, 62 PlacesBefore, 62 PlacesAfterwards, 285 TransitionsBefore, 285 TransitionsAfterwards, 0 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, 69 PlacesBefore, 69 PlacesAfterwards, 281 TransitionsBefore, 281 TransitionsAfterwards, 0 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, 73 PlacesBefore, 73 PlacesAfterwards, 273 TransitionsBefore, 273 TransitionsAfterwards, 0 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: 2.3s, 80 PlacesBefore, 79 PlacesAfterwards, 488 TransitionsBefore, 487 TransitionsAfterwards, 0 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: 1.1s, 93 PlacesBefore, 91 PlacesAfterwards, 848 TransitionsBefore, 846 TransitionsAfterwards, 0 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, 104 PlacesBefore, 104 PlacesAfterwards, 1231 TransitionsBefore, 1231 TransitionsAfterwards, 0 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, 122 PlacesBefore, 122 PlacesAfterwards, 1692 TransitionsBefore, 1692 TransitionsAfterwards, 0 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, 131 PlacesBefore, 131 PlacesAfterwards, 1746 TransitionsBefore, 1746 TransitionsAfterwards, 0 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, 154 PlacesBefore, 154 PlacesAfterwards, 2107 TransitionsBefore, 2107 TransitionsAfterwards, 0 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, 167 PlacesBefore, 167 PlacesAfterwards, 2132 TransitionsBefore, 2132 TransitionsAfterwards, 0 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, 188 PlacesBefore, 188 PlacesAfterwards, 2386 TransitionsBefore, 2386 TransitionsAfterwards, 0 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, 200 PlacesBefore, 200 PlacesAfterwards, 2363 TransitionsBefore, 2363 TransitionsAfterwards, 0 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: 10.7s, 210 PlacesBefore, 208 PlacesAfterwards, 2939 TransitionsBefore, 2937 TransitionsAfterwards, 0 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, 220 PlacesBefore, 220 PlacesAfterwards, 3138 TransitionsBefore, 3138 TransitionsAfterwards, 0 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, 233 PlacesBefore, 233 PlacesAfterwards, 3516 TransitionsBefore, 3516 TransitionsAfterwards, 0 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, 246 PlacesBefore, 246 PlacesAfterwards, 4284 TransitionsBefore, 4284 TransitionsAfterwards, 0 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, 252 PlacesBefore, 252 PlacesAfterwards, 4526 TransitionsBefore, 4526 TransitionsAfterwards, 0 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, 266 PlacesBefore, 266 PlacesAfterwards, 4932 TransitionsBefore, 4932 TransitionsAfterwards, 0 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, 286 PlacesBefore, 286 PlacesAfterwards, 5359 TransitionsBefore, 5359 TransitionsAfterwards, 0 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, 304 PlacesBefore, 304 PlacesAfterwards, 5606 TransitionsBefore, 5606 TransitionsAfterwards, 0 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, 322 PlacesBefore, 322 PlacesAfterwards, 5989 TransitionsBefore, 5989 TransitionsAfterwards, 0 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, 334 PlacesBefore, 334 PlacesAfterwards, 6132 TransitionsBefore, 6132 TransitionsAfterwards, 0 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, 358 PlacesBefore, 358 PlacesAfterwards, 6708 TransitionsBefore, 6708 TransitionsAfterwards, 0 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, 372 PlacesBefore, 372 PlacesAfterwards, 7957 TransitionsBefore, 7957 TransitionsAfterwards, 0 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, 394 PlacesBefore, 394 PlacesAfterwards, 8239 TransitionsBefore, 8239 TransitionsAfterwards, 0 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, 406 PlacesBefore, 406 PlacesAfterwards, 8628 TransitionsBefore, 8628 TransitionsAfterwards, 0 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, 430 PlacesBefore, 430 PlacesAfterwards, 8651 TransitionsBefore, 8651 TransitionsAfterwards, 0 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, 444 PlacesBefore, 444 PlacesAfterwards, 8815 TransitionsBefore, 8815 TransitionsAfterwards, 0 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, 455 PlacesBefore, 455 PlacesAfterwards, 10023 TransitionsBefore, 10023 TransitionsAfterwards, 0 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, 478 PlacesBefore, 478 PlacesAfterwards, 9973 TransitionsBefore, 9973 TransitionsAfterwards, 0 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 - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/27 universal loopers) in iteration 40,while PetriNetUnfolder was constructing finite prefix that currently has 189774 conditions, 4694 events (2349/4693 cut-off events. For 28075/28075 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 43749 event pairs, 0 based on Foata normal form. 0/4657 useless extension candidates. Maximal degree in co-relation 55404. Up to 4169 conditions per place.). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/27 universal loopers) in iteration 40,while PetriNetUnfolder was constructing finite prefix that currently has 189774 conditions, 4694 events (2349/4693 cut-off events. For 28075/28075 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 43749 event pairs, 0 based on Foata normal form. 0/4657 useless extension candidates. Maximal degree in co-relation 55404. Up to 4169 conditions per place.). - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/27 universal loopers) in iteration 40,while PetriNetUnfolder was constructing finite prefix that currently has 189774 conditions, 4694 events (2349/4693 cut-off events. For 28075/28075 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 43749 event pairs, 0 based on Foata normal form. 0/4657 useless extension candidates. Maximal degree in co-relation 55404. Up to 4169 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 158 locations, 3 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: 845.7s, OverallIterations: 40, TraceHistogramMax: 2, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 796.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 3256 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3256 mSDsluCounter, 310 SdHoareTripleChecker+Invalid, 14.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 124 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 560 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11485 IncrementalHoareTripleChecker+Invalid, 12188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 560 mSolverCounterUnsat, 118 mSDtfsCounter, 11485 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1823 GetRequests, 1090 SyntacticMatches, 94 SemanticMatches, 639 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 3457 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=803399occurred in iteration=39, InterpolantAutomatonStates: 504, 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.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 1248 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 1698 ConstructedInterpolants, 16 QuantifiedInterpolants, 7988 SizeOfPredicates, 167 NumberOfNonLiveVariables, 7566 ConjunctsInSsa, 315 ConjunctsInUnsatCore, 110 InterpolantComputations, 6 PerfectInterpolantSequences, 147/350 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