/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-figure1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:57:31,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:57:31,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:57:31,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:57:31,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:57:31,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:57:31,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:57:31,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:57:31,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:57:31,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:57:31,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:57:31,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:57:31,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:57:31,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:57:31,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:57:31,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:57:31,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:57:31,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:57:31,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:57:31,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:57:31,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:57:31,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:57:31,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:57:31,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:57:31,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:57:31,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:57:31,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:57:31,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:57:31,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:57:31,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:57:31,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:57:31,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:57:31,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:57:31,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:57:31,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:57:31,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:57:31,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:57:31,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:57:31,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:57:31,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:57:31,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:57:31,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 01:57:31,927 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:57:31,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:57:31,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:57:31,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:57:31,929 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:57:31,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:57:31,930 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:57:31,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:57:31,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:57:31,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:57:31,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:57:31,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:57:31,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:57:31,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:57:31,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:57:31,931 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:57:31,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:57:31,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:57:31,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:57:31,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:57:31,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:57:31,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:57:31,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:57:31,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:57:31,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:57:31,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:57:31,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:57:31,933 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:57:31,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 01:57:32,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:57:32,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:57:32,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:57:32,229 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:57:32,229 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:57:32,230 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1.wvr.c [2022-12-13 01:57:33,315 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:57:33,477 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:57:33,478 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1.wvr.c [2022-12-13 01:57:33,482 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0594c3025/4c59ed05a56a4cc9b9a9de5d8755583f/FLAG71d7aee8d [2022-12-13 01:57:33,493 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0594c3025/4c59ed05a56a4cc9b9a9de5d8755583f [2022-12-13 01:57:33,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:57:33,496 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:57:33,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:57:33,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:57:33,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:57:33,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435abbf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33, skipping insertion in model container [2022-12-13 01:57:33,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:57:33,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:57:33,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:57:33,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:57:33,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:57:33,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:57:33,609 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-figure1.wvr.c[1991,2004] [2022-12-13 01:57:33,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:57:33,616 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:57:33,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:57:33,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:57:33,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:57:33,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:57:33,628 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-figure1.wvr.c[1991,2004] [2022-12-13 01:57:33,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:57:33,637 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:57:33,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33 WrapperNode [2022-12-13 01:57:33,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:57:33,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:57:33,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:57:33,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:57:33,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,663 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2022-12-13 01:57:33,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:57:33,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:57:33,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:57:33,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:57:33,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,688 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:57:33,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:57:33,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:57:33,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:57:33,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33" (1/1) ... [2022-12-13 01:57:33,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:57:33,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:33,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 01:57:33,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 01:57:33,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:57:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:57:33,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:57:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:57:33,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:57:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:57:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:57:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:57:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 01:57:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 01:57:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:57:33,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:57:33,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:57:33,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:57:33,744 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 01:57:33,804 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:57:33,805 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:57:33,939 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:57:33,980 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:57:33,981 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 01:57:33,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:57:33 BoogieIcfgContainer [2022-12-13 01:57:33,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:57:33,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:57:33,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:57:33,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:57:33,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:57:33" (1/3) ... [2022-12-13 01:57:33,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d48a31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:57:33, skipping insertion in model container [2022-12-13 01:57:33,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:33" (2/3) ... [2022-12-13 01:57:33,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d48a31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:57:33, skipping insertion in model container [2022-12-13 01:57:33,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:57:33" (3/3) ... [2022-12-13 01:57:33,989 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-figure1.wvr.c [2022-12-13 01:57:34,015 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:57:34,015 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:57:34,015 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:57:34,056 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 01:57:34,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 72 transitions, 160 flow [2022-12-13 01:57:34,110 INFO L130 PetriNetUnfolder]: 5/70 cut-off events. [2022-12-13 01:57:34,110 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:57:34,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 70 events. 5/70 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2022-12-13 01:57:34,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 72 transitions, 160 flow [2022-12-13 01:57:34,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 62 transitions, 136 flow [2022-12-13 01:57:34,117 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:34,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 62 transitions, 136 flow [2022-12-13 01:57:34,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 62 transitions, 136 flow [2022-12-13 01:57:34,146 INFO L130 PetriNetUnfolder]: 5/62 cut-off events. [2022-12-13 01:57:34,146 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:57:34,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 62 events. 5/62 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2022-12-13 01:57:34,148 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 62 transitions, 136 flow [2022-12-13 01:57:34,148 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 01:57:35,667 INFO L241 LiptonReduction]: Total number of compositions: 47 [2022-12-13 01:57:35,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:57:35,682 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;@6067a965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:57:35,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 01:57:35,686 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-13 01:57:35,686 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:57:35,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:35,687 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:35,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1113892720, now seen corresponding path program 1 times [2022-12-13 01:57:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:35,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508816167] [2022-12-13 01:57:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:35,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:35,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508816167] [2022-12-13 01:57:35,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508816167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:35,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:35,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 01:57:35,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119351328] [2022-12-13 01:57:35,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:35,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:57:35,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:35,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:57:35,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:57:35,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 01:57:35,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-13 01:57:35,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:35,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 01:57:35,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:36,017 INFO L130 PetriNetUnfolder]: 49/94 cut-off events. [2022-12-13 01:57:36,017 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 01:57:36,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 94 events. 49/94 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 271 event pairs, 13 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 143. Up to 65 conditions per place. [2022-12-13 01:57:36,019 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 16 selfloop transitions, 2 changer transitions 4/24 dead transitions. [2022-12-13 01:57:36,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 113 flow [2022-12-13 01:57:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:57:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:57:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 01:57:36,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 01:57:36,028 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 30 transitions. [2022-12-13 01:57:36,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 113 flow [2022-12-13 01:57:36,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:36,031 INFO L231 Difference]: Finished difference. Result has 19 places, 16 transitions, 48 flow [2022-12-13 01:57:36,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=19, PETRI_TRANSITIONS=16} [2022-12-13 01:57:36,034 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2022-12-13 01:57:36,035 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:36,035 INFO L89 Accepts]: Start accepts. Operand has 19 places, 16 transitions, 48 flow [2022-12-13 01:57:36,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:36,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:36,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 48 flow [2022-12-13 01:57:36,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 48 flow [2022-12-13 01:57:36,041 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-13 01:57:36,041 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:57:36,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 4/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 22. Up to 7 conditions per place. [2022-12-13 01:57:36,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 48 flow [2022-12-13 01:57:36,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-13 01:57:36,044 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:36,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 01:57:36,045 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 16 transitions, 48 flow [2022-12-13 01:57:36,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-13 01:57:36,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:36,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:36,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:57:36,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:36,046 INFO L85 PathProgramCache]: Analyzing trace with hash -756344514, now seen corresponding path program 1 times [2022-12-13 01:57:36,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:36,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035145713] [2022-12-13 01:57:36,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:36,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:36,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:36,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035145713] [2022-12-13 01:57:36,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035145713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:36,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:36,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:57:36,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279669049] [2022-12-13 01:57:36,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:36,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:36,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:36,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:36,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:36,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 01:57:36,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 16 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:36,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:36,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 01:57:36,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:36,220 INFO L130 PetriNetUnfolder]: 76/153 cut-off events. [2022-12-13 01:57:36,221 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 01:57:36,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 153 events. 76/153 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 469 event pairs, 24 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 183. Up to 78 conditions per place. [2022-12-13 01:57:36,224 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 30 selfloop transitions, 3 changer transitions 6/39 dead transitions. [2022-12-13 01:57:36,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 39 transitions, 191 flow [2022-12-13 01:57:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-13 01:57:36,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-13 01:57:36,226 INFO L175 Difference]: Start difference. First operand has 19 places, 16 transitions, 48 flow. Second operand 5 states and 37 transitions. [2022-12-13 01:57:36,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 39 transitions, 191 flow [2022-12-13 01:57:36,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 39 transitions, 187 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:36,228 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 70 flow [2022-12-13 01:57:36,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-13 01:57:36,229 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2022-12-13 01:57:36,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:36,229 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 70 flow [2022-12-13 01:57:36,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:36,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:36,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 70 flow [2022-12-13 01:57:36,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 70 flow [2022-12-13 01:57:36,236 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-13 01:57:36,236 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:57:36,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 31. Up to 8 conditions per place. [2022-12-13 01:57:36,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 70 flow [2022-12-13 01:57:36,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:36,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:36,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 01:57:36,377 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 67 flow [2022-12-13 01:57:36,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:36,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:36,378 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:36,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:57:36,378 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1067471298, now seen corresponding path program 1 times [2022-12-13 01:57:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:36,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787111808] [2022-12-13 01:57:36,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:36,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:36,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787111808] [2022-12-13 01:57:36,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787111808] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:36,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179085713] [2022-12-13 01:57:36,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:36,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:36,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:36,494 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:36,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 01:57:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:36,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 01:57:36,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:36,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:36,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179085713] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:36,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:36,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-12-13 01:57:36,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15377689] [2022-12-13 01:57:36,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:36,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:36,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:36,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:36,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:36,660 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 01:57:36,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 67 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-13 01:57:36,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:36,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 01:57:36,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:36,773 INFO L130 PetriNetUnfolder]: 49/105 cut-off events. [2022-12-13 01:57:36,773 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-13 01:57:36,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 105 events. 49/105 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 274 event pairs, 13 based on Foata normal form. 6/111 useless extension candidates. Maximal degree in co-relation 105. Up to 68 conditions per place. [2022-12-13 01:57:36,774 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 21 selfloop transitions, 2 changer transitions 5/28 dead transitions. [2022-12-13 01:57:36,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 154 flow [2022-12-13 01:57:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-13 01:57:36,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.453125 [2022-12-13 01:57:36,775 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 67 flow. Second operand 4 states and 29 transitions. [2022-12-13 01:57:36,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 154 flow [2022-12-13 01:57:36,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 138 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 01:57:36,777 INFO L231 Difference]: Finished difference. Result has 24 places, 17 transitions, 61 flow [2022-12-13 01:57:36,777 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=61, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2022-12-13 01:57:36,777 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2022-12-13 01:57:36,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:36,777 INFO L89 Accepts]: Start accepts. Operand has 24 places, 17 transitions, 61 flow [2022-12-13 01:57:36,778 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:36,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:36,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 17 transitions, 61 flow [2022-12-13 01:57:36,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 61 flow [2022-12-13 01:57:36,782 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2022-12-13 01:57:36,782 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 01:57:36,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 30 events. 4/30 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 29. Up to 10 conditions per place. [2022-12-13 01:57:36,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 17 transitions, 61 flow [2022-12-13 01:57:36,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-13 01:57:36,783 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:36,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 01:57:36,784 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 61 flow [2022-12-13 01:57:36,784 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-13 01:57:36,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:36,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:36,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 01:57:36,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:36,995 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:37,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1130107994, now seen corresponding path program 2 times [2022-12-13 01:57:37,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:37,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222500224] [2022-12-13 01:57:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:37,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:37,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222500224] [2022-12-13 01:57:37,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222500224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:37,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:37,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:57:37,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475358644] [2022-12-13 01:57:37,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:37,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:37,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:37,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:37,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:37,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 01:57:37,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:37,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 01:57:37,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:37,131 INFO L130 PetriNetUnfolder]: 45/93 cut-off events. [2022-12-13 01:57:37,131 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-13 01:57:37,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 93 events. 45/93 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 223 event pairs, 21 based on Foata normal form. 2/95 useless extension candidates. Maximal degree in co-relation 130. Up to 65 conditions per place. [2022-12-13 01:57:37,132 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 17 selfloop transitions, 2 changer transitions 11/30 dead transitions. [2022-12-13 01:57:37,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 159 flow [2022-12-13 01:57:37,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 01:57:37,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.484375 [2022-12-13 01:57:37,133 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 61 flow. Second operand 4 states and 31 transitions. [2022-12-13 01:57:37,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 159 flow [2022-12-13 01:57:37,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 30 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:37,134 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 60 flow [2022-12-13 01:57:37,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2022-12-13 01:57:37,134 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2022-12-13 01:57:37,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:37,135 INFO L89 Accepts]: Start accepts. Operand has 26 places, 16 transitions, 60 flow [2022-12-13 01:57:37,135 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:37,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:37,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 16 transitions, 60 flow [2022-12-13 01:57:37,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 60 flow [2022-12-13 01:57:37,138 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-13 01:57:37,138 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:57:37,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 17 events. 3/17 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 25. Up to 7 conditions per place. [2022-12-13 01:57:37,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 60 flow [2022-12-13 01:57:37,138 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 01:57:37,160 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:37,163 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 01:57:37,164 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 54 flow [2022-12-13 01:57:37,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:37,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:37,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:57:37,165 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:37,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1896266631, now seen corresponding path program 1 times [2022-12-13 01:57:37,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:37,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776829821] [2022-12-13 01:57:37,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:37,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:37,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:37,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776829821] [2022-12-13 01:57:37,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776829821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:37,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:37,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:57:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695917657] [2022-12-13 01:57:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:37,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:37,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:37,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:37,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 01:57:37,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 54 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:37,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 01:57:37,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:37,361 INFO L130 PetriNetUnfolder]: 70/136 cut-off events. [2022-12-13 01:57:37,361 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-13 01:57:37,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 136 events. 70/136 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 401 event pairs, 12 based on Foata normal form. 7/143 useless extension candidates. Maximal degree in co-relation 181. Up to 61 conditions per place. [2022-12-13 01:57:37,363 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 26 selfloop transitions, 6 changer transitions 4/36 dead transitions. [2022-12-13 01:57:37,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 36 transitions, 188 flow [2022-12-13 01:57:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-13 01:57:37,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-13 01:57:37,365 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 54 flow. Second operand 4 states and 38 transitions. [2022-12-13 01:57:37,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 36 transitions, 188 flow [2022-12-13 01:57:37,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 36 transitions, 171 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:37,367 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 91 flow [2022-12-13 01:57:37,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-13 01:57:37,369 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2022-12-13 01:57:37,370 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:37,370 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 91 flow [2022-12-13 01:57:37,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:37,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:37,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 91 flow [2022-12-13 01:57:37,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 91 flow [2022-12-13 01:57:37,376 INFO L130 PetriNetUnfolder]: 5/31 cut-off events. [2022-12-13 01:57:37,376 INFO L131 PetriNetUnfolder]: For 7/11 co-relation queries the response was YES. [2022-12-13 01:57:37,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 31 events. 5/31 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 55. Up to 11 conditions per place. [2022-12-13 01:57:37,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 91 flow [2022-12-13 01:57:37,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 01:57:37,378 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:37,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 01:57:37,380 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 91 flow [2022-12-13 01:57:37,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,381 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:37,381 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:37,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:57:37,381 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:37,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash 270986247, now seen corresponding path program 1 times [2022-12-13 01:57:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:37,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114154609] [2022-12-13 01:57:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:37,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:37,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114154609] [2022-12-13 01:57:37,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114154609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:37,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:37,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:57:37,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422488535] [2022-12-13 01:57:37,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:37,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:37,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:37,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:37,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 01:57:37,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:37,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 01:57:37,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:37,493 INFO L130 PetriNetUnfolder]: 78/157 cut-off events. [2022-12-13 01:57:37,493 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2022-12-13 01:57:37,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 157 events. 78/157 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 474 event pairs, 38 based on Foata normal form. 2/159 useless extension candidates. Maximal degree in co-relation 191. Up to 117 conditions per place. [2022-12-13 01:57:37,494 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 21 selfloop transitions, 4 changer transitions 15/40 dead transitions. [2022-12-13 01:57:37,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 40 transitions, 235 flow [2022-12-13 01:57:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:57:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:57:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-12-13 01:57:37,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 01:57:37,495 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 91 flow. Second operand 6 states and 38 transitions. [2022-12-13 01:57:37,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 40 transitions, 235 flow [2022-12-13 01:57:37,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 40 transitions, 225 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-13 01:57:37,496 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 123 flow [2022-12-13 01:57:37,496 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-13 01:57:37,496 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2022-12-13 01:57:37,497 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:37,497 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 123 flow [2022-12-13 01:57:37,497 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:37,497 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:37,497 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 123 flow [2022-12-13 01:57:37,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 123 flow [2022-12-13 01:57:37,501 INFO L130 PetriNetUnfolder]: 9/41 cut-off events. [2022-12-13 01:57:37,501 INFO L131 PetriNetUnfolder]: For 35/37 co-relation queries the response was YES. [2022-12-13 01:57:37,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 41 events. 9/41 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 3 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 94. Up to 15 conditions per place. [2022-12-13 01:57:37,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 123 flow [2022-12-13 01:57:37,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 01:57:37,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [268] $Ultimate##0-->L41-4: Formula: (and (< 0 v_~N~0_57) (= v_thread1Thread1of1ForFork0_~i~0_35 1) (= (+ v_~counter~0_100 1) v_~counter~0_99)) InVars {~counter~0=v_~counter~0_100, ~N~0=v_~N~0_57} OutVars{~counter~0=v_~counter~0_99, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_24|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_18|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_35, ~N~0=v_~N~0_57} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [267] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| (ite (< 0 v_~counter~0_95) 1 0)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_33|) (= v_~counter~0_95 (+ v_~counter~0_94 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0)) (< 0 v_~N~0_55)) InVars {~counter~0=v_~counter~0_95, ~N~0=v_~N~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_94, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_33|, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:37,601 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [270] $Ultimate##0-->L51-4: Formula: (and (< 0 v_~N~0_61) (= (ite (< 0 (+ v_~counter~0_109 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|) (= v_thread1Thread1of1ForFork0_~i~0_43 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_18| 0)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_39|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_18| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|) (= v_~counter~0_109 v_~counter~0_111)) InVars {~counter~0=v_~counter~0_111, ~N~0=v_~N~0_61} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_18|, ~counter~0=v_~counter~0_109, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_18|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_30|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_24|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_43, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_18|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_22|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_39|, ~N~0=v_~N~0_61} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:57:37,669 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:57:37,670 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-13 01:57:37,670 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 123 flow [2022-12-13 01:57:37,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:37,671 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:37,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 01:57:37,671 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:37,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash 425929402, now seen corresponding path program 1 times [2022-12-13 01:57:37,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:37,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820652491] [2022-12-13 01:57:37,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:37,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:37,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:37,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820652491] [2022-12-13 01:57:37,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820652491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:37,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:37,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:57:37,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784550280] [2022-12-13 01:57:37,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:37,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:37,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:37,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:37,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:37,701 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 01:57:37,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:37,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 01:57:37,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:37,735 INFO L130 PetriNetUnfolder]: 79/151 cut-off events. [2022-12-13 01:57:37,736 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-12-13 01:57:37,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 151 events. 79/151 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 419 event pairs, 21 based on Foata normal form. 12/159 useless extension candidates. Maximal degree in co-relation 435. Up to 115 conditions per place. [2022-12-13 01:57:37,737 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 25 selfloop transitions, 5 changer transitions 1/31 dead transitions. [2022-12-13 01:57:37,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 232 flow [2022-12-13 01:57:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-13 01:57:37,738 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2022-12-13 01:57:37,738 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 123 flow. Second operand 4 states and 27 transitions. [2022-12-13 01:57:37,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 232 flow [2022-12-13 01:57:37,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 217 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:37,739 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 132 flow [2022-12-13 01:57:37,739 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2022-12-13 01:57:37,740 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2022-12-13 01:57:37,740 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:37,740 INFO L89 Accepts]: Start accepts. Operand has 30 places, 21 transitions, 132 flow [2022-12-13 01:57:37,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:37,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:37,741 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 21 transitions, 132 flow [2022-12-13 01:57:37,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 132 flow [2022-12-13 01:57:37,744 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2022-12-13 01:57:37,744 INFO L131 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2022-12-13 01:57:37,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 46 events. 11/46 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 111 event pairs, 4 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 100. Up to 15 conditions per place. [2022-12-13 01:57:37,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 132 flow [2022-12-13 01:57:37,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-13 01:57:37,752 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:37,752 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 01:57:37,752 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 132 flow [2022-12-13 01:57:37,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:37,753 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:37,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 01:57:37,753 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:37,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1198607735, now seen corresponding path program 1 times [2022-12-13 01:57:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:37,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379917152] [2022-12-13 01:57:37,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:37,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:37,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379917152] [2022-12-13 01:57:37,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379917152] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:37,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261979824] [2022-12-13 01:57:37,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:37,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:37,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:37,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:37,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 01:57:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:37,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 01:57:37,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:37,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:37,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261979824] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:37,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:37,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-12-13 01:57:37,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063696183] [2022-12-13 01:57:37,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:37,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:37,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:37,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:37,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:37,944 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 01:57:37,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 132 flow. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:37,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 01:57:37,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:38,028 INFO L130 PetriNetUnfolder]: 146/277 cut-off events. [2022-12-13 01:57:38,028 INFO L131 PetriNetUnfolder]: For 506/506 co-relation queries the response was YES. [2022-12-13 01:57:38,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 277 events. 146/277 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1044 event pairs, 20 based on Foata normal form. 7/284 useless extension candidates. Maximal degree in co-relation 387. Up to 89 conditions per place. [2022-12-13 01:57:38,030 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 34 selfloop transitions, 15 changer transitions 4/53 dead transitions. [2022-12-13 01:57:38,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 53 transitions, 391 flow [2022-12-13 01:57:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-13 01:57:38,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 01:57:38,031 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 132 flow. Second operand 5 states and 48 transitions. [2022-12-13 01:57:38,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 53 transitions, 391 flow [2022-12-13 01:57:38,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 53 transitions, 361 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:38,033 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 233 flow [2022-12-13 01:57:38,033 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2022-12-13 01:57:38,033 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:38,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:38,033 INFO L89 Accepts]: Start accepts. Operand has 34 places, 29 transitions, 233 flow [2022-12-13 01:57:38,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:38,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:38,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 29 transitions, 233 flow [2022-12-13 01:57:38,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 233 flow [2022-12-13 01:57:38,040 INFO L130 PetriNetUnfolder]: 19/83 cut-off events. [2022-12-13 01:57:38,040 INFO L131 PetriNetUnfolder]: For 71/73 co-relation queries the response was YES. [2022-12-13 01:57:38,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 83 events. 19/83 cut-off events. For 71/73 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 334 event pairs, 7 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 190. Up to 26 conditions per place. [2022-12-13 01:57:38,041 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 29 transitions, 233 flow [2022-12-13 01:57:38,041 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 01:57:38,041 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:38,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 01:57:38,042 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 233 flow [2022-12-13 01:57:38,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:38,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:38,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:38,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 01:57:38,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 01:57:38,248 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:38,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:38,248 INFO L85 PathProgramCache]: Analyzing trace with hash -479251786, now seen corresponding path program 1 times [2022-12-13 01:57:38,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:38,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724622794] [2022-12-13 01:57:38,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:38,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:38,289 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-13 01:57:38,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:38,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724622794] [2022-12-13 01:57:38,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724622794] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:38,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195353494] [2022-12-13 01:57:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:38,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:38,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:38,310 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:38,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 01:57:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:38,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:57:38,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:38,449 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-13 01:57:38,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:38,475 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-13 01:57:38,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195353494] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:38,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:38,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:57:38,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539357150] [2022-12-13 01:57:38,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:38,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:57:38,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:38,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:57:38,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:57:38,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 01:57:38,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 233 flow. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 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-13 01:57:38,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:38,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 01:57:38,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:38,590 INFO L130 PetriNetUnfolder]: 192/361 cut-off events. [2022-12-13 01:57:38,591 INFO L131 PetriNetUnfolder]: For 1054/1054 co-relation queries the response was YES. [2022-12-13 01:57:38,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 361 events. 192/361 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1465 event pairs, 88 based on Foata normal form. 26/387 useless extension candidates. Maximal degree in co-relation 651. Up to 294 conditions per place. [2022-12-13 01:57:38,593 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 43 selfloop transitions, 11 changer transitions 4/58 dead transitions. [2022-12-13 01:57:38,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 535 flow [2022-12-13 01:57:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:57:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:57:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-13 01:57:38,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 01:57:38,594 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 233 flow. Second operand 6 states and 40 transitions. [2022-12-13 01:57:38,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 58 transitions, 535 flow [2022-12-13 01:57:38,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 473 flow, removed 31 selfloop flow, removed 0 redundant places. [2022-12-13 01:57:38,596 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 338 flow [2022-12-13 01:57:38,596 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2022-12-13 01:57:38,597 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2022-12-13 01:57:38,597 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:38,597 INFO L89 Accepts]: Start accepts. Operand has 43 places, 38 transitions, 338 flow [2022-12-13 01:57:38,597 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:38,598 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:38,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 38 transitions, 338 flow [2022-12-13 01:57:38,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 338 flow [2022-12-13 01:57:38,618 INFO L130 PetriNetUnfolder]: 30/118 cut-off events. [2022-12-13 01:57:38,618 INFO L131 PetriNetUnfolder]: For 236/250 co-relation queries the response was YES. [2022-12-13 01:57:38,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 118 events. 30/118 cut-off events. For 236/250 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 563 event pairs, 7 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 343. Up to 38 conditions per place. [2022-12-13 01:57:38,619 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 38 transitions, 338 flow [2022-12-13 01:57:38,619 INFO L226 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-13 01:57:38,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [271] $Ultimate##0-->L41-4: Formula: (and (= 2 v_thread1Thread1of1ForFork0_~i~0_45) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_20| 0)) (< v_thread1Thread1of1ForFork0_~i~0_45 (+ 1 v_~N~0_63)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_41|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_20| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_20|) (= (ite (< 0 v_~counter~0_115) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_20|) (= v_~counter~0_115 (+ v_~counter~0_117 1))) InVars {~counter~0=v_~counter~0_117, ~N~0=v_~N~0_63} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_20|, ~counter~0=v_~counter~0_115, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_20|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_32|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_26|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_45, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_20|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_24|, ~N~0=v_~N~0_63, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_41|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:38,700 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:38,700 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:38,793 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~i~0_In_1 v_~N~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:38,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~i~0_In_1 v_~N~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:38,934 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:57:38,934 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 337 [2022-12-13 01:57:38,934 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 366 flow [2022-12-13 01:57:38,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 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-13 01:57:38,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:38,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:38,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 01:57:39,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:39,135 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash -195317178, now seen corresponding path program 1 times [2022-12-13 01:57:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:39,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215931916] [2022-12-13 01:57:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:39,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:39,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:39,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215931916] [2022-12-13 01:57:39,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215931916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:39,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618903654] [2022-12-13 01:57:39,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:39,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:39,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:39,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:39,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 01:57:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:39,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 01:57:39,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:39,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:39,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618903654] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:39,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:39,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 01:57:39,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202284464] [2022-12-13 01:57:39,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:39,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:57:39,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:39,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:57:39,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:57:39,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 01:57:39,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 366 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-13 01:57:39,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:39,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 01:57:39,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:39,392 INFO L130 PetriNetUnfolder]: 232/476 cut-off events. [2022-12-13 01:57:39,392 INFO L131 PetriNetUnfolder]: For 1710/1710 co-relation queries the response was YES. [2022-12-13 01:57:39,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 476 events. 232/476 cut-off events. For 1710/1710 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2282 event pairs, 104 based on Foata normal form. 18/492 useless extension candidates. Maximal degree in co-relation 1366. Up to 344 conditions per place. [2022-12-13 01:57:39,395 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 53 selfloop transitions, 11 changer transitions 11/75 dead transitions. [2022-12-13 01:57:39,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 722 flow [2022-12-13 01:57:39,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:57:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:57:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-12-13 01:57:39,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2022-12-13 01:57:39,396 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 366 flow. Second operand 7 states and 53 transitions. [2022-12-13 01:57:39,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 722 flow [2022-12-13 01:57:39,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 664 flow, removed 29 selfloop flow, removed 0 redundant places. [2022-12-13 01:57:39,399 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 386 flow [2022-12-13 01:57:39,399 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=386, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-12-13 01:57:39,400 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 32 predicate places. [2022-12-13 01:57:39,400 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:39,400 INFO L89 Accepts]: Start accepts. Operand has 52 places, 41 transitions, 386 flow [2022-12-13 01:57:39,400 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:39,400 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:39,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 386 flow [2022-12-13 01:57:39,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 386 flow [2022-12-13 01:57:39,410 INFO L130 PetriNetUnfolder]: 34/158 cut-off events. [2022-12-13 01:57:39,411 INFO L131 PetriNetUnfolder]: For 404/423 co-relation queries the response was YES. [2022-12-13 01:57:39,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 158 events. 34/158 cut-off events. For 404/423 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 879 event pairs, 8 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 474. Up to 48 conditions per place. [2022-12-13 01:57:39,412 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 386 flow [2022-12-13 01:57:39,412 INFO L226 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-13 01:57:39,417 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:39,417 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:39,540 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:39,540 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:39,658 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:39,704 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:57:39,704 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 304 [2022-12-13 01:57:39,705 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 419 flow [2022-12-13 01:57:39,705 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-13 01:57:39,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:39,705 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:39,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 01:57:39,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:39,905 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:39,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1087065918, now seen corresponding path program 2 times [2022-12-13 01:57:39,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:39,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876243123] [2022-12-13 01:57:39,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:39,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:39,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:39,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876243123] [2022-12-13 01:57:39,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876243123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:39,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:39,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:57:39,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118754233] [2022-12-13 01:57:39,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:39,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:39,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:39,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:39,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:39,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 01:57:39,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 419 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:39,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:39,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 01:57:39,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:39,999 INFO L130 PetriNetUnfolder]: 209/411 cut-off events. [2022-12-13 01:57:40,000 INFO L131 PetriNetUnfolder]: For 1766/1766 co-relation queries the response was YES. [2022-12-13 01:57:40,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 411 events. 209/411 cut-off events. For 1766/1766 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1820 event pairs, 111 based on Foata normal form. 2/413 useless extension candidates. Maximal degree in co-relation 1640. Up to 391 conditions per place. [2022-12-13 01:57:40,002 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 39 selfloop transitions, 3 changer transitions 8/50 dead transitions. [2022-12-13 01:57:40,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 545 flow [2022-12-13 01:57:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:40,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-13 01:57:40,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-13 01:57:40,003 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 419 flow. Second operand 4 states and 32 transitions. [2022-12-13 01:57:40,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 545 flow [2022-12-13 01:57:40,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 494 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-13 01:57:40,007 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 363 flow [2022-12-13 01:57:40,007 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2022-12-13 01:57:40,007 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 30 predicate places. [2022-12-13 01:57:40,007 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:40,007 INFO L89 Accepts]: Start accepts. Operand has 50 places, 41 transitions, 363 flow [2022-12-13 01:57:40,008 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:40,008 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:40,008 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 41 transitions, 363 flow [2022-12-13 01:57:40,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 363 flow [2022-12-13 01:57:40,017 INFO L130 PetriNetUnfolder]: 33/139 cut-off events. [2022-12-13 01:57:40,017 INFO L131 PetriNetUnfolder]: For 326/342 co-relation queries the response was YES. [2022-12-13 01:57:40,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 139 events. 33/139 cut-off events. For 326/342 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 715 event pairs, 6 based on Foata normal form. 1/137 useless extension candidates. Maximal degree in co-relation 435. Up to 43 conditions per place. [2022-12-13 01:57:40,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 363 flow [2022-12-13 01:57:40,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 174 [2022-12-13 01:57:40,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [274] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (+ v_~counter~0_136 1)) 1 0))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_51|) (= v_~counter~0_136 v_~counter~0_138) (< 1 v_~N~0_67) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|) (= 2 v_thread1Thread1of1ForFork0_~i~0_57) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|))) InVars {~counter~0=v_~counter~0_138, ~N~0=v_~N~0_67} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29|, ~counter~0=v_~counter~0_136, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_44|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_38|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_51|, ~N~0=v_~N~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L41-4-->L51-4: Formula: (and (= v_~counter~0_166 v_~counter~0_164) (= v_thread1Thread1of1ForFork0_~i~0_69 (+ v_thread1Thread1of1ForFork0_~i~0_70 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_77| v_~N~0_77) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_77|) |v_thread2Thread1of1ForFork1_~i~1#1_76|) (= (ite (< 0 (+ v_~counter~0_164 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_46|) (< v_thread1Thread1of1ForFork0_~i~0_70 v_~N~0_77) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_46| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_46|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_46| 0))) InVars {~counter~0=v_~counter~0_166, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_70, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_77|, ~N~0=v_~N~0_77} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_46|, ~counter~0=v_~counter~0_164, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_46|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_48|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_42|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_69, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_46|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_50|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_76|, ~N~0=v_~N~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:40,022 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:40,022 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:40,126 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [274] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (+ v_~counter~0_136 1)) 1 0))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_51|) (= v_~counter~0_136 v_~counter~0_138) (< 1 v_~N~0_67) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|) (= 2 v_thread1Thread1of1ForFork0_~i~0_57) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|))) InVars {~counter~0=v_~counter~0_138, ~N~0=v_~N~0_67} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29|, ~counter~0=v_~counter~0_136, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_44|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_38|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_57, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_29|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_33|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_51|, ~N~0=v_~N~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:57:40,198 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:40,199 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-13 01:57:40,199 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 375 flow [2022-12-13 01:57:40,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:40,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:40,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:40,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 01:57:40,199 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:40,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:40,199 INFO L85 PathProgramCache]: Analyzing trace with hash 24471071, now seen corresponding path program 1 times [2022-12-13 01:57:40,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:40,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476900564] [2022-12-13 01:57:40,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:40,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:40,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-13 01:57:40,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:40,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476900564] [2022-12-13 01:57:40,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476900564] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:40,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932628880] [2022-12-13 01:57:40,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:40,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:40,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:40,224 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-13 01:57:40,226 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-13 01:57:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:40,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 01:57:40,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:40,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:40,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932628880] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:40,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:40,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-13 01:57:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108577385] [2022-12-13 01:57:40,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:40,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:57:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:57:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:57:40,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 01:57:40,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-13 01:57:40,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:40,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 01:57:40,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:40,416 INFO L130 PetriNetUnfolder]: 248/504 cut-off events. [2022-12-13 01:57:40,416 INFO L131 PetriNetUnfolder]: For 2328/2328 co-relation queries the response was YES. [2022-12-13 01:57:40,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 504 events. 248/504 cut-off events. For 2328/2328 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2437 event pairs, 101 based on Foata normal form. 18/522 useless extension candidates. Maximal degree in co-relation 2166. Up to 337 conditions per place. [2022-12-13 01:57:40,419 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 48 selfloop transitions, 17 changer transitions 8/73 dead transitions. [2022-12-13 01:57:40,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 719 flow [2022-12-13 01:57:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:57:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:57:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-13 01:57:40,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2022-12-13 01:57:40,420 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 375 flow. Second operand 6 states and 51 transitions. [2022-12-13 01:57:40,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 719 flow [2022-12-13 01:57:40,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 696 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:40,424 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 486 flow [2022-12-13 01:57:40,424 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2022-12-13 01:57:40,424 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-13 01:57:40,425 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:40,425 INFO L89 Accepts]: Start accepts. Operand has 56 places, 47 transitions, 486 flow [2022-12-13 01:57:40,425 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:40,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:40,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 47 transitions, 486 flow [2022-12-13 01:57:40,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 486 flow [2022-12-13 01:57:40,439 INFO L130 PetriNetUnfolder]: 37/179 cut-off events. [2022-12-13 01:57:40,439 INFO L131 PetriNetUnfolder]: For 607/634 co-relation queries the response was YES. [2022-12-13 01:57:40,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 179 events. 37/179 cut-off events. For 607/634 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1053 event pairs, 8 based on Foata normal form. 1/174 useless extension candidates. Maximal degree in co-relation 620. Up to 53 conditions per place. [2022-12-13 01:57:40,441 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 486 flow [2022-12-13 01:57:40,441 INFO L226 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-13 01:57:40,447 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:40,447 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:40,584 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:40,585 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-13 01:57:40,585 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 489 flow [2022-12-13 01:57:40,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-13 01:57:40,585 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:40,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:40,590 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-13 01:57:40,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 01:57:40,786 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:40,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:40,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1713325209, now seen corresponding path program 2 times [2022-12-13 01:57:40,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:40,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869466605] [2022-12-13 01:57:40,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:40,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:40,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:40,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869466605] [2022-12-13 01:57:40,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869466605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:40,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:40,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:57:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301236583] [2022-12-13 01:57:40,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:40,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:40,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:40,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:40,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:40,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 01:57:40,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 489 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:40,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:40,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 01:57:40,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:40,928 INFO L130 PetriNetUnfolder]: 259/535 cut-off events. [2022-12-13 01:57:40,928 INFO L131 PetriNetUnfolder]: For 3056/3056 co-relation queries the response was YES. [2022-12-13 01:57:40,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 535 events. 259/535 cut-off events. For 3056/3056 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2772 event pairs, 50 based on Foata normal form. 2/537 useless extension candidates. Maximal degree in co-relation 2474. Up to 248 conditions per place. [2022-12-13 01:57:40,932 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 54 selfloop transitions, 21 changer transitions 11/86 dead transitions. [2022-12-13 01:57:40,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 1024 flow [2022-12-13 01:57:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-13 01:57:40,933 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2022-12-13 01:57:40,933 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 489 flow. Second operand 5 states and 42 transitions. [2022-12-13 01:57:40,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 1024 flow [2022-12-13 01:57:40,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 968 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:40,941 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 678 flow [2022-12-13 01:57:40,942 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=678, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2022-12-13 01:57:40,942 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 39 predicate places. [2022-12-13 01:57:40,942 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:40,943 INFO L89 Accepts]: Start accepts. Operand has 59 places, 58 transitions, 678 flow [2022-12-13 01:57:40,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:40,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:40,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 58 transitions, 678 flow [2022-12-13 01:57:40,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 58 transitions, 678 flow [2022-12-13 01:57:40,962 INFO L130 PetriNetUnfolder]: 42/189 cut-off events. [2022-12-13 01:57:40,963 INFO L131 PetriNetUnfolder]: For 837/845 co-relation queries the response was YES. [2022-12-13 01:57:40,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 189 events. 42/189 cut-off events. For 837/845 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1149 event pairs, 7 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 698. Up to 56 conditions per place. [2022-12-13 01:57:40,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 58 transitions, 678 flow [2022-12-13 01:57:40,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-13 01:57:40,965 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [272] $Ultimate##0-->L41-4: Formula: (and (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_49|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= (ite (< 1 v_~counter~0_130) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|) (< 2 v_~N~0_65) (= v_~counter~0_130 (+ v_~counter~0_132 2)) (= v_thread1Thread1of1ForFork0_~i~0_53 3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|)) InVars {~counter~0=v_~counter~0_132, ~N~0=v_~N~0_65} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~counter~0=v_~counter~0_130, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_27|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_40|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_34|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_31|, ~N~0=v_~N~0_65, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_49|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:40,966 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:40,966 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:41,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] $Ultimate##0-->L51-4: Formula: (and (< 2 v_~N~0_79) (= v_~counter~0_172 v_~counter~0_170) (not (= (ite (< 0 (+ v_~counter~0_172 1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_48| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_48|) (= v_thread1Thread1of1ForFork0_~i~0_73 3) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_80|) (= (ite (< 0 (+ v_~counter~0_170 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_48|)) InVars {~counter~0=v_~counter~0_172, ~N~0=v_~N~0_79} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_48|, ~counter~0=v_~counter~0_170, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_48|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_50|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_44|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_73, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_48|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_52|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_80|, ~N~0=v_~N~0_79} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:57:41,164 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [269] $Ultimate##0-->L41-4: Formula: (and (= 2 v_thread1Thread1of1ForFork0_~i~0_39) (= v_~counter~0_103 (+ v_~counter~0_105 2)) (< v_thread1Thread1of1ForFork0_~i~0_39 (+ 1 v_~N~0_59))) InVars {~counter~0=v_~counter~0_105, ~N~0=v_~N~0_59} OutVars{~counter~0=v_~counter~0_103, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_26|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_20|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_39, ~N~0=v_~N~0_59} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [267] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| (ite (< 0 v_~counter~0_95) 1 0)) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_33|) (= v_~counter~0_95 (+ v_~counter~0_94 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0)) (< 0 v_~N~0_55)) InVars {~counter~0=v_~counter~0_95, ~N~0=v_~N~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_94, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_33|, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:41,228 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:57:41,228 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-13 01:57:41,228 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 697 flow [2022-12-13 01:57:41,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:41,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:41,229 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:41,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 01:57:41,229 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:41,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:41,229 INFO L85 PathProgramCache]: Analyzing trace with hash -520871335, now seen corresponding path program 1 times [2022-12-13 01:57:41,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:41,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993081534] [2022-12-13 01:57:41,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:41,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:41,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:41,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993081534] [2022-12-13 01:57:41,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993081534] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:41,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19448171] [2022-12-13 01:57:41,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:41,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:41,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:41,265 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-13 01:57:41,279 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-13 01:57:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:41,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:57:41,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:41,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:41,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19448171] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:41,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:41,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:57:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852201388] [2022-12-13 01:57:41,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:41,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:57:41,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:41,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:57:41,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:57:41,390 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-13 01:57:41,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 697 flow. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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-13 01:57:41,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:41,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-13 01:57:41,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:41,621 INFO L130 PetriNetUnfolder]: 284/588 cut-off events. [2022-12-13 01:57:41,621 INFO L131 PetriNetUnfolder]: For 4940/4940 co-relation queries the response was YES. [2022-12-13 01:57:41,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3185 conditions, 588 events. 284/588 cut-off events. For 4940/4940 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3097 event pairs, 93 based on Foata normal form. 60/648 useless extension candidates. Maximal degree in co-relation 2836. Up to 360 conditions per place. [2022-12-13 01:57:41,625 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 71 selfloop transitions, 44 changer transitions 13/128 dead transitions. [2022-12-13 01:57:41,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 128 transitions, 1466 flow [2022-12-13 01:57:41,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 01:57:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 01:57:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 90 transitions. [2022-12-13 01:57:41,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-13 01:57:41,626 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 697 flow. Second operand 12 states and 90 transitions. [2022-12-13 01:57:41,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 128 transitions, 1466 flow [2022-12-13 01:57:41,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 128 transitions, 1355 flow, removed 44 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:41,640 INFO L231 Difference]: Finished difference. Result has 73 places, 73 transitions, 1002 flow [2022-12-13 01:57:41,640 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1002, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2022-12-13 01:57:41,641 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 53 predicate places. [2022-12-13 01:57:41,641 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:41,641 INFO L89 Accepts]: Start accepts. Operand has 73 places, 73 transitions, 1002 flow [2022-12-13 01:57:41,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:41,642 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:41,642 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 73 transitions, 1002 flow [2022-12-13 01:57:41,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 73 transitions, 1002 flow [2022-12-13 01:57:41,657 INFO L130 PetriNetUnfolder]: 54/217 cut-off events. [2022-12-13 01:57:41,657 INFO L131 PetriNetUnfolder]: For 1573/1583 co-relation queries the response was YES. [2022-12-13 01:57:41,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 217 events. 54/217 cut-off events. For 1573/1583 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1337 event pairs, 8 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 991. Up to 55 conditions per place. [2022-12-13 01:57:41,659 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 73 transitions, 1002 flow [2022-12-13 01:57:41,659 INFO L226 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-13 01:57:41,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:41,794 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:41,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [294] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (ite (< 1 v_~counter~0_229) 1 0))) (and (= v_~counter~0_229 (+ v_~counter~0_231 2)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_114|) (not (= .cse0 0)) (= v_thread1Thread1of1ForFork0_~i~0_107 4) (< v_thread1Thread1of1ForFork0_~i~0_107 (+ 1 v_~N~0_97)) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|))) InVars {~counter~0=v_~counter~0_231, ~N~0=v_~N~0_97} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, ~counter~0=v_~counter~0_229, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_75|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_78|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_72|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_107, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_79|, ~N~0=v_~N~0_97, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_114|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:41,913 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:41,914 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:42,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [288] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (+ v_~counter~0_192 1))) (and (= v_thread1Thread1of1ForFork0_~i~0_85 3) (not (= (ite (< 0 .cse0) 1 0) 0)) (< 2 v_~N~0_85) (= (ite (< 0 (+ v_~counter~0_192 2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (= .cse0 v_~counter~0_190) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_93|))) InVars {~counter~0=v_~counter~0_192, ~N~0=v_~N~0_85} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|, ~counter~0=v_~counter~0_190, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_59|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_60|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_54|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_85, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_63|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_93|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:57:42,093 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:42,094 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:42,192 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 01:57:42,193 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 552 [2022-12-13 01:57:42,193 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 1043 flow [2022-12-13 01:57:42,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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-13 01:57:42,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:42,193 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:42,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 01:57:42,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:42,394 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:42,394 INFO L85 PathProgramCache]: Analyzing trace with hash -355008754, now seen corresponding path program 1 times [2022-12-13 01:57:42,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:42,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211778733] [2022-12-13 01:57:42,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:42,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:42,426 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-13 01:57:42,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:42,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211778733] [2022-12-13 01:57:42,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211778733] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:42,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937816805] [2022-12-13 01:57:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:42,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:42,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:42,427 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-13 01:57:42,430 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-13 01:57:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:42,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:57:42,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:42,498 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-13 01:57:42,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:42,517 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-13 01:57:42,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937816805] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:42,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:42,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:57:42,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017103261] [2022-12-13 01:57:42,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:42,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:57:42,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:42,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:57:42,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:57:42,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 01:57:42,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 1043 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:42,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:42,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 01:57:42,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:42,762 INFO L130 PetriNetUnfolder]: 498/1065 cut-off events. [2022-12-13 01:57:42,762 INFO L131 PetriNetUnfolder]: For 12495/12495 co-relation queries the response was YES. [2022-12-13 01:57:42,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6572 conditions, 1065 events. 498/1065 cut-off events. For 12495/12495 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6680 event pairs, 105 based on Foata normal form. 60/1123 useless extension candidates. Maximal degree in co-relation 5932. Up to 307 conditions per place. [2022-12-13 01:57:42,769 INFO L137 encePairwiseOnDemand]: 12/28 looper letters, 81 selfloop transitions, 91 changer transitions 5/177 dead transitions. [2022-12-13 01:57:42,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 177 transitions, 2576 flow [2022-12-13 01:57:42,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:57:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:57:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-12-13 01:57:42,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-13 01:57:42,770 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 1043 flow. Second operand 9 states and 91 transitions. [2022-12-13 01:57:42,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 177 transitions, 2576 flow [2022-12-13 01:57:42,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 177 transitions, 2119 flow, removed 211 selfloop flow, removed 6 redundant places. [2022-12-13 01:57:42,789 INFO L231 Difference]: Finished difference. Result has 79 places, 127 transitions, 1837 flow [2022-12-13 01:57:42,789 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1837, PETRI_PLACES=79, PETRI_TRANSITIONS=127} [2022-12-13 01:57:42,789 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 59 predicate places. [2022-12-13 01:57:42,789 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:42,789 INFO L89 Accepts]: Start accepts. Operand has 79 places, 127 transitions, 1837 flow [2022-12-13 01:57:42,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:42,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:42,790 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 127 transitions, 1837 flow [2022-12-13 01:57:42,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 127 transitions, 1837 flow [2022-12-13 01:57:42,820 INFO L130 PetriNetUnfolder]: 104/434 cut-off events. [2022-12-13 01:57:42,820 INFO L131 PetriNetUnfolder]: For 3299/3311 co-relation queries the response was YES. [2022-12-13 01:57:42,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 434 events. 104/434 cut-off events. For 3299/3311 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3316 event pairs, 11 based on Foata normal form. 1/428 useless extension candidates. Maximal degree in co-relation 2151. Up to 124 conditions per place. [2022-12-13 01:57:42,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 127 transitions, 1837 flow [2022-12-13 01:57:42,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-13 01:57:42,824 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [291] $Ultimate##0-->L41-4: Formula: (and (= |v_thread2Thread1of1ForFork1_~i~1#1_104| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (= v_~counter~0_211 (+ v_~counter~0_213 3)) (= (ite (< 0 (+ v_~counter~0_213 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|) (< v_thread1Thread1of1ForFork0_~i~0_95 (+ 1 v_~N~0_91)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69| 0)) (= v_thread1Thread1of1ForFork0_~i~0_95 4)) InVars {~counter~0=v_~counter~0_213, ~N~0=v_~N~0_91} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_69|, ~counter~0=v_~counter~0_211, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_69|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_70|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_64|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_95, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_69|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_73|, ~N~0=v_~N~0_91, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_104|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:42,824 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:42,824 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:42,920 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:42,921 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:57:42,921 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 127 transitions, 1851 flow [2022-12-13 01:57:42,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:42,921 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:42,921 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:42,932 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-13 01:57:43,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:43,126 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:43,126 INFO L85 PathProgramCache]: Analyzing trace with hash -466480503, now seen corresponding path program 1 times [2022-12-13 01:57:43,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:43,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141776653] [2022-12-13 01:57:43,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:43,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:43,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141776653] [2022-12-13 01:57:43,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141776653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:43,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:43,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:57:43,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469587624] [2022-12-13 01:57:43,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:43,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:43,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:43,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:43,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:43,148 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 01:57:43,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 127 transitions, 1851 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:43,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 01:57:43,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:43,316 INFO L130 PetriNetUnfolder]: 543/1149 cut-off events. [2022-12-13 01:57:43,316 INFO L131 PetriNetUnfolder]: For 12326/12326 co-relation queries the response was YES. [2022-12-13 01:57:43,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7475 conditions, 1149 events. 543/1149 cut-off events. For 12326/12326 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7419 event pairs, 89 based on Foata normal form. 2/1143 useless extension candidates. Maximal degree in co-relation 7020. Up to 448 conditions per place. [2022-12-13 01:57:43,325 INFO L137 encePairwiseOnDemand]: 12/28 looper letters, 100 selfloop transitions, 68 changer transitions 4/172 dead transitions. [2022-12-13 01:57:43,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 172 transitions, 2792 flow [2022-12-13 01:57:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-13 01:57:43,325 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36428571428571427 [2022-12-13 01:57:43,325 INFO L175 Difference]: Start difference. First operand has 78 places, 127 transitions, 1851 flow. Second operand 5 states and 51 transitions. [2022-12-13 01:57:43,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 172 transitions, 2792 flow [2022-12-13 01:57:43,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 172 transitions, 2594 flow, removed 99 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:43,353 INFO L231 Difference]: Finished difference. Result has 84 places, 144 transitions, 2219 flow [2022-12-13 01:57:43,354 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2219, PETRI_PLACES=84, PETRI_TRANSITIONS=144} [2022-12-13 01:57:43,354 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 64 predicate places. [2022-12-13 01:57:43,354 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:43,354 INFO L89 Accepts]: Start accepts. Operand has 84 places, 144 transitions, 2219 flow [2022-12-13 01:57:43,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:43,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:43,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 144 transitions, 2219 flow [2022-12-13 01:57:43,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 144 transitions, 2219 flow [2022-12-13 01:57:43,388 INFO L130 PetriNetUnfolder]: 117/474 cut-off events. [2022-12-13 01:57:43,389 INFO L131 PetriNetUnfolder]: For 4676/4688 co-relation queries the response was YES. [2022-12-13 01:57:43,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2649 conditions, 474 events. 117/474 cut-off events. For 4676/4688 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3689 event pairs, 11 based on Foata normal form. 1/467 useless extension candidates. Maximal degree in co-relation 2471. Up to 135 conditions per place. [2022-12-13 01:57:43,392 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 144 transitions, 2219 flow [2022-12-13 01:57:43,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-13 01:57:43,393 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:43,394 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 01:57:43,394 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 144 transitions, 2219 flow [2022-12-13 01:57:43,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,394 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:43,394 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:43,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 01:57:43,394 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:43,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:43,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1374664944, now seen corresponding path program 1 times [2022-12-13 01:57:43,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:43,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055327350] [2022-12-13 01:57:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:43,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:43,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:43,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055327350] [2022-12-13 01:57:43,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055327350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:43,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:43,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:57:43,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838737884] [2022-12-13 01:57:43,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:43,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:43,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:43,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:43,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:43,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 01:57:43,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 144 transitions, 2219 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:43,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 01:57:43,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:43,596 INFO L130 PetriNetUnfolder]: 532/1125 cut-off events. [2022-12-13 01:57:43,597 INFO L131 PetriNetUnfolder]: For 14186/14186 co-relation queries the response was YES. [2022-12-13 01:57:43,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7602 conditions, 1125 events. 532/1125 cut-off events. For 14186/14186 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7007 event pairs, 91 based on Foata normal form. 3/1120 useless extension candidates. Maximal degree in co-relation 7110. Up to 1062 conditions per place. [2022-12-13 01:57:43,606 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 133 selfloop transitions, 16 changer transitions 10/159 dead transitions. [2022-12-13 01:57:43,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 159 transitions, 2621 flow [2022-12-13 01:57:43,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-13 01:57:43,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-13 01:57:43,607 INFO L175 Difference]: Start difference. First operand has 84 places, 144 transitions, 2219 flow. Second operand 4 states and 49 transitions. [2022-12-13 01:57:43,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 159 transitions, 2621 flow [2022-12-13 01:57:43,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 159 transitions, 2566 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:43,676 INFO L231 Difference]: Finished difference. Result has 88 places, 143 transitions, 2192 flow [2022-12-13 01:57:43,676 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2135, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2192, PETRI_PLACES=88, PETRI_TRANSITIONS=143} [2022-12-13 01:57:43,677 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 68 predicate places. [2022-12-13 01:57:43,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:43,677 INFO L89 Accepts]: Start accepts. Operand has 88 places, 143 transitions, 2192 flow [2022-12-13 01:57:43,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:43,678 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:43,678 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 143 transitions, 2192 flow [2022-12-13 01:57:43,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 143 transitions, 2192 flow [2022-12-13 01:57:43,712 INFO L130 PetriNetUnfolder]: 116/461 cut-off events. [2022-12-13 01:57:43,712 INFO L131 PetriNetUnfolder]: For 4443/4455 co-relation queries the response was YES. [2022-12-13 01:57:43,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 461 events. 116/461 cut-off events. For 4443/4455 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3511 event pairs, 11 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 2462. Up to 133 conditions per place. [2022-12-13 01:57:43,716 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 143 transitions, 2192 flow [2022-12-13 01:57:43,716 INFO L226 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-13 01:57:43,717 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:43,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 01:57:43,718 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 143 transitions, 2192 flow [2022-12-13 01:57:43,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:43,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:43,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 01:57:43,718 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1489181548, now seen corresponding path program 1 times [2022-12-13 01:57:43,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:43,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19345607] [2022-12-13 01:57:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:43,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:43,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:43,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19345607] [2022-12-13 01:57:43,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19345607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:43,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:43,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:57:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537409548] [2022-12-13 01:57:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:43,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:43,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:43,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:43,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:43,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 01:57:43,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 143 transitions, 2192 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:43,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 01:57:43,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:43,901 INFO L130 PetriNetUnfolder]: 548/1148 cut-off events. [2022-12-13 01:57:43,902 INFO L131 PetriNetUnfolder]: For 15615/15615 co-relation queries the response was YES. [2022-12-13 01:57:43,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7848 conditions, 1148 events. 548/1148 cut-off events. For 15615/15615 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7254 event pairs, 208 based on Foata normal form. 20/1162 useless extension candidates. Maximal degree in co-relation 7392. Up to 939 conditions per place. [2022-12-13 01:57:43,910 INFO L137 encePairwiseOnDemand]: 14/28 looper letters, 117 selfloop transitions, 44 changer transitions 2/163 dead transitions. [2022-12-13 01:57:43,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 163 transitions, 2733 flow [2022-12-13 01:57:43,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-13 01:57:43,911 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-13 01:57:43,911 INFO L175 Difference]: Start difference. First operand has 88 places, 143 transitions, 2192 flow. Second operand 4 states and 44 transitions. [2022-12-13 01:57:43,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 163 transitions, 2733 flow [2022-12-13 01:57:43,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 163 transitions, 2719 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:43,937 INFO L231 Difference]: Finished difference. Result has 91 places, 147 transitions, 2377 flow [2022-12-13 01:57:43,937 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2178, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2377, PETRI_PLACES=91, PETRI_TRANSITIONS=147} [2022-12-13 01:57:43,938 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 71 predicate places. [2022-12-13 01:57:43,938 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:43,938 INFO L89 Accepts]: Start accepts. Operand has 91 places, 147 transitions, 2377 flow [2022-12-13 01:57:43,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:43,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:43,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 147 transitions, 2377 flow [2022-12-13 01:57:43,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 147 transitions, 2377 flow [2022-12-13 01:57:43,972 INFO L130 PetriNetUnfolder]: 121/472 cut-off events. [2022-12-13 01:57:43,972 INFO L131 PetriNetUnfolder]: For 5106/5138 co-relation queries the response was YES. [2022-12-13 01:57:43,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 472 events. 121/472 cut-off events. For 5106/5138 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3585 event pairs, 11 based on Foata normal form. 1/467 useless extension candidates. Maximal degree in co-relation 2593. Up to 137 conditions per place. [2022-12-13 01:57:43,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 147 transitions, 2377 flow [2022-12-13 01:57:43,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-13 01:57:43,981 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:43,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 01:57:43,983 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 147 transitions, 2377 flow [2022-12-13 01:57:43,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:43,983 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:43,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 01:57:43,983 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:43,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:43,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2136773802, now seen corresponding path program 1 times [2022-12-13 01:57:43,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:43,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995490031] [2022-12-13 01:57:43,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:43,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:44,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:44,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995490031] [2022-12-13 01:57:44,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995490031] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:44,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522418615] [2022-12-13 01:57:44,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:44,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:44,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:44,025 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-13 01:57:44,027 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-13 01:57:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:44,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:57:44,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:44,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:44,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522418615] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:44,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:44,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:57:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549671871] [2022-12-13 01:57:44,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:44,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:57:44,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:44,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:57:44,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:57:44,115 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 01:57:44,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 147 transitions, 2377 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:44,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:44,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 01:57:44,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:44,376 INFO L130 PetriNetUnfolder]: 553/1155 cut-off events. [2022-12-13 01:57:44,376 INFO L131 PetriNetUnfolder]: For 16461/16461 co-relation queries the response was YES. [2022-12-13 01:57:44,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8158 conditions, 1155 events. 553/1155 cut-off events. For 16461/16461 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7263 event pairs, 212 based on Foata normal form. 4/1155 useless extension candidates. Maximal degree in co-relation 7689. Up to 955 conditions per place. [2022-12-13 01:57:44,389 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 127 selfloop transitions, 49 changer transitions 5/181 dead transitions. [2022-12-13 01:57:44,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 181 transitions, 2978 flow [2022-12-13 01:57:44,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:57:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:57:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2022-12-13 01:57:44,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29910714285714285 [2022-12-13 01:57:44,390 INFO L175 Difference]: Start difference. First operand has 91 places, 147 transitions, 2377 flow. Second operand 8 states and 67 transitions. [2022-12-13 01:57:44,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 181 transitions, 2978 flow [2022-12-13 01:57:44,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 181 transitions, 2914 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:44,419 INFO L231 Difference]: Finished difference. Result has 98 places, 147 transitions, 2426 flow [2022-12-13 01:57:44,420 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=2315, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2426, PETRI_PLACES=98, PETRI_TRANSITIONS=147} [2022-12-13 01:57:44,420 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 78 predicate places. [2022-12-13 01:57:44,420 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:44,420 INFO L89 Accepts]: Start accepts. Operand has 98 places, 147 transitions, 2426 flow [2022-12-13 01:57:44,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:44,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:44,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 147 transitions, 2426 flow [2022-12-13 01:57:44,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 147 transitions, 2426 flow [2022-12-13 01:57:44,456 INFO L130 PetriNetUnfolder]: 121/476 cut-off events. [2022-12-13 01:57:44,456 INFO L131 PetriNetUnfolder]: For 5529/5561 co-relation queries the response was YES. [2022-12-13 01:57:44,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2834 conditions, 476 events. 121/476 cut-off events. For 5529/5561 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3635 event pairs, 11 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 2657. Up to 139 conditions per place. [2022-12-13 01:57:44,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 147 transitions, 2426 flow [2022-12-13 01:57:44,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-13 01:57:44,529 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:44,530 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 01:57:44,530 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 147 transitions, 2453 flow [2022-12-13 01:57:44,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:44,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:44,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:44,538 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-13 01:57:44,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:44,736 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:44,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:44,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1806711852, now seen corresponding path program 1 times [2022-12-13 01:57:44,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:44,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770178604] [2022-12-13 01:57:44,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:44,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:44,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770178604] [2022-12-13 01:57:44,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770178604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:44,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488574193] [2022-12-13 01:57:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:44,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:44,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:44,801 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-13 01:57:44,805 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-13 01:57:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:44,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 01:57:44,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:44,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:44,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488574193] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:44,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:44,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2022-12-13 01:57:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679337637] [2022-12-13 01:57:44,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:44,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:57:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:44,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:57:44,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:57:44,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 01:57:44,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 147 transitions, 2453 flow. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:44,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:44,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 01:57:44,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:45,107 INFO L130 PetriNetUnfolder]: 706/1453 cut-off events. [2022-12-13 01:57:45,107 INFO L131 PetriNetUnfolder]: For 22405/22405 co-relation queries the response was YES. [2022-12-13 01:57:45,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10581 conditions, 1453 events. 706/1453 cut-off events. For 22405/22405 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9370 event pairs, 99 based on Foata normal form. 5/1452 useless extension candidates. Maximal degree in co-relation 9551. Up to 1143 conditions per place. [2022-12-13 01:57:45,140 INFO L137 encePairwiseOnDemand]: 14/29 looper letters, 153 selfloop transitions, 48 changer transitions 8/209 dead transitions. [2022-12-13 01:57:45,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 209 transitions, 3678 flow [2022-12-13 01:57:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 01:57:45,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4413793103448276 [2022-12-13 01:57:45,141 INFO L175 Difference]: Start difference. First operand has 98 places, 147 transitions, 2453 flow. Second operand 5 states and 64 transitions. [2022-12-13 01:57:45,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 209 transitions, 3678 flow [2022-12-13 01:57:45,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 209 transitions, 3576 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-13 01:57:45,181 INFO L231 Difference]: Finished difference. Result has 102 places, 177 transitions, 3095 flow [2022-12-13 01:57:45,182 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2379, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3095, PETRI_PLACES=102, PETRI_TRANSITIONS=177} [2022-12-13 01:57:45,183 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 82 predicate places. [2022-12-13 01:57:45,183 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:45,183 INFO L89 Accepts]: Start accepts. Operand has 102 places, 177 transitions, 3095 flow [2022-12-13 01:57:45,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:45,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:45,186 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 177 transitions, 3095 flow [2022-12-13 01:57:45,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 177 transitions, 3095 flow [2022-12-13 01:57:45,229 INFO L130 PetriNetUnfolder]: 153/586 cut-off events. [2022-12-13 01:57:45,229 INFO L131 PetriNetUnfolder]: For 7322/7362 co-relation queries the response was YES. [2022-12-13 01:57:45,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3700 conditions, 586 events. 153/586 cut-off events. For 7322/7362 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4701 event pairs, 15 based on Foata normal form. 3/583 useless extension candidates. Maximal degree in co-relation 3359. Up to 179 conditions per place. [2022-12-13 01:57:45,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 177 transitions, 3095 flow [2022-12-13 01:57:45,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 592 [2022-12-13 01:57:45,238 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:45,239 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 01:57:45,239 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 177 transitions, 3095 flow [2022-12-13 01:57:45,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:45,239 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:45,239 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:45,244 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-13 01:57:45,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:45,445 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:45,445 INFO L85 PathProgramCache]: Analyzing trace with hash -649882558, now seen corresponding path program 1 times [2022-12-13 01:57:45,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:45,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753407343] [2022-12-13 01:57:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:45,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:45,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753407343] [2022-12-13 01:57:45,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753407343] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:45,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24018218] [2022-12-13 01:57:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:45,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:45,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:45,528 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-13 01:57:45,532 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-13 01:57:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:45,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:57:45,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:45,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:45,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24018218] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:45,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:45,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 01:57:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057225023] [2022-12-13 01:57:45,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:45,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:57:45,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:45,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:57:45,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:57:45,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 01:57:45,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 177 transitions, 3095 flow. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-13 01:57:45,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:45,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 01:57:45,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:45,871 INFO L130 PetriNetUnfolder]: 721/1469 cut-off events. [2022-12-13 01:57:45,871 INFO L131 PetriNetUnfolder]: For 26020/26020 co-relation queries the response was YES. [2022-12-13 01:57:45,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11068 conditions, 1469 events. 721/1469 cut-off events. For 26020/26020 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 9501 event pairs, 276 based on Foata normal form. 24/1489 useless extension candidates. Maximal degree in co-relation 9971. Up to 1255 conditions per place. [2022-12-13 01:57:45,884 INFO L137 encePairwiseOnDemand]: 14/29 looper letters, 160 selfloop transitions, 46 changer transitions 4/210 dead transitions. [2022-12-13 01:57:45,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 210 transitions, 3842 flow [2022-12-13 01:57:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:57:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:57:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-12-13 01:57:45,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29064039408866993 [2022-12-13 01:57:45,885 INFO L175 Difference]: Start difference. First operand has 102 places, 177 transitions, 3095 flow. Second operand 7 states and 59 transitions. [2022-12-13 01:57:45,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 210 transitions, 3842 flow [2022-12-13 01:57:45,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 210 transitions, 3751 flow, removed 40 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:45,929 INFO L231 Difference]: Finished difference. Result has 108 places, 179 transitions, 3164 flow [2022-12-13 01:57:45,929 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3012, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3164, PETRI_PLACES=108, PETRI_TRANSITIONS=179} [2022-12-13 01:57:45,930 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 88 predicate places. [2022-12-13 01:57:45,930 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:45,931 INFO L89 Accepts]: Start accepts. Operand has 108 places, 179 transitions, 3164 flow [2022-12-13 01:57:45,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:45,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:45,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 179 transitions, 3164 flow [2022-12-13 01:57:45,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 179 transitions, 3164 flow [2022-12-13 01:57:45,975 INFO L130 PetriNetUnfolder]: 157/593 cut-off events. [2022-12-13 01:57:45,975 INFO L131 PetriNetUnfolder]: For 8179/8217 co-relation queries the response was YES. [2022-12-13 01:57:45,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 593 events. 157/593 cut-off events. For 8179/8217 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4741 event pairs, 15 based on Foata normal form. 3/592 useless extension candidates. Maximal degree in co-relation 3564. Up to 180 conditions per place. [2022-12-13 01:57:45,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 179 transitions, 3164 flow [2022-12-13 01:57:45,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-13 01:57:45,999 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:46,000 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 01:57:46,000 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 179 transitions, 3164 flow [2022-12-13 01:57:46,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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-13 01:57:46,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:46,001 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:46,021 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-13 01:57:46,205 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,SelfDestructingSolverStorable20 [2022-12-13 01:57:46,205 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:46,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:46,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1483491212, now seen corresponding path program 1 times [2022-12-13 01:57:46,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:46,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117166924] [2022-12-13 01:57:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:46,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:46,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:46,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:46,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117166924] [2022-12-13 01:57:46,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117166924] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:46,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477522884] [2022-12-13 01:57:46,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:46,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:46,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:46,262 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-13 01:57:46,298 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-13 01:57:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:46,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 01:57:46,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:46,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:46,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477522884] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:46,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:46,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-12-13 01:57:46,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267127459] [2022-12-13 01:57:46,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:46,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:46,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:46,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:46,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:46,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 01:57:46,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 179 transitions, 3164 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:46,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 01:57:46,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:46,613 INFO L130 PetriNetUnfolder]: 786/1599 cut-off events. [2022-12-13 01:57:46,613 INFO L131 PetriNetUnfolder]: For 28796/28796 co-relation queries the response was YES. [2022-12-13 01:57:46,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12290 conditions, 1599 events. 786/1599 cut-off events. For 28796/28796 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10405 event pairs, 115 based on Foata normal form. 5/1604 useless extension candidates. Maximal degree in co-relation 11803. Up to 1459 conditions per place. [2022-12-13 01:57:46,625 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 185 selfloop transitions, 28 changer transitions 6/219 dead transitions. [2022-12-13 01:57:46,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 219 transitions, 4166 flow [2022-12-13 01:57:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-13 01:57:46,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 01:57:46,626 INFO L175 Difference]: Start difference. First operand has 106 places, 179 transitions, 3164 flow. Second operand 5 states and 57 transitions. [2022-12-13 01:57:46,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 219 transitions, 4166 flow [2022-12-13 01:57:46,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 219 transitions, 3941 flow, removed 61 selfloop flow, removed 5 redundant places. [2022-12-13 01:57:46,674 INFO L231 Difference]: Finished difference. Result has 108 places, 195 transitions, 3432 flow [2022-12-13 01:57:46,674 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=3001, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3432, PETRI_PLACES=108, PETRI_TRANSITIONS=195} [2022-12-13 01:57:46,674 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 88 predicate places. [2022-12-13 01:57:46,674 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:46,674 INFO L89 Accepts]: Start accepts. Operand has 108 places, 195 transitions, 3432 flow [2022-12-13 01:57:46,675 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:46,676 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:46,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 195 transitions, 3432 flow [2022-12-13 01:57:46,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 195 transitions, 3432 flow [2022-12-13 01:57:46,724 INFO L130 PetriNetUnfolder]: 172/645 cut-off events. [2022-12-13 01:57:46,724 INFO L131 PetriNetUnfolder]: For 8952/8990 co-relation queries the response was YES. [2022-12-13 01:57:46,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4160 conditions, 645 events. 172/645 cut-off events. For 8952/8990 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5185 event pairs, 16 based on Foata normal form. 3/644 useless extension candidates. Maximal degree in co-relation 3970. Up to 197 conditions per place. [2022-12-13 01:57:46,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 195 transitions, 3432 flow [2022-12-13 01:57:46,730 INFO L226 LiptonReduction]: Number of co-enabled transitions 672 [2022-12-13 01:57:46,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [302] $Ultimate##0-->L41-4: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_95| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_95| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= (ite (< 0 (+ v_~counter~0_267 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|) (= v_~counter~0_265 (+ v_~counter~0_267 4)) (= |v_thread2Thread1of1ForFork1_~i~1#1_136| 1) (= 5 v_thread1Thread1of1ForFork0_~i~0_125) (< v_thread1Thread1of1ForFork0_~i~0_125 (+ v_~N~0_107 1))) InVars {~counter~0=v_~counter~0_267, ~N~0=v_~N~0_107} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_95|, ~counter~0=v_~counter~0_265, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_95|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_96|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_90|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_125, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_95|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_99|, ~N~0=v_~N~0_107, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_136|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:46,731 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:46,731 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:46,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:46,822 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 01:57:46,822 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 195 transitions, 3451 flow [2022-12-13 01:57:46,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:46,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:46,828 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-13 01:57:47,028 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,SelfDestructingSolverStorable21 [2022-12-13 01:57:47,028 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:47,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1972382543, now seen corresponding path program 1 times [2022-12-13 01:57:47,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:47,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453062433] [2022-12-13 01:57:47,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:47,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:47,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:47,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453062433] [2022-12-13 01:57:47,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453062433] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:47,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989581641] [2022-12-13 01:57:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:47,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:47,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:47,081 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-13 01:57:47,083 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-13 01:57:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:47,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:57:47,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:47,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:47,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989581641] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:47,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:47,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 01:57:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808516937] [2022-12-13 01:57:47,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:47,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:57:47,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:47,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:57:47,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:57:47,170 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 01:57:47,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 195 transitions, 3451 flow. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:47,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:47,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 01:57:47,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:47,509 INFO L130 PetriNetUnfolder]: 827/1627 cut-off events. [2022-12-13 01:57:47,509 INFO L131 PetriNetUnfolder]: For 30281/30281 co-relation queries the response was YES. [2022-12-13 01:57:47,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12797 conditions, 1627 events. 827/1627 cut-off events. For 30281/30281 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10331 event pairs, 63 based on Foata normal form. 20/1647 useless extension candidates. Maximal degree in co-relation 12308. Up to 557 conditions per place. [2022-12-13 01:57:47,522 INFO L137 encePairwiseOnDemand]: 11/28 looper letters, 99 selfloop transitions, 188 changer transitions 11/298 dead transitions. [2022-12-13 01:57:47,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 298 transitions, 5384 flow [2022-12-13 01:57:47,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:57:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:57:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2022-12-13 01:57:47,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24489795918367346 [2022-12-13 01:57:47,524 INFO L175 Difference]: Start difference. First operand has 108 places, 195 transitions, 3451 flow. Second operand 14 states and 96 transitions. [2022-12-13 01:57:47,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 298 transitions, 5384 flow [2022-12-13 01:57:47,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 298 transitions, 5139 flow, removed 100 selfloop flow, removed 3 redundant places. [2022-12-13 01:57:47,581 INFO L231 Difference]: Finished difference. Result has 125 places, 240 transitions, 4702 flow [2022-12-13 01:57:47,581 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3254, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4702, PETRI_PLACES=125, PETRI_TRANSITIONS=240} [2022-12-13 01:57:47,581 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 105 predicate places. [2022-12-13 01:57:47,581 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:47,581 INFO L89 Accepts]: Start accepts. Operand has 125 places, 240 transitions, 4702 flow [2022-12-13 01:57:47,582 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:47,582 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:47,582 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 240 transitions, 4702 flow [2022-12-13 01:57:47,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 240 transitions, 4702 flow [2022-12-13 01:57:47,635 INFO L130 PetriNetUnfolder]: 178/626 cut-off events. [2022-12-13 01:57:47,635 INFO L131 PetriNetUnfolder]: For 12434/12446 co-relation queries the response was YES. [2022-12-13 01:57:47,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4728 conditions, 626 events. 178/626 cut-off events. For 12434/12446 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4950 event pairs, 8 based on Foata normal form. 1/624 useless extension candidates. Maximal degree in co-relation 4503. Up to 194 conditions per place. [2022-12-13 01:57:47,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 240 transitions, 4702 flow [2022-12-13 01:57:47,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 798 [2022-12-13 01:57:47,644 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:47,644 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 01:57:47,644 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 240 transitions, 4702 flow [2022-12-13 01:57:47,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:47,644 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:47,645 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:47,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 01:57:47,849 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,SelfDestructingSolverStorable22 [2022-12-13 01:57:47,849 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:47,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:47,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1430005387, now seen corresponding path program 1 times [2022-12-13 01:57:47,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:47,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974778597] [2022-12-13 01:57:47,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:47,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:47,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:47,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974778597] [2022-12-13 01:57:47,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974778597] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:47,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483767273] [2022-12-13 01:57:47,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:47,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:47,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:47,929 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-13 01:57:47,954 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-13 01:57:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:47,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:57:47,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:48,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:48,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483767273] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:48,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:48,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:57:48,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321074376] [2022-12-13 01:57:48,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:48,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:57:48,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:48,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:57:48,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:57:48,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 01:57:48,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 240 transitions, 4702 flow. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:48,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 01:57:48,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:48,440 INFO L130 PetriNetUnfolder]: 809/1586 cut-off events. [2022-12-13 01:57:48,440 INFO L131 PetriNetUnfolder]: For 42021/42021 co-relation queries the response was YES. [2022-12-13 01:57:48,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13874 conditions, 1586 events. 809/1586 cut-off events. For 42021/42021 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9876 event pairs, 259 based on Foata normal form. 4/1590 useless extension candidates. Maximal degree in co-relation 13311. Up to 1359 conditions per place. [2022-12-13 01:57:48,453 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 216 selfloop transitions, 59 changer transitions 0/275 dead transitions. [2022-12-13 01:57:48,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 275 transitions, 5583 flow [2022-12-13 01:57:48,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:57:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:57:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 66 transitions. [2022-12-13 01:57:48,454 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-13 01:57:48,454 INFO L175 Difference]: Start difference. First operand has 124 places, 240 transitions, 4702 flow. Second operand 9 states and 66 transitions. [2022-12-13 01:57:48,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 275 transitions, 5583 flow [2022-12-13 01:57:48,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 275 transitions, 5309 flow, removed 130 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:48,570 INFO L231 Difference]: Finished difference. Result has 133 places, 242 transitions, 4623 flow [2022-12-13 01:57:48,570 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4443, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4623, PETRI_PLACES=133, PETRI_TRANSITIONS=242} [2022-12-13 01:57:48,570 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 113 predicate places. [2022-12-13 01:57:48,570 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:48,571 INFO L89 Accepts]: Start accepts. Operand has 133 places, 242 transitions, 4623 flow [2022-12-13 01:57:48,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:48,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:48,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 242 transitions, 4623 flow [2022-12-13 01:57:48,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 242 transitions, 4623 flow [2022-12-13 01:57:48,626 INFO L130 PetriNetUnfolder]: 178/641 cut-off events. [2022-12-13 01:57:48,627 INFO L131 PetriNetUnfolder]: For 12791/12827 co-relation queries the response was YES. [2022-12-13 01:57:48,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4551 conditions, 641 events. 178/641 cut-off events. For 12791/12827 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5103 event pairs, 8 based on Foata normal form. 3/641 useless extension candidates. Maximal degree in co-relation 4328. Up to 177 conditions per place. [2022-12-13 01:57:48,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 242 transitions, 4623 flow [2022-12-13 01:57:48,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 806 [2022-12-13 01:57:48,633 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:48,878 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] $Ultimate##0-->L51-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_135 (+ v_~N~0_109 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_150|) (= 5 v_thread1Thread1of1ForFork0_~i~0_135) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite (< 0 (+ v_~counter~0_288 4)) 1 0)) (= v_~counter~0_286 (+ v_~counter~0_288 3)) (not (= (ite (< 0 (+ v_~counter~0_288 1)) 1 0) 0))) InVars {~counter~0=v_~counter~0_288, ~N~0=v_~N~0_109} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|, ~counter~0=v_~counter~0_286, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_107|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_106|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_100|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_135, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_111|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_150|, ~N~0=v_~N~0_109} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [305] L41-4-->L51-4: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~i~0_142 1) v_thread1Thread1of1ForFork0_~i~0_141) (= v_~counter~0_300 v_~counter~0_298) (< |v_thread2Thread1of1ForFork1_~i~1#1_161| v_~N~0_111) (= |v_thread2Thread1of1ForFork1_~i~1#1_160| (+ |v_thread2Thread1of1ForFork1_~i~1#1_161| 1)) (< v_thread1Thread1of1ForFork0_~i~0_142 v_~N~0_111) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115| (ite (< 0 (+ v_~counter~0_298 1)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_115|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_115| 0))) InVars {~counter~0=v_~counter~0_300, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_142, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_161|, ~N~0=v_~N~0_111} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_115|, ~counter~0=v_~counter~0_298, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_115|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_112|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_106|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_141, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_115|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_119|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_160|, ~N~0=v_~N~0_111} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:48,879 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:48,879 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:48,999 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] $Ultimate##0-->L51-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_135 (+ v_~N~0_109 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_150|) (= 5 v_thread1Thread1of1ForFork0_~i~0_135) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite (< 0 (+ v_~counter~0_288 4)) 1 0)) (= v_~counter~0_286 (+ v_~counter~0_288 3)) (not (= (ite (< 0 (+ v_~counter~0_288 1)) 1 0) 0))) InVars {~counter~0=v_~counter~0_288, ~N~0=v_~N~0_109} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|, ~counter~0=v_~counter~0_286, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_107|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_106|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_100|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_135, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_111|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_150|, ~N~0=v_~N~0_109} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [306] L41-4-->L51-4: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.offset_37| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117| 0)) (< v_thread1Thread1of1ForFork0_~i~0_146 v_~N~0_113) (not (< v_thread1Thread1of1ForFork0_~i~0_145 v_~N~0_113)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_165|) |v_thread2Thread1of1ForFork1_~i~1#1_164|) (< |v_thread2Thread1of1ForFork1_~i~1#1_164| (+ v_~N~0_113 1)) (= |v_thread1Thread1of1ForFork0_#res.base_37| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|) (= (+ v_thread1Thread1of1ForFork0_~i~0_146 1) v_thread1Thread1of1ForFork0_~i~0_145) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117| (ite (< 0 (+ v_~counter~0_304 1)) 1 0)) (= v_~counter~0_306 (+ v_~counter~0_304 2))) InVars {~counter~0=v_~counter~0_306, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_146, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_165|, ~N~0=v_~N~0_113} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_117|, ~counter~0=v_~counter~0_304, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_117|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_37|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_114|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_108|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_145, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_117|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_37|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_121|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_164|, ~N~0=v_~N~0_113} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:49,000 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:49,000 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:49,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] $Ultimate##0-->L51-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_135 (+ v_~N~0_109 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_150|) (= 5 v_thread1Thread1of1ForFork0_~i~0_135) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107| (ite (< 0 (+ v_~counter~0_288 4)) 1 0)) (= v_~counter~0_286 (+ v_~counter~0_288 3)) (not (= (ite (< 0 (+ v_~counter~0_288 1)) 1 0) 0))) InVars {~counter~0=v_~counter~0_288, ~N~0=v_~N~0_109} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_107|, ~counter~0=v_~counter~0_286, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_107|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_106|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_100|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_135, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_107|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_111|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_150|, ~N~0=v_~N~0_109} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:57:49,239 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:49,239 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:49,343 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:57:49,343 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 773 [2022-12-13 01:57:49,344 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 242 transitions, 4744 flow [2022-12-13 01:57:49,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:49,344 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:49,350 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-13 01:57:49,548 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,SelfDestructingSolverStorable23 [2022-12-13 01:57:49,548 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:49,549 INFO L85 PathProgramCache]: Analyzing trace with hash -67732169, now seen corresponding path program 1 times [2022-12-13 01:57:49,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:49,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994752608] [2022-12-13 01:57:49,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:49,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:49,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:49,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994752608] [2022-12-13 01:57:49,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994752608] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:49,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473941308] [2022-12-13 01:57:49,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:49,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:49,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:49,615 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-13 01:57:49,647 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-13 01:57:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:49,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 01:57:49,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:49,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:49,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473941308] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:49,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:49,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2022-12-13 01:57:49,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884036783] [2022-12-13 01:57:49,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:49,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:57:49,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:49,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:57:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:57:49,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 01:57:49,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 242 transitions, 4744 flow. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:49,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 01:57:49,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:50,072 INFO L130 PetriNetUnfolder]: 898/1773 cut-off events. [2022-12-13 01:57:50,072 INFO L131 PetriNetUnfolder]: For 51901/51901 co-relation queries the response was YES. [2022-12-13 01:57:50,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15546 conditions, 1773 events. 898/1773 cut-off events. For 51901/51901 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11540 event pairs, 117 based on Foata normal form. 12/1785 useless extension candidates. Maximal degree in co-relation 14987. Up to 1108 conditions per place. [2022-12-13 01:57:50,086 INFO L137 encePairwiseOnDemand]: 14/33 looper letters, 202 selfloop transitions, 82 changer transitions 25/309 dead transitions. [2022-12-13 01:57:50,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 309 transitions, 6399 flow [2022-12-13 01:57:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 01:57:50,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2022-12-13 01:57:50,087 INFO L175 Difference]: Start difference. First operand has 133 places, 242 transitions, 4744 flow. Second operand 5 states and 64 transitions. [2022-12-13 01:57:50,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 309 transitions, 6399 flow [2022-12-13 01:57:50,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 309 transitions, 6226 flow, removed 56 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:50,219 INFO L231 Difference]: Finished difference. Result has 136 places, 252 transitions, 5124 flow [2022-12-13 01:57:50,219 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4600, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5124, PETRI_PLACES=136, PETRI_TRANSITIONS=252} [2022-12-13 01:57:50,219 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 116 predicate places. [2022-12-13 01:57:50,219 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:50,219 INFO L89 Accepts]: Start accepts. Operand has 136 places, 252 transitions, 5124 flow [2022-12-13 01:57:50,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:50,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:50,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 252 transitions, 5124 flow [2022-12-13 01:57:50,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 252 transitions, 5124 flow [2022-12-13 01:57:50,282 INFO L130 PetriNetUnfolder]: 191/691 cut-off events. [2022-12-13 01:57:50,283 INFO L131 PetriNetUnfolder]: For 14994/15036 co-relation queries the response was YES. [2022-12-13 01:57:50,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5243 conditions, 691 events. 191/691 cut-off events. For 14994/15036 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5687 event pairs, 12 based on Foata normal form. 3/690 useless extension candidates. Maximal degree in co-relation 5014. Up to 203 conditions per place. [2022-12-13 01:57:50,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 252 transitions, 5124 flow [2022-12-13 01:57:50,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-13 01:57:50,291 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:50,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-13 01:57:50,291 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 252 transitions, 5124 flow [2022-12-13 01:57:50,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:50,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:50,298 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-13 01:57:50,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:50,498 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:50,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:50,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1764549366, now seen corresponding path program 1 times [2022-12-13 01:57:50,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:50,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307802626] [2022-12-13 01:57:50,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:50,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:50,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307802626] [2022-12-13 01:57:50,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307802626] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:50,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547350396] [2022-12-13 01:57:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:50,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:50,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:50,528 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-13 01:57:50,530 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-13 01:57:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:50,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:57:50,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:50,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:50,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547350396] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:50,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:50,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 01:57:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575830324] [2022-12-13 01:57:50,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:50,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:57:50,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:50,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:57:50,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:57:50,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:57:50,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 252 transitions, 5124 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:50,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:57:50,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:50,974 INFO L130 PetriNetUnfolder]: 1017/2004 cut-off events. [2022-12-13 01:57:50,974 INFO L131 PetriNetUnfolder]: For 67520/67520 co-relation queries the response was YES. [2022-12-13 01:57:50,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17802 conditions, 2004 events. 1017/2004 cut-off events. For 67520/67520 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 13217 event pairs, 281 based on Foata normal form. 88/2092 useless extension candidates. Maximal degree in co-relation 17235. Up to 1357 conditions per place. [2022-12-13 01:57:50,991 INFO L137 encePairwiseOnDemand]: 14/31 looper letters, 208 selfloop transitions, 127 changer transitions 3/338 dead transitions. [2022-12-13 01:57:50,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 338 transitions, 7264 flow [2022-12-13 01:57:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:57:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:57:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-13 01:57:50,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29493087557603687 [2022-12-13 01:57:50,992 INFO L175 Difference]: Start difference. First operand has 135 places, 252 transitions, 5124 flow. Second operand 7 states and 64 transitions. [2022-12-13 01:57:50,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 338 transitions, 7264 flow [2022-12-13 01:57:51,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 338 transitions, 7141 flow, removed 37 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:51,146 INFO L231 Difference]: Finished difference. Result has 141 places, 284 transitions, 6230 flow [2022-12-13 01:57:51,147 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=5029, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6230, PETRI_PLACES=141, PETRI_TRANSITIONS=284} [2022-12-13 01:57:51,147 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 121 predicate places. [2022-12-13 01:57:51,147 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:51,147 INFO L89 Accepts]: Start accepts. Operand has 141 places, 284 transitions, 6230 flow [2022-12-13 01:57:51,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:51,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:51,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 284 transitions, 6230 flow [2022-12-13 01:57:51,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 284 transitions, 6230 flow [2022-12-13 01:57:51,224 INFO L130 PetriNetUnfolder]: 219/787 cut-off events. [2022-12-13 01:57:51,225 INFO L131 PetriNetUnfolder]: For 18744/18786 co-relation queries the response was YES. [2022-12-13 01:57:51,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6192 conditions, 787 events. 219/787 cut-off events. For 18744/18786 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6593 event pairs, 13 based on Foata normal form. 3/785 useless extension candidates. Maximal degree in co-relation 5958. Up to 225 conditions per place. [2022-12-13 01:57:51,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 284 transitions, 6230 flow [2022-12-13 01:57:51,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 978 [2022-12-13 01:57:51,234 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:51,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 01:57:51,234 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 284 transitions, 6230 flow [2022-12-13 01:57:51,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:51,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:51,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:51,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 01:57:51,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 01:57:51,439 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:51,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash 989679529, now seen corresponding path program 1 times [2022-12-13 01:57:51,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:51,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733935619] [2022-12-13 01:57:51,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:51,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:51,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733935619] [2022-12-13 01:57:51,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733935619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:51,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724550714] [2022-12-13 01:57:51,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:51,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:51,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:51,472 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-13 01:57:51,487 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-13 01:57:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:51,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:57:51,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:51,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:51,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724550714] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:51,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:51,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 01:57:51,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966604748] [2022-12-13 01:57:51,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:51,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:57:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:51,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:57:51,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:57:51,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:57:51,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 284 transitions, 6230 flow. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:51,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:51,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:57:51,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:51,970 INFO L130 PetriNetUnfolder]: 1016/2007 cut-off events. [2022-12-13 01:57:51,970 INFO L131 PetriNetUnfolder]: For 64879/64879 co-relation queries the response was YES. [2022-12-13 01:57:51,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18588 conditions, 2007 events. 1016/2007 cut-off events. For 64879/64879 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13301 event pairs, 355 based on Foata normal form. 4/2011 useless extension candidates. Maximal degree in co-relation 18008. Up to 1717 conditions per place. [2022-12-13 01:57:51,985 INFO L137 encePairwiseOnDemand]: 14/31 looper letters, 252 selfloop transitions, 69 changer transitions 1/322 dead transitions. [2022-12-13 01:57:51,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 322 transitions, 7308 flow [2022-12-13 01:57:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:57:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:57:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-12-13 01:57:51,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28110599078341014 [2022-12-13 01:57:51,986 INFO L175 Difference]: Start difference. First operand has 141 places, 284 transitions, 6230 flow. Second operand 7 states and 61 transitions. [2022-12-13 01:57:51,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 322 transitions, 7308 flow [2022-12-13 01:57:52,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 322 transitions, 7125 flow, removed 78 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:52,153 INFO L231 Difference]: Finished difference. Result has 146 places, 286 transitions, 6265 flow [2022-12-13 01:57:52,153 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=6047, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6265, PETRI_PLACES=146, PETRI_TRANSITIONS=286} [2022-12-13 01:57:52,153 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 126 predicate places. [2022-12-13 01:57:52,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:52,153 INFO L89 Accepts]: Start accepts. Operand has 146 places, 286 transitions, 6265 flow [2022-12-13 01:57:52,155 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:52,155 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:52,155 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 286 transitions, 6265 flow [2022-12-13 01:57:52,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 286 transitions, 6265 flow [2022-12-13 01:57:52,232 INFO L130 PetriNetUnfolder]: 219/791 cut-off events. [2022-12-13 01:57:52,232 INFO L131 PetriNetUnfolder]: For 19718/19760 co-relation queries the response was YES. [2022-12-13 01:57:52,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6245 conditions, 791 events. 219/791 cut-off events. For 19718/19760 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6607 event pairs, 13 based on Foata normal form. 3/790 useless extension candidates. Maximal degree in co-relation 6008. Up to 227 conditions per place. [2022-12-13 01:57:52,241 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 286 transitions, 6265 flow [2022-12-13 01:57:52,241 INFO L226 LiptonReduction]: Number of co-enabled transitions 990 [2022-12-13 01:57:52,243 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:52,244 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 01:57:52,244 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 286 transitions, 6265 flow [2022-12-13 01:57:52,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:52,244 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:52,249 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-13 01:57:52,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 01:57:52,449 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:52,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:52,449 INFO L85 PathProgramCache]: Analyzing trace with hash -396973318, now seen corresponding path program 1 times [2022-12-13 01:57:52,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:52,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064901800] [2022-12-13 01:57:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:52,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:52,495 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-13 01:57:52,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:52,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064901800] [2022-12-13 01:57:52,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064901800] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:52,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286466620] [2022-12-13 01:57:52,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:52,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:52,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:52,498 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-13 01:57:52,500 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-13 01:57:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:52,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:57:52,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:52,597 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-13 01:57:52,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:52,626 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-13 01:57:52,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286466620] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:52,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:52,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 01:57:52,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867367148] [2022-12-13 01:57:52,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:52,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:57:52,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:52,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:57:52,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:57:52,628 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:57:52,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 286 transitions, 6265 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-13 01:57:52,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:52,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:57:52,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:53,138 INFO L130 PetriNetUnfolder]: 1108/2175 cut-off events. [2022-12-13 01:57:53,139 INFO L131 PetriNetUnfolder]: For 71196/71196 co-relation queries the response was YES. [2022-12-13 01:57:53,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20367 conditions, 2175 events. 1108/2175 cut-off events. For 71196/71196 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 14537 event pairs, 297 based on Foata normal form. 4/2179 useless extension candidates. Maximal degree in co-relation 19780. Up to 1523 conditions per place. [2022-12-13 01:57:53,156 INFO L137 encePairwiseOnDemand]: 13/31 looper letters, 230 selfloop transitions, 141 changer transitions 1/372 dead transitions. [2022-12-13 01:57:53,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 372 transitions, 8362 flow [2022-12-13 01:57:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:57:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:57:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-12-13 01:57:53,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23460410557184752 [2022-12-13 01:57:53,157 INFO L175 Difference]: Start difference. First operand has 146 places, 286 transitions, 6265 flow. Second operand 11 states and 80 transitions. [2022-12-13 01:57:53,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 372 transitions, 8362 flow [2022-12-13 01:57:53,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 372 transitions, 8278 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 01:57:53,345 INFO L231 Difference]: Finished difference. Result has 156 places, 311 transitions, 7181 flow [2022-12-13 01:57:53,345 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=6189, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7181, PETRI_PLACES=156, PETRI_TRANSITIONS=311} [2022-12-13 01:57:53,346 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 136 predicate places. [2022-12-13 01:57:53,346 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:53,346 INFO L89 Accepts]: Start accepts. Operand has 156 places, 311 transitions, 7181 flow [2022-12-13 01:57:53,347 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:53,347 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:53,347 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 311 transitions, 7181 flow [2022-12-13 01:57:53,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 311 transitions, 7181 flow [2022-12-13 01:57:53,436 INFO L130 PetriNetUnfolder]: 239/847 cut-off events. [2022-12-13 01:57:53,436 INFO L131 PetriNetUnfolder]: For 23046/23084 co-relation queries the response was YES. [2022-12-13 01:57:53,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7003 conditions, 847 events. 239/847 cut-off events. For 23046/23084 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 7165 event pairs, 12 based on Foata normal form. 3/847 useless extension candidates. Maximal degree in co-relation 6761. Up to 263 conditions per place. [2022-12-13 01:57:53,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 311 transitions, 7181 flow [2022-12-13 01:57:53,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 1096 [2022-12-13 01:57:53,530 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [307] $Ultimate##0-->L41-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119| (ite (< 0 (+ v_~counter~0_312 1)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119| 0)) (= v_~counter~0_310 (+ v_~counter~0_312 5)) (= 6 v_thread1Thread1of1ForFork0_~i~0_149) (= |v_thread2Thread1of1ForFork1_~i~1#1_168| 1) (< 5 v_~N~0_115)) InVars {~counter~0=v_~counter~0_312, ~N~0=v_~N~0_115} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_119|, ~counter~0=v_~counter~0_310, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_119|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_116|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_110|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_149, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_119|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_123|, ~N~0=v_~N~0_115, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_168|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:53,530 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:53,530 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:53,683 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:57:53,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 338 [2022-12-13 01:57:53,684 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 310 transitions, 7219 flow [2022-12-13 01:57:53,684 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-13 01:57:53,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:53,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:53,703 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-13 01:57:53,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 01:57:53,889 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:53,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:53,890 INFO L85 PathProgramCache]: Analyzing trace with hash -399911017, now seen corresponding path program 1 times [2022-12-13 01:57:53,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:53,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396583624] [2022-12-13 01:57:53,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:53,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:53,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:53,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396583624] [2022-12-13 01:57:53,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396583624] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:53,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773575656] [2022-12-13 01:57:53,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:53,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:53,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:53,967 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-13 01:57:53,970 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-13 01:57:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:54,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 01:57:54,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:54,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:54,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773575656] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:54,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:54,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 4 [2022-12-13 01:57:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553151843] [2022-12-13 01:57:54,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:54,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:57:54,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:54,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:57:54,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:57:54,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 01:57:54,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 310 transitions, 7219 flow. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:54,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:54,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 01:57:54,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:54,509 INFO L130 PetriNetUnfolder]: 1112/2190 cut-off events. [2022-12-13 01:57:54,509 INFO L131 PetriNetUnfolder]: For 77048/77048 co-relation queries the response was YES. [2022-12-13 01:57:54,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21124 conditions, 2190 events. 1112/2190 cut-off events. For 77048/77048 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14726 event pairs, 163 based on Foata normal form. 5/2195 useless extension candidates. Maximal degree in co-relation 20530. Up to 2002 conditions per place. [2022-12-13 01:57:54,527 INFO L137 encePairwiseOnDemand]: 13/33 looper letters, 278 selfloop transitions, 40 changer transitions 19/337 dead transitions. [2022-12-13 01:57:54,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 337 transitions, 8195 flow [2022-12-13 01:57:54,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:54,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-13 01:57:54,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2022-12-13 01:57:54,528 INFO L175 Difference]: Start difference. First operand has 155 places, 310 transitions, 7219 flow. Second operand 5 states and 57 transitions. [2022-12-13 01:57:54,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 337 transitions, 8195 flow [2022-12-13 01:57:54,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 337 transitions, 8075 flow, removed 55 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:54,740 INFO L231 Difference]: Finished difference. Result has 158 places, 310 transitions, 7225 flow [2022-12-13 01:57:54,740 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=7099, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7225, PETRI_PLACES=158, PETRI_TRANSITIONS=310} [2022-12-13 01:57:54,741 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 138 predicate places. [2022-12-13 01:57:54,741 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:54,741 INFO L89 Accepts]: Start accepts. Operand has 158 places, 310 transitions, 7225 flow [2022-12-13 01:57:54,742 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:54,742 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:54,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 310 transitions, 7225 flow [2022-12-13 01:57:54,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 310 transitions, 7225 flow [2022-12-13 01:57:54,828 INFO L130 PetriNetUnfolder]: 238/845 cut-off events. [2022-12-13 01:57:54,828 INFO L131 PetriNetUnfolder]: For 23057/23103 co-relation queries the response was YES. [2022-12-13 01:57:54,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7060 conditions, 845 events. 238/845 cut-off events. For 23057/23103 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7143 event pairs, 12 based on Foata normal form. 3/844 useless extension candidates. Maximal degree in co-relation 6813. Up to 261 conditions per place. [2022-12-13 01:57:54,836 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 310 transitions, 7225 flow [2022-12-13 01:57:54,836 INFO L226 LiptonReduction]: Number of co-enabled transitions 1094 [2022-12-13 01:57:54,838 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:54,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 01:57:54,838 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 310 transitions, 7225 flow [2022-12-13 01:57:54,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:54,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:54,839 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:54,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 01:57:55,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 01:57:55,044 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:55,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1077767495, now seen corresponding path program 1 times [2022-12-13 01:57:55,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:55,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421487415] [2022-12-13 01:57:55,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:55,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:55,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421487415] [2022-12-13 01:57:55,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421487415] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:55,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80523718] [2022-12-13 01:57:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:55,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:55,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:55,081 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-13 01:57:55,128 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-13 01:57:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:55,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:57:55,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:55,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:55,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80523718] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:55,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:55,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 01:57:55,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043468257] [2022-12-13 01:57:55,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:55,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:57:55,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:55,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:57:55,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:57:55,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 01:57:55,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 310 transitions, 7225 flow. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-13 01:57:55,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:55,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 01:57:55,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:55,645 INFO L130 PetriNetUnfolder]: 1168/2289 cut-off events. [2022-12-13 01:57:55,645 INFO L131 PetriNetUnfolder]: For 90098/90098 co-relation queries the response was YES. [2022-12-13 01:57:55,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22209 conditions, 2289 events. 1168/2289 cut-off events. For 90098/90098 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 15481 event pairs, 282 based on Foata normal form. 40/2329 useless extension candidates. Maximal degree in co-relation 21608. Up to 1384 conditions per place. [2022-12-13 01:57:55,665 INFO L137 encePairwiseOnDemand]: 14/33 looper letters, 218 selfloop transitions, 167 changer transitions 2/387 dead transitions. [2022-12-13 01:57:55,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 387 transitions, 9202 flow [2022-12-13 01:57:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:57:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:57:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-12-13 01:57:55,666 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25252525252525254 [2022-12-13 01:57:55,666 INFO L175 Difference]: Start difference. First operand has 158 places, 310 transitions, 7225 flow. Second operand 9 states and 75 transitions. [2022-12-13 01:57:55,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 387 transitions, 9202 flow [2022-12-13 01:57:55,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 387 transitions, 9144 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:55,904 INFO L231 Difference]: Finished difference. Result has 166 places, 326 transitions, 8154 flow [2022-12-13 01:57:55,904 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=7169, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8154, PETRI_PLACES=166, PETRI_TRANSITIONS=326} [2022-12-13 01:57:55,904 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 146 predicate places. [2022-12-13 01:57:55,904 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:55,905 INFO L89 Accepts]: Start accepts. Operand has 166 places, 326 transitions, 8154 flow [2022-12-13 01:57:55,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:55,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:55,906 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 326 transitions, 8154 flow [2022-12-13 01:57:55,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 326 transitions, 8154 flow [2022-12-13 01:57:56,006 INFO L130 PetriNetUnfolder]: 250/888 cut-off events. [2022-12-13 01:57:56,006 INFO L131 PetriNetUnfolder]: For 27721/27767 co-relation queries the response was YES. [2022-12-13 01:57:56,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7781 conditions, 888 events. 250/888 cut-off events. For 27721/27767 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7622 event pairs, 12 based on Foata normal form. 3/887 useless extension candidates. Maximal degree in co-relation 7531. Up to 282 conditions per place. [2022-12-13 01:57:56,016 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 326 transitions, 8154 flow [2022-12-13 01:57:56,016 INFO L226 LiptonReduction]: Number of co-enabled transitions 1170 [2022-12-13 01:57:56,018 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:56,018 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 01:57:56,018 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 326 transitions, 8154 flow [2022-12-13 01:57:56,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-13 01:57:56,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:56,018 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:56,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 01:57:56,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:56,222 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash -841319884, now seen corresponding path program 1 times [2022-12-13 01:57:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:56,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642782628] [2022-12-13 01:57:56,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:56,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:56,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:56,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642782628] [2022-12-13 01:57:56,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642782628] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:56,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476852431] [2022-12-13 01:57:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:56,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:56,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:56,373 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-13 01:57:56,376 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-13 01:57:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:56,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 01:57:56,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:56,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:56,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476852431] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:56,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:56,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 5 [2022-12-13 01:57:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422452607] [2022-12-13 01:57:56,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:56,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:57:56,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:57:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:57:56,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 01:57:56,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 326 transitions, 8154 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-13 01:57:56,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:56,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 01:57:56,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:56,942 INFO L130 PetriNetUnfolder]: 1181/2321 cut-off events. [2022-12-13 01:57:56,943 INFO L131 PetriNetUnfolder]: For 93871/93871 co-relation queries the response was YES. [2022-12-13 01:57:56,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23632 conditions, 2321 events. 1181/2321 cut-off events. For 93871/93871 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 15800 event pairs, 145 based on Foata normal form. 5/2326 useless extension candidates. Maximal degree in co-relation 23022. Up to 1621 conditions per place. [2022-12-13 01:57:56,964 INFO L137 encePairwiseOnDemand]: 13/33 looper letters, 274 selfloop transitions, 89 changer transitions 23/386 dead transitions. [2022-12-13 01:57:56,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 386 transitions, 9835 flow [2022-12-13 01:57:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:57:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:57:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-12-13 01:57:56,964 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35858585858585856 [2022-12-13 01:57:56,965 INFO L175 Difference]: Start difference. First operand has 166 places, 326 transitions, 8154 flow. Second operand 6 states and 71 transitions. [2022-12-13 01:57:56,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 386 transitions, 9835 flow [2022-12-13 01:57:57,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 386 transitions, 9679 flow, removed 62 selfloop flow, removed 3 redundant places. [2022-12-13 01:57:57,231 INFO L231 Difference]: Finished difference. Result has 172 places, 328 transitions, 8418 flow [2022-12-13 01:57:57,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=7998, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8418, PETRI_PLACES=172, PETRI_TRANSITIONS=328} [2022-12-13 01:57:57,231 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 152 predicate places. [2022-12-13 01:57:57,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:57,232 INFO L89 Accepts]: Start accepts. Operand has 172 places, 328 transitions, 8418 flow [2022-12-13 01:57:57,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:57,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:57,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 328 transitions, 8418 flow [2022-12-13 01:57:57,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 328 transitions, 8418 flow [2022-12-13 01:57:57,329 INFO L130 PetriNetUnfolder]: 251/890 cut-off events. [2022-12-13 01:57:57,329 INFO L131 PetriNetUnfolder]: For 28611/28663 co-relation queries the response was YES. [2022-12-13 01:57:57,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8035 conditions, 890 events. 251/890 cut-off events. For 28611/28663 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7636 event pairs, 12 based on Foata normal form. 3/889 useless extension candidates. Maximal degree in co-relation 7774. Up to 284 conditions per place. [2022-12-13 01:57:57,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 328 transitions, 8418 flow [2022-12-13 01:57:57,339 INFO L226 LiptonReduction]: Number of co-enabled transitions 1174 [2022-12-13 01:57:57,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [315] $Ultimate##0-->L41-4: Formula: (and (= (ite (< 0 (+ v_~counter~0_357 4)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_147|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_147| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_201|) (= 7 v_thread1Thread1of1ForFork0_~i~0_173) (< v_thread1Thread1of1ForFork0_~i~0_173 (+ v_~N~0_125 1)) (= v_~counter~0_355 (+ v_~counter~0_357 5)) (not (= (ite (< 0 (+ v_~counter~0_357 1)) 1 0) 0))) InVars {~counter~0=v_~counter~0_357, ~N~0=v_~N~0_125} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_147|, ~counter~0=v_~counter~0_355, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_147|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_140|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_134|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_173, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_147|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_151|, ~N~0=v_~N~0_125, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_201|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:57,340 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:57,340 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:57,470 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:57,471 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-13 01:57:57,471 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 328 transitions, 8436 flow [2022-12-13 01:57:57,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-13 01:57:57,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:57,471 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:57,481 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-13 01:57:57,675 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,SelfDestructingSolverStorable30 [2022-12-13 01:57:57,676 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:57,676 INFO L85 PathProgramCache]: Analyzing trace with hash 266811810, now seen corresponding path program 1 times [2022-12-13 01:57:57,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:57,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6647846] [2022-12-13 01:57:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:57,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:57,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:57,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6647846] [2022-12-13 01:57:57,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6647846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:57,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994896127] [2022-12-13 01:57:57,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:57,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:57,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:57,721 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-13 01:57:57,723 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-13 01:57:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:57,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:57:57,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:57,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:57,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994896127] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:57,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:57,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 01:57:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374521418] [2022-12-13 01:57:57,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:57,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 01:57:57,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:57,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 01:57:57,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-12-13 01:57:57,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 01:57:57,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 328 transitions, 8436 flow. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:57,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:57,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 01:57:57,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:58,767 INFO L130 PetriNetUnfolder]: 1676/3237 cut-off events. [2022-12-13 01:57:58,767 INFO L131 PetriNetUnfolder]: For 140524/140524 co-relation queries the response was YES. [2022-12-13 01:57:58,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34005 conditions, 3237 events. 1676/3237 cut-off events. For 140524/140524 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 22898 event pairs, 306 based on Foata normal form. 54/3291 useless extension candidates. Maximal degree in co-relation 33378. Up to 1682 conditions per place. [2022-12-13 01:57:58,793 INFO L137 encePairwiseOnDemand]: 13/34 looper letters, 259 selfloop transitions, 291 changer transitions 5/555 dead transitions. [2022-12-13 01:57:58,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 555 transitions, 14113 flow [2022-12-13 01:57:58,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 01:57:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 01:57:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2022-12-13 01:57:58,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23183391003460208 [2022-12-13 01:57:58,796 INFO L175 Difference]: Start difference. First operand has 172 places, 328 transitions, 8436 flow. Second operand 17 states and 134 transitions. [2022-12-13 01:57:58,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 555 transitions, 14113 flow [2022-12-13 01:57:59,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 555 transitions, 13703 flow, removed 42 selfloop flow, removed 7 redundant places. [2022-12-13 01:57:59,125 INFO L231 Difference]: Finished difference. Result has 189 places, 460 transitions, 12675 flow [2022-12-13 01:57:59,125 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=8063, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=12675, PETRI_PLACES=189, PETRI_TRANSITIONS=460} [2022-12-13 01:57:59,125 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 169 predicate places. [2022-12-13 01:57:59,126 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:59,126 INFO L89 Accepts]: Start accepts. Operand has 189 places, 460 transitions, 12675 flow [2022-12-13 01:57:59,128 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:59,128 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:59,128 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 460 transitions, 12675 flow [2022-12-13 01:57:59,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 460 transitions, 12675 flow [2022-12-13 01:57:59,294 INFO L130 PetriNetUnfolder]: 361/1263 cut-off events. [2022-12-13 01:57:59,295 INFO L131 PetriNetUnfolder]: For 45874/45916 co-relation queries the response was YES. [2022-12-13 01:57:59,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12249 conditions, 1263 events. 361/1263 cut-off events. For 45874/45916 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 11611 event pairs, 14 based on Foata normal form. 3/1263 useless extension candidates. Maximal degree in co-relation 11974. Up to 463 conditions per place. [2022-12-13 01:57:59,312 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 460 transitions, 12675 flow [2022-12-13 01:57:59,312 INFO L226 LiptonReduction]: Number of co-enabled transitions 1718 [2022-12-13 01:57:59,315 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:59,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-13 01:57:59,315 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 460 transitions, 12675 flow [2022-12-13 01:57:59,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:59,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:59,315 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:59,321 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-13 01:57:59,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:59,520 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:59,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:59,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1379540843, now seen corresponding path program 1 times [2022-12-13 01:57:59,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:59,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330465562] [2022-12-13 01:57:59,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:59,572 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-13 01:57:59,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:59,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330465562] [2022-12-13 01:57:59,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330465562] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:59,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981302021] [2022-12-13 01:57:59,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:59,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:59,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:59,588 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-13 01:57:59,589 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-13 01:57:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:59,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:57:59,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:59,703 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-13 01:57:59,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:59,732 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-13 01:57:59,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981302021] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:59,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:59,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 01:57:59,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200384556] [2022-12-13 01:57:59,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:59,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:57:59,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:59,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:57:59,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:57:59,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 01:57:59,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 460 transitions, 12675 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-13 01:57:59,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:59,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 01:57:59,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:00,592 INFO L130 PetriNetUnfolder]: 1774/3419 cut-off events. [2022-12-13 01:58:00,593 INFO L131 PetriNetUnfolder]: For 169344/169344 co-relation queries the response was YES. [2022-12-13 01:58:00,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38491 conditions, 3419 events. 1774/3419 cut-off events. For 169344/169344 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 24573 event pairs, 384 based on Foata normal form. 4/3423 useless extension candidates. Maximal degree in co-relation 37837. Up to 2366 conditions per place. [2022-12-13 01:58:00,626 INFO L137 encePairwiseOnDemand]: 13/34 looper letters, 340 selfloop transitions, 227 changer transitions 1/568 dead transitions. [2022-12-13 01:58:00,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 568 transitions, 15804 flow [2022-12-13 01:58:00,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:58:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:58:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 101 transitions. [2022-12-13 01:58:00,627 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21218487394957983 [2022-12-13 01:58:00,627 INFO L175 Difference]: Start difference. First operand has 189 places, 460 transitions, 12675 flow. Second operand 14 states and 101 transitions. [2022-12-13 01:58:00,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 568 transitions, 15804 flow [2022-12-13 01:58:01,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 568 transitions, 14520 flow, removed 634 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:01,158 INFO L231 Difference]: Finished difference. Result has 200 places, 484 transitions, 13006 flow [2022-12-13 01:58:01,158 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=11633, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13006, PETRI_PLACES=200, PETRI_TRANSITIONS=484} [2022-12-13 01:58:01,158 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 180 predicate places. [2022-12-13 01:58:01,158 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:01,159 INFO L89 Accepts]: Start accepts. Operand has 200 places, 484 transitions, 13006 flow [2022-12-13 01:58:01,161 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:01,161 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:01,161 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 484 transitions, 13006 flow [2022-12-13 01:58:01,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 484 transitions, 13006 flow [2022-12-13 01:58:01,379 INFO L130 PetriNetUnfolder]: 381/1345 cut-off events. [2022-12-13 01:58:01,379 INFO L131 PetriNetUnfolder]: For 50695/50705 co-relation queries the response was YES. [2022-12-13 01:58:01,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12463 conditions, 1345 events. 381/1345 cut-off events. For 50695/50705 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 12553 event pairs, 14 based on Foata normal form. 1/1343 useless extension candidates. Maximal degree in co-relation 12181. Up to 353 conditions per place. [2022-12-13 01:58:01,398 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 484 transitions, 13006 flow [2022-12-13 01:58:01,399 INFO L226 LiptonReduction]: Number of co-enabled transitions 1830 [2022-12-13 01:58:01,399 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [320] $Ultimate##0-->L51-4: Formula: (and (= (+ v_~counter~0_392 4) v_~counter~0_390) (< v_thread1Thread1of1ForFork0_~i~0_188 (+ v_~N~0_131 1)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_223|) (= 7 v_thread1Thread1of1ForFork0_~i~0_188) (not (= (ite (< 0 (+ v_~counter~0_392 1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_167| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_167|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_167| (ite (< 0 (+ v_~counter~0_390 1)) 1 0))) InVars {~counter~0=v_~counter~0_392, ~N~0=v_~N~0_131} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_167|, ~counter~0=v_~counter~0_390, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_167|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_155|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_149|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_188, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_167|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_171|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_223|, ~N~0=v_~N~0_131} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:01,483 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:01,484 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:01,609 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [317] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_149| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149|) (= v_~counter~0_361 (+ v_~counter~0_363 4)) (= 6 v_thread1Thread1of1ForFork0_~i~0_177) (not (= (ite (< 0 (+ v_~counter~0_363 1)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_203|) (< 5 v_~N~0_127) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_149| (ite (< 0 (+ v_~counter~0_363 5)) 1 0))) InVars {~counter~0=v_~counter~0_363, ~N~0=v_~N~0_127} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_149|, ~counter~0=v_~counter~0_361, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_149|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_144|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_138|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_177, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_149|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_153|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_203|, ~N~0=v_~N~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:01,683 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:01,683 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:01,817 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:58:01,818 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 660 [2022-12-13 01:58:01,818 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 484 transitions, 13126 flow [2022-12-13 01:58:01,818 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-13 01:58:01,818 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:01,818 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:01,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:02,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:02,023 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:02,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:02,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1552396361, now seen corresponding path program 1 times [2022-12-13 01:58:02,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:02,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253840163] [2022-12-13 01:58:02,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:02,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:02,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:02,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253840163] [2022-12-13 01:58:02,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253840163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:02,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235251023] [2022-12-13 01:58:02,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:02,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:02,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:02,085 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-13 01:58:02,086 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-13 01:58:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:02,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:58:02,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:02,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:02,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235251023] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:02,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:02,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-13 01:58:02,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740909292] [2022-12-13 01:58:02,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:02,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:58:02,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:02,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:58:02,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:58:02,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 01:58:02,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 484 transitions, 13126 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-13 01:58:02,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:02,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 01:58:02,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:03,157 INFO L130 PetriNetUnfolder]: 1864/3587 cut-off events. [2022-12-13 01:58:03,157 INFO L131 PetriNetUnfolder]: For 178833/178833 co-relation queries the response was YES. [2022-12-13 01:58:03,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39266 conditions, 3587 events. 1864/3587 cut-off events. For 178833/178833 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 25968 event pairs, 365 based on Foata normal form. 4/3591 useless extension candidates. Maximal degree in co-relation 38597. Up to 2305 conditions per place. [2022-12-13 01:58:03,193 INFO L137 encePairwiseOnDemand]: 14/38 looper letters, 331 selfloop transitions, 260 changer transitions 2/593 dead transitions. [2022-12-13 01:58:03,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 593 transitions, 16106 flow [2022-12-13 01:58:03,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:58:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:58:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-12-13 01:58:03,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22009569377990432 [2022-12-13 01:58:03,194 INFO L175 Difference]: Start difference. First operand has 201 places, 484 transitions, 13126 flow. Second operand 11 states and 92 transitions. [2022-12-13 01:58:03,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 593 transitions, 16106 flow [2022-12-13 01:58:03,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 593 transitions, 15831 flow, removed 45 selfloop flow, removed 6 redundant places. [2022-12-13 01:58:03,709 INFO L231 Difference]: Finished difference. Result has 206 places, 505 transitions, 14057 flow [2022-12-13 01:58:03,710 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=12852, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14057, PETRI_PLACES=206, PETRI_TRANSITIONS=505} [2022-12-13 01:58:03,710 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 186 predicate places. [2022-12-13 01:58:03,710 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:03,710 INFO L89 Accepts]: Start accepts. Operand has 206 places, 505 transitions, 14057 flow [2022-12-13 01:58:03,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:03,713 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:03,713 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 505 transitions, 14057 flow [2022-12-13 01:58:03,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 505 transitions, 14057 flow [2022-12-13 01:58:03,915 INFO L130 PetriNetUnfolder]: 399/1384 cut-off events. [2022-12-13 01:58:03,915 INFO L131 PetriNetUnfolder]: For 54897/54907 co-relation queries the response was YES. [2022-12-13 01:58:03,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13218 conditions, 1384 events. 399/1384 cut-off events. For 54897/54907 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 12924 event pairs, 13 based on Foata normal form. 1/1382 useless extension candidates. Maximal degree in co-relation 12992. Up to 365 conditions per place. [2022-12-13 01:58:03,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 505 transitions, 14057 flow [2022-12-13 01:58:03,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 1932 [2022-12-13 01:58:03,935 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:58:03,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-13 01:58:03,935 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 505 transitions, 14057 flow [2022-12-13 01:58:03,935 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-13 01:58:03,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:03,936 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:03,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:04,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:04,140 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:04,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:04,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1177024691, now seen corresponding path program 1 times [2022-12-13 01:58:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:04,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530323225] [2022-12-13 01:58:04,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:04,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:04,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:04,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530323225] [2022-12-13 01:58:04,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530323225] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:04,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621572] [2022-12-13 01:58:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:04,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:04,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:04,172 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-13 01:58:04,174 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-13 01:58:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:04,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:58:04,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:04,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:04,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621572] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:04,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:04,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 01:58:04,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542137458] [2022-12-13 01:58:04,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:04,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:58:04,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:58:04,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:58:04,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 01:58:04,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 505 transitions, 14057 flow. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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-13 01:58:04,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:04,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 01:58:04,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:05,184 INFO L130 PetriNetUnfolder]: 1937/3724 cut-off events. [2022-12-13 01:58:05,185 INFO L131 PetriNetUnfolder]: For 202042/202042 co-relation queries the response was YES. [2022-12-13 01:58:05,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41407 conditions, 3724 events. 1937/3724 cut-off events. For 202042/202042 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 27033 event pairs, 352 based on Foata normal form. 20/3744 useless extension candidates. Maximal degree in co-relation 40859. Up to 2198 conditions per place. [2022-12-13 01:58:05,217 INFO L137 encePairwiseOnDemand]: 14/37 looper letters, 317 selfloop transitions, 290 changer transitions 2/609 dead transitions. [2022-12-13 01:58:05,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 609 transitions, 17042 flow [2022-12-13 01:58:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:58:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:58:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-12-13 01:58:05,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24624624624624625 [2022-12-13 01:58:05,219 INFO L175 Difference]: Start difference. First operand has 204 places, 505 transitions, 14057 flow. Second operand 9 states and 82 transitions. [2022-12-13 01:58:05,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 609 transitions, 17042 flow [2022-12-13 01:58:05,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 609 transitions, 16601 flow, removed 123 selfloop flow, removed 6 redundant places. [2022-12-13 01:58:05,739 INFO L231 Difference]: Finished difference. Result has 209 places, 520 transitions, 14984 flow [2022-12-13 01:58:05,740 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13638, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14984, PETRI_PLACES=209, PETRI_TRANSITIONS=520} [2022-12-13 01:58:05,740 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 189 predicate places. [2022-12-13 01:58:05,740 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:05,740 INFO L89 Accepts]: Start accepts. Operand has 209 places, 520 transitions, 14984 flow [2022-12-13 01:58:05,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:05,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:05,743 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 520 transitions, 14984 flow [2022-12-13 01:58:05,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 520 transitions, 14984 flow [2022-12-13 01:58:05,934 INFO L130 PetriNetUnfolder]: 413/1432 cut-off events. [2022-12-13 01:58:05,935 INFO L131 PetriNetUnfolder]: For 60791/60801 co-relation queries the response was YES. [2022-12-13 01:58:05,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13985 conditions, 1432 events. 413/1432 cut-off events. For 60791/60801 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 13453 event pairs, 13 based on Foata normal form. 1/1430 useless extension candidates. Maximal degree in co-relation 13698. Up to 379 conditions per place. [2022-12-13 01:58:05,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 520 transitions, 14984 flow [2022-12-13 01:58:05,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 2014 [2022-12-13 01:58:05,956 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:05,956 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:06,079 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:06,079 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 339 [2022-12-13 01:58:06,079 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 520 transitions, 15005 flow [2022-12-13 01:58:06,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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-13 01:58:06,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:06,080 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:06,086 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-13 01:58:06,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:06,286 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:06,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:06,286 INFO L85 PathProgramCache]: Analyzing trace with hash -899328121, now seen corresponding path program 1 times [2022-12-13 01:58:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:06,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839518483] [2022-12-13 01:58:06,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:06,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:06,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:06,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839518483] [2022-12-13 01:58:06,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839518483] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:06,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644376535] [2022-12-13 01:58:06,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:06,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:06,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:06,355 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-13 01:58:06,377 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-13 01:58:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:06,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 01:58:06,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:06,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:06,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644376535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:06,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:06,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 5 [2022-12-13 01:58:06,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829123876] [2022-12-13 01:58:06,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:06,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:58:06,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:06,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:58:06,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:58:06,474 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 01:58:06,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 520 transitions, 15005 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-13 01:58:06,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:06,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 01:58:06,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:07,518 INFO L130 PetriNetUnfolder]: 2033/3918 cut-off events. [2022-12-13 01:58:07,518 INFO L131 PetriNetUnfolder]: For 217983/217983 co-relation queries the response was YES. [2022-12-13 01:58:07,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44992 conditions, 3918 events. 2033/3918 cut-off events. For 217983/217983 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 28688 event pairs, 225 based on Foata normal form. 12/3930 useless extension candidates. Maximal degree in co-relation 44314. Up to 3065 conditions per place. [2022-12-13 01:58:07,559 INFO L137 encePairwiseOnDemand]: 13/38 looper letters, 463 selfloop transitions, 107 changer transitions 26/596 dead transitions. [2022-12-13 01:58:07,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 596 transitions, 17779 flow [2022-12-13 01:58:07,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:58:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:58:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-13 01:58:07,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 01:58:07,560 INFO L175 Difference]: Start difference. First operand has 209 places, 520 transitions, 15005 flow. Second operand 6 states and 76 transitions. [2022-12-13 01:58:07,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 596 transitions, 17779 flow [2022-12-13 01:58:08,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 596 transitions, 17517 flow, removed 122 selfloop flow, removed 1 redundant places. [2022-12-13 01:58:08,302 INFO L231 Difference]: Finished difference. Result has 217 places, 534 transitions, 15758 flow [2022-12-13 01:58:08,302 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=14795, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=15758, PETRI_PLACES=217, PETRI_TRANSITIONS=534} [2022-12-13 01:58:08,303 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 197 predicate places. [2022-12-13 01:58:08,303 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:08,303 INFO L89 Accepts]: Start accepts. Operand has 217 places, 534 transitions, 15758 flow [2022-12-13 01:58:08,305 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:08,305 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:08,305 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 534 transitions, 15758 flow [2022-12-13 01:58:08,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 534 transitions, 15758 flow [2022-12-13 01:58:08,558 INFO L130 PetriNetUnfolder]: 428/1498 cut-off events. [2022-12-13 01:58:08,558 INFO L131 PetriNetUnfolder]: For 67297/67307 co-relation queries the response was YES. [2022-12-13 01:58:08,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15081 conditions, 1498 events. 428/1498 cut-off events. For 67297/67307 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 14311 event pairs, 19 based on Foata normal form. 1/1496 useless extension candidates. Maximal degree in co-relation 14783. Up to 408 conditions per place. [2022-12-13 01:58:08,579 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 534 transitions, 15758 flow [2022-12-13 01:58:08,579 INFO L226 LiptonReduction]: Number of co-enabled transitions 2058 [2022-12-13 01:58:08,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~counter~0_406 5))) (and (= v_~counter~0_404 .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|) (not (= (ite (< 0 (+ v_~counter~0_406 1)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_196 8) (< 7 v_~N~0_133) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176| (ite (< 0 .cse0) 1 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_235|))) InVars {~counter~0=v_~counter~0_406, ~N~0=v_~N~0_133} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_176|, ~counter~0=v_~counter~0_404, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_176|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_162|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_156|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_196, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_176|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_180|, ~N~0=v_~N~0_133, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_235|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:08,580 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:08,580 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:08,693 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:08,694 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 391 [2022-12-13 01:58:08,694 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 534 transitions, 15779 flow [2022-12-13 01:58:08,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-13 01:58:08,694 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:08,694 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:08,698 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-13 01:58:08,899 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,SelfDestructingSolverStorable35 [2022-12-13 01:58:08,899 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:08,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:08,899 INFO L85 PathProgramCache]: Analyzing trace with hash -745978213, now seen corresponding path program 1 times [2022-12-13 01:58:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:08,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315941032] [2022-12-13 01:58:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:08,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:08,934 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-13 01:58:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315941032] [2022-12-13 01:58:08,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315941032] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563715303] [2022-12-13 01:58:08,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:08,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:08,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:08,942 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-13 01:58:08,944 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-13 01:58:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:09,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:58:09,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:09,019 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-13 01:58:09,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:09,034 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-13 01:58:09,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563715303] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:09,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:09,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-12-13 01:58:09,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682356484] [2022-12-13 01:58:09,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:09,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:58:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:09,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:58:09,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:58:09,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 01:58:09,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 534 transitions, 15779 flow. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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-13 01:58:09,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:09,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 01:58:09,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:10,090 INFO L130 PetriNetUnfolder]: 2132/4114 cut-off events. [2022-12-13 01:58:10,090 INFO L131 PetriNetUnfolder]: For 238616/238616 co-relation queries the response was YES. [2022-12-13 01:58:10,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47579 conditions, 4114 events. 2132/4114 cut-off events. For 238616/238616 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 30371 event pairs, 104 based on Foata normal form. 26/4140 useless extension candidates. Maximal degree in co-relation 46884. Up to 2925 conditions per place. [2022-12-13 01:58:10,137 INFO L137 encePairwiseOnDemand]: 10/39 looper letters, 384 selfloop transitions, 245 changer transitions 12/641 dead transitions. [2022-12-13 01:58:10,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 641 transitions, 19080 flow [2022-12-13 01:58:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:58:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:58:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2022-12-13 01:58:10,138 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2282051282051282 [2022-12-13 01:58:10,138 INFO L175 Difference]: Start difference. First operand has 217 places, 534 transitions, 15779 flow. Second operand 10 states and 89 transitions. [2022-12-13 01:58:10,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 641 transitions, 19080 flow [2022-12-13 01:58:10,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 641 transitions, 18876 flow, removed 102 selfloop flow, removed 0 redundant places. [2022-12-13 01:58:10,912 INFO L231 Difference]: Finished difference. Result has 229 places, 562 transitions, 17250 flow [2022-12-13 01:58:10,913 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=15655, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17250, PETRI_PLACES=229, PETRI_TRANSITIONS=562} [2022-12-13 01:58:10,913 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 209 predicate places. [2022-12-13 01:58:10,913 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:10,913 INFO L89 Accepts]: Start accepts. Operand has 229 places, 562 transitions, 17250 flow [2022-12-13 01:58:10,916 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:10,916 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:10,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 229 places, 562 transitions, 17250 flow [2022-12-13 01:58:10,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 562 transitions, 17250 flow [2022-12-13 01:58:11,149 INFO L130 PetriNetUnfolder]: 453/1588 cut-off events. [2022-12-13 01:58:11,149 INFO L131 PetriNetUnfolder]: For 75201/75209 co-relation queries the response was YES. [2022-12-13 01:58:11,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16303 conditions, 1588 events. 453/1588 cut-off events. For 75201/75209 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 15353 event pairs, 19 based on Foata normal form. 0/1585 useless extension candidates. Maximal degree in co-relation 15994. Up to 428 conditions per place. [2022-12-13 01:58:11,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 229 places, 562 transitions, 17250 flow [2022-12-13 01:58:11,172 INFO L226 LiptonReduction]: Number of co-enabled transitions 2186 [2022-12-13 01:58:11,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [290] $Ultimate##0-->L51-4: Formula: (and (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (= (ite (< 0 (+ v_~counter~0_202 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| 0)) (= v_~counter~0_202 (+ v_~counter~0_204 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|) (< v_thread1Thread1of1ForFork0_~i~0_91 (+ 1 v_~N~0_89)) (= 2 v_thread1Thread1of1ForFork0_~i~0_91)) InVars {~counter~0=v_~counter~0_204, ~N~0=v_~N~0_89} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65|, ~counter~0=v_~counter~0_202, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_66|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_60|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_91, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~N~0=v_~N~0_89} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [292] L41-4-->L51-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_100 v_~N~0_93) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_106| (+ |v_thread2Thread1of1ForFork1_~i~1#1_107| 1)) (< |v_thread2Thread1of1ForFork1_~i~1#1_107| v_~N~0_93) (= v_~counter~0_219 v_~counter~0_217) (= (+ v_thread1Thread1of1ForFork0_~i~0_100 1) v_thread1Thread1of1ForFork0_~i~0_99) (= (ite (< 0 (+ v_~counter~0_217 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|)) InVars {~counter~0=v_~counter~0_219, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_100, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_107|, ~N~0=v_~N~0_93} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71|, ~counter~0=v_~counter~0_217, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_71|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_74|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_68|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_99, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_75|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_106|, ~N~0=v_~N~0_93} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:11,182 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:11,182 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:11,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [290] $Ultimate##0-->L51-4: Formula: (and (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_99|) (= (ite (< 0 (+ v_~counter~0_202 1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| 0)) (= v_~counter~0_202 (+ v_~counter~0_204 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|) (< v_thread1Thread1of1ForFork0_~i~0_91 (+ 1 v_~N~0_89)) (= 2 v_thread1Thread1of1ForFork0_~i~0_91)) InVars {~counter~0=v_~counter~0_204, ~N~0=v_~N~0_89} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_65|, ~counter~0=v_~counter~0_202, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_65|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_66|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_60|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_91, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_65|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_69|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_99|, ~N~0=v_~N~0_89} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:11,340 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:11,340 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:11,430 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:11,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 518 [2022-12-13 01:58:11,431 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 562 transitions, 17345 flow [2022-12-13 01:58:11,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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-13 01:58:11,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:11,431 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:11,436 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-13 01:58:11,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 01:58:11,636 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:11,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash -897830084, now seen corresponding path program 1 times [2022-12-13 01:58:11,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:11,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841168578] [2022-12-13 01:58:11,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:11,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:11,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841168578] [2022-12-13 01:58:11,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841168578] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:11,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181533146] [2022-12-13 01:58:11,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:11,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:11,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:11,663 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-13 01:58:11,680 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-13 01:58:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:11,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:58:11,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:11,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:11,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181533146] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:11,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:11,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 01:58:11,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274708744] [2022-12-13 01:58:11,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:11,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:58:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:11,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:58:11,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:58:11,768 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 01:58:11,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 562 transitions, 17345 flow. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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-13 01:58:11,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:11,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 01:58:11,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:12,905 INFO L130 PetriNetUnfolder]: 2230/4296 cut-off events. [2022-12-13 01:58:12,906 INFO L131 PetriNetUnfolder]: For 280874/280874 co-relation queries the response was YES. [2022-12-13 01:58:12,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50997 conditions, 4296 events. 2230/4296 cut-off events. For 280874/280874 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 32069 event pairs, 361 based on Foata normal form. 40/4336 useless extension candidates. Maximal degree in co-relation 50228. Up to 2110 conditions per place. [2022-12-13 01:58:12,951 INFO L137 encePairwiseOnDemand]: 15/41 looper letters, 302 selfloop transitions, 377 changer transitions 4/683 dead transitions. [2022-12-13 01:58:12,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 683 transitions, 20898 flow [2022-12-13 01:58:12,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:58:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:58:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2022-12-13 01:58:12,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23577235772357724 [2022-12-13 01:58:12,953 INFO L175 Difference]: Start difference. First operand has 229 places, 562 transitions, 17345 flow. Second operand 9 states and 87 transitions. [2022-12-13 01:58:12,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 683 transitions, 20898 flow [2022-12-13 01:58:13,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 683 transitions, 20559 flow, removed 133 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:13,773 INFO L231 Difference]: Finished difference. Result has 235 places, 585 transitions, 18785 flow [2022-12-13 01:58:13,774 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=17014, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=365, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18785, PETRI_PLACES=235, PETRI_TRANSITIONS=585} [2022-12-13 01:58:13,774 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 215 predicate places. [2022-12-13 01:58:13,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:13,774 INFO L89 Accepts]: Start accepts. Operand has 235 places, 585 transitions, 18785 flow [2022-12-13 01:58:13,777 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:13,777 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:13,777 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 585 transitions, 18785 flow [2022-12-13 01:58:13,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 585 transitions, 18785 flow [2022-12-13 01:58:14,029 INFO L130 PetriNetUnfolder]: 473/1674 cut-off events. [2022-12-13 01:58:14,030 INFO L131 PetriNetUnfolder]: For 84183/84191 co-relation queries the response was YES. [2022-12-13 01:58:14,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17557 conditions, 1674 events. 473/1674 cut-off events. For 84183/84191 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 16381 event pairs, 19 based on Foata normal form. 0/1671 useless extension candidates. Maximal degree in co-relation 17036. Up to 439 conditions per place. [2022-12-13 01:58:14,173 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 234 places, 585 transitions, 18785 flow [2022-12-13 01:58:14,173 INFO L226 LiptonReduction]: Number of co-enabled transitions 2296 [2022-12-13 01:58:14,178 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:58:14,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 405 [2022-12-13 01:58:14,179 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 585 transitions, 18785 flow [2022-12-13 01:58:14,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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-13 01:58:14,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:14,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:14,184 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-13 01:58:14,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 01:58:14,384 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:14,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:14,384 INFO L85 PathProgramCache]: Analyzing trace with hash -369594427, now seen corresponding path program 1 times [2022-12-13 01:58:14,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:14,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055153686] [2022-12-13 01:58:14,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:14,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:14,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055153686] [2022-12-13 01:58:14,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055153686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:14,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498115731] [2022-12-13 01:58:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:14,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:14,416 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-13 01:58:14,418 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-13 01:58:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:14,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 01:58:14,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:14,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:14,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498115731] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:14,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:14,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:58:14,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812326680] [2022-12-13 01:58:14,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:14,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:58:14,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:14,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:58:14,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:58:14,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 01:58:14,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 585 transitions, 18785 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:14,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:14,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 01:58:14,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:15,734 INFO L130 PetriNetUnfolder]: 2304/4440 cut-off events. [2022-12-13 01:58:15,734 INFO L131 PetriNetUnfolder]: For 314554/314554 co-relation queries the response was YES. [2022-12-13 01:58:15,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54288 conditions, 4440 events. 2304/4440 cut-off events. For 314554/314554 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 33536 event pairs, 534 based on Foata normal form. 40/4480 useless extension candidates. Maximal degree in co-relation 52800. Up to 3155 conditions per place. [2022-12-13 01:58:15,785 INFO L137 encePairwiseOnDemand]: 13/40 looper letters, 399 selfloop transitions, 285 changer transitions 12/696 dead transitions. [2022-12-13 01:58:15,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 696 transitions, 21967 flow [2022-12-13 01:58:15,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 01:58:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 01:58:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2022-12-13 01:58:15,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21666666666666667 [2022-12-13 01:58:15,786 INFO L175 Difference]: Start difference. First operand has 234 places, 585 transitions, 18785 flow. Second operand 12 states and 104 transitions. [2022-12-13 01:58:15,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 696 transitions, 21967 flow [2022-12-13 01:58:16,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 696 transitions, 21338 flow, removed 276 selfloop flow, removed 2 redundant places. [2022-12-13 01:58:16,821 INFO L231 Difference]: Finished difference. Result has 249 places, 614 transitions, 19747 flow [2022-12-13 01:58:16,821 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=18156, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=262, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=19747, PETRI_PLACES=249, PETRI_TRANSITIONS=614} [2022-12-13 01:58:16,822 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 229 predicate places. [2022-12-13 01:58:16,822 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:16,822 INFO L89 Accepts]: Start accepts. Operand has 249 places, 614 transitions, 19747 flow [2022-12-13 01:58:16,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:16,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:16,826 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 249 places, 614 transitions, 19747 flow [2022-12-13 01:58:16,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 614 transitions, 19747 flow [2022-12-13 01:58:17,153 INFO L130 PetriNetUnfolder]: 489/1710 cut-off events. [2022-12-13 01:58:17,153 INFO L131 PetriNetUnfolder]: For 94844/94890 co-relation queries the response was YES. [2022-12-13 01:58:17,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18738 conditions, 1710 events. 489/1710 cut-off events. For 94844/94890 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 16698 event pairs, 19 based on Foata normal form. 3/1709 useless extension candidates. Maximal degree in co-relation 18193. Up to 448 conditions per place. [2022-12-13 01:58:17,180 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 249 places, 614 transitions, 19747 flow [2022-12-13 01:58:17,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 2386 [2022-12-13 01:58:17,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (+ v_~counter~0_459 1)) 1 0))) (and (not (= .cse0 0)) (= v_~counter~0_459 (+ v_~counter~0_461 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_275|) (< v_thread1Thread1of1ForFork0_~i~0_218 (+ v_~N~0_145 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_210|) (= 3 v_thread1Thread1of1ForFork0_~i~0_218) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210| .cse0))) InVars {~counter~0=v_~counter~0_461, ~N~0=v_~N~0_145} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_210|, ~counter~0=v_~counter~0_459, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_210|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_184|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_178|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_218, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_214|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_275|, ~N~0=v_~N~0_145} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:17,338 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:17,339 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:17,433 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:58:17,434 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 612 [2022-12-13 01:58:17,434 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 613 transitions, 19785 flow [2022-12-13 01:58:17,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:17,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:17,434 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:17,440 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-13 01:58:17,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 01:58:17,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-13 01:58:17,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:17,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1815185268, now seen corresponding path program 1 times [2022-12-13 01:58:17,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:17,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210869946] [2022-12-13 01:58:17,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:17,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:17,675 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-13 01:58:17,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:17,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210869946] [2022-12-13 01:58:17,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210869946] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:17,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702255918] [2022-12-13 01:58:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:17,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:17,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:17,677 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-13 01:58:17,695 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-13 01:58:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:17,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:58:17,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:17,826 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-13 01:58:17,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:17,847 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-13 01:58:17,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702255918] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:17,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:17,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 01:58:17,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518235305] [2022-12-13 01:58:17,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:17,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 01:58:17,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:17,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 01:58:17,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:58:17,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:58:17,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 613 transitions, 19785 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-13 01:58:17,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:17,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:58:17,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:19,375 INFO L130 PetriNetUnfolder]: 2494/4782 cut-off events. [2022-12-13 01:58:19,375 INFO L131 PetriNetUnfolder]: For 377168/377168 co-relation queries the response was YES. [2022-12-13 01:58:19,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60154 conditions, 4782 events. 2494/4782 cut-off events. For 377168/377168 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 36095 event pairs, 429 based on Foata normal form. 70/4852 useless extension candidates. Maximal degree in co-relation 58614. Up to 2566 conditions per place. [2022-12-13 01:58:19,434 INFO L137 encePairwiseOnDemand]: 14/42 looper letters, 374 selfloop transitions, 417 changer transitions 11/802 dead transitions. [2022-12-13 01:58:19,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 802 transitions, 24902 flow [2022-12-13 01:58:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 01:58:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 01:58:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 133 transitions. [2022-12-13 01:58:19,435 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18627450980392157 [2022-12-13 01:58:19,435 INFO L175 Difference]: Start difference. First operand has 248 places, 613 transitions, 19785 flow. Second operand 17 states and 133 transitions. [2022-12-13 01:58:19,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 802 transitions, 24902 flow [2022-12-13 01:58:20,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 802 transitions, 24514 flow, removed 187 selfloop flow, removed 2 redundant places. [2022-12-13 01:58:20,672 INFO L231 Difference]: Finished difference. Result has 270 places, 676 transitions, 22593 flow [2022-12-13 01:58:20,673 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=19429, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=362, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=22593, PETRI_PLACES=270, PETRI_TRANSITIONS=676} [2022-12-13 01:58:20,673 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 250 predicate places. [2022-12-13 01:58:20,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:20,673 INFO L89 Accepts]: Start accepts. Operand has 270 places, 676 transitions, 22593 flow [2022-12-13 01:58:20,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:20,678 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:20,678 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 270 places, 676 transitions, 22593 flow [2022-12-13 01:58:20,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 269 places, 676 transitions, 22593 flow [2022-12-13 01:58:21,015 INFO L130 PetriNetUnfolder]: 531/1832 cut-off events. [2022-12-13 01:58:21,016 INFO L131 PetriNetUnfolder]: For 110455/110501 co-relation queries the response was YES. [2022-12-13 01:58:21,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20937 conditions, 1832 events. 531/1832 cut-off events. For 110455/110501 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 17954 event pairs, 19 based on Foata normal form. 3/1831 useless extension candidates. Maximal degree in co-relation 20360. Up to 477 conditions per place. [2022-12-13 01:58:21,047 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 676 transitions, 22593 flow [2022-12-13 01:58:21,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 2634 [2022-12-13 01:58:21,048 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [336] $Ultimate##0-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_231 (+ v_~N~0_151 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225| (ite (< 1 v_~counter~0_483) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225|) (= v_~counter~0_483 (+ v_~counter~0_485 3)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_293| 1) (= v_thread1Thread1of1ForFork0_~i~0_231 4)) InVars {~counter~0=v_~counter~0_485, ~N~0=v_~N~0_151} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_225|, ~counter~0=v_~counter~0_483, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_225|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_197|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_191|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_231, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_225|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_229|, ~N~0=v_~N~0_151, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_293|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:21,048 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:21,048 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:21,139 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:21,140 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 467 [2022-12-13 01:58:21,140 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 676 transitions, 22617 flow [2022-12-13 01:58:21,140 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-13 01:58:21,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:21,140 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:21,146 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-13 01:58:21,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 01:58:21,344 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:21,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:21,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2135367415, now seen corresponding path program 1 times [2022-12-13 01:58:21,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:21,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459812904] [2022-12-13 01:58:21,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:21,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:21,390 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-13 01:58:21,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:21,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459812904] [2022-12-13 01:58:21,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459812904] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:21,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230277962] [2022-12-13 01:58:21,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:21,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:21,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:21,392 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-13 01:58:21,394 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-13 01:58:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:21,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:58:21,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:21,494 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-13 01:58:21,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:21,529 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-13 01:58:21,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230277962] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:21,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:21,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-13 01:58:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464501444] [2022-12-13 01:58:21,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:21,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 01:58:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:21,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 01:58:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-12-13 01:58:21,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:58:21,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 676 transitions, 22617 flow. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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-13 01:58:21,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:21,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:58:21,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:23,663 INFO L130 PetriNetUnfolder]: 3066/5924 cut-off events. [2022-12-13 01:58:23,664 INFO L131 PetriNetUnfolder]: For 508313/508313 co-relation queries the response was YES. [2022-12-13 01:58:23,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80600 conditions, 5924 events. 3066/5924 cut-off events. For 508313/508313 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 46606 event pairs, 70 based on Foata normal form. 46/5970 useless extension candidates. Maximal degree in co-relation 78636. Up to 1591 conditions per place. [2022-12-13 01:58:23,743 INFO L137 encePairwiseOnDemand]: 10/42 looper letters, 193 selfloop transitions, 803 changer transitions 18/1014 dead transitions. [2022-12-13 01:58:23,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 1014 transitions, 33772 flow [2022-12-13 01:58:23,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 01:58:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-13 01:58:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 204 transitions. [2022-12-13 01:58:23,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15178571428571427 [2022-12-13 01:58:23,745 INFO L175 Difference]: Start difference. First operand has 269 places, 676 transitions, 22617 flow. Second operand 32 states and 204 transitions. [2022-12-13 01:58:23,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 1014 transitions, 33772 flow [2022-12-13 01:58:25,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 1014 transitions, 32835 flow, removed 427 selfloop flow, removed 3 redundant places. [2022-12-13 01:58:25,908 INFO L231 Difference]: Finished difference. Result has 299 places, 901 transitions, 31695 flow [2022-12-13 01:58:25,909 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=22024, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=627, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=31695, PETRI_PLACES=299, PETRI_TRANSITIONS=901} [2022-12-13 01:58:25,910 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 279 predicate places. [2022-12-13 01:58:25,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:25,910 INFO L89 Accepts]: Start accepts. Operand has 299 places, 901 transitions, 31695 flow [2022-12-13 01:58:25,917 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:25,917 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:25,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 901 transitions, 31695 flow [2022-12-13 01:58:25,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 901 transitions, 31695 flow [2022-12-13 01:58:26,366 INFO L130 PetriNetUnfolder]: 639/2192 cut-off events. [2022-12-13 01:58:26,366 INFO L131 PetriNetUnfolder]: For 145328/145365 co-relation queries the response was YES. [2022-12-13 01:58:26,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27264 conditions, 2192 events. 639/2192 cut-off events. For 145328/145365 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 22254 event pairs, 1 based on Foata normal form. 3/2193 useless extension candidates. Maximal degree in co-relation 26410. Up to 613 conditions per place. [2022-12-13 01:58:26,403 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 901 transitions, 31695 flow [2022-12-13 01:58:26,403 INFO L226 LiptonReduction]: Number of co-enabled transitions 3356 [2022-12-13 01:58:26,409 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [265] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~i~0_In_1 v_~N~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:26,483 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:26,484 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 574 [2022-12-13 01:58:26,484 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 900 transitions, 31683 flow [2022-12-13 01:58:26,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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-13 01:58:26,484 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:26,484 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:26,501 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-13 01:58:26,689 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,SelfDestructingSolverStorable40 [2022-12-13 01:58:26,689 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:26,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:26,689 INFO L85 PathProgramCache]: Analyzing trace with hash 667301673, now seen corresponding path program 1 times [2022-12-13 01:58:26,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:26,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750607971] [2022-12-13 01:58:26,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:26,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:26,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:26,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:26,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750607971] [2022-12-13 01:58:26,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750607971] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:26,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444496820] [2022-12-13 01:58:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:26,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:26,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:26,745 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-13 01:58:26,770 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-13 01:58:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:26,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 01:58:26,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:26,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:26,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444496820] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:26,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:26,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-12-13 01:58:26,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247569330] [2022-12-13 01:58:26,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:26,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:26,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:26,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:26,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 01:58:26,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 900 transitions, 31683 flow. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:26,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:26,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 01:58:26,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:29,112 INFO L130 PetriNetUnfolder]: 3088/5938 cut-off events. [2022-12-13 01:58:29,112 INFO L131 PetriNetUnfolder]: For 531931/531931 co-relation queries the response was YES. [2022-12-13 01:58:29,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84199 conditions, 5938 events. 3088/5938 cut-off events. For 531931/531931 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 46565 event pairs, 346 based on Foata normal form. 24/5962 useless extension candidates. Maximal degree in co-relation 82518. Up to 4792 conditions per place. [2022-12-13 01:58:29,187 INFO L137 encePairwiseOnDemand]: 15/43 looper letters, 806 selfloop transitions, 150 changer transitions 26/982 dead transitions. [2022-12-13 01:58:29,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 982 transitions, 36254 flow [2022-12-13 01:58:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-13 01:58:29,188 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34418604651162793 [2022-12-13 01:58:29,188 INFO L175 Difference]: Start difference. First operand has 298 places, 900 transitions, 31683 flow. Second operand 5 states and 74 transitions. [2022-12-13 01:58:29,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 982 transitions, 36254 flow [2022-12-13 01:58:33,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 982 transitions, 31337 flow, removed 2382 selfloop flow, removed 6 redundant places. [2022-12-13 01:58:33,050 INFO L231 Difference]: Finished difference. Result has 299 places, 905 transitions, 28570 flow [2022-12-13 01:58:33,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=27646, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=898, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=28570, PETRI_PLACES=299, PETRI_TRANSITIONS=905} [2022-12-13 01:58:33,051 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 279 predicate places. [2022-12-13 01:58:33,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:33,051 INFO L89 Accepts]: Start accepts. Operand has 299 places, 905 transitions, 28570 flow [2022-12-13 01:58:33,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:33,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:33,057 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 905 transitions, 28570 flow [2022-12-13 01:58:33,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 905 transitions, 28570 flow [2022-12-13 01:58:33,508 INFO L130 PetriNetUnfolder]: 643/2247 cut-off events. [2022-12-13 01:58:33,508 INFO L131 PetriNetUnfolder]: For 78819/78853 co-relation queries the response was YES. [2022-12-13 01:58:33,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22536 conditions, 2247 events. 643/2247 cut-off events. For 78819/78853 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 23096 event pairs, 1 based on Foata normal form. 3/2247 useless extension candidates. Maximal degree in co-relation 22079. Up to 493 conditions per place. [2022-12-13 01:58:33,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 905 transitions, 28570 flow [2022-12-13 01:58:33,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 3360 [2022-12-13 01:58:33,544 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:58:33,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 494 [2022-12-13 01:58:33,545 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 905 transitions, 28570 flow [2022-12-13 01:58:33,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:33,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:33,545 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:33,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:33,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:33,750 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:33,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:33,750 INFO L85 PathProgramCache]: Analyzing trace with hash -693387380, now seen corresponding path program 2 times [2022-12-13 01:58:33,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:33,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038396598] [2022-12-13 01:58:33,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:33,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038396598] [2022-12-13 01:58:33,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038396598] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781745456] [2022-12-13 01:58:33,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:58:33,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:33,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:33,808 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-13 01:58:33,810 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-13 01:58:33,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:58:33,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:58:33,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 01:58:33,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:33,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:33,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:33,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781745456] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:33,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:33,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 5 [2022-12-13 01:58:33,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108631907] [2022-12-13 01:58:33,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:33,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:58:33,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:33,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:58:33,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:58:33,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:58:33,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 905 transitions, 28570 flow. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:33,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:33,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:58:33,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:36,385 INFO L130 PetriNetUnfolder]: 3810/7330 cut-off events. [2022-12-13 01:58:36,386 INFO L131 PetriNetUnfolder]: For 316365/316365 co-relation queries the response was YES. [2022-12-13 01:58:36,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83231 conditions, 7330 events. 3810/7330 cut-off events. For 316365/316365 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 59392 event pairs, 341 based on Foata normal form. 17/7347 useless extension candidates. Maximal degree in co-relation 81543. Up to 4261 conditions per place. [2022-12-13 01:58:36,473 INFO L137 encePairwiseOnDemand]: 14/42 looper letters, 802 selfloop transitions, 366 changer transitions 75/1243 dead transitions. [2022-12-13 01:58:36,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 1243 transitions, 39366 flow [2022-12-13 01:58:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:58:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:58:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-13 01:58:36,474 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3373015873015873 [2022-12-13 01:58:36,474 INFO L175 Difference]: Start difference. First operand has 299 places, 905 transitions, 28570 flow. Second operand 6 states and 85 transitions. [2022-12-13 01:58:36,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 1243 transitions, 39366 flow [2022-12-13 01:58:38,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 1243 transitions, 39131 flow, removed 104 selfloop flow, removed 1 redundant places. [2022-12-13 01:58:38,834 INFO L231 Difference]: Finished difference. Result has 307 places, 1039 transitions, 33761 flow [2022-12-13 01:58:38,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=28385, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=33761, PETRI_PLACES=307, PETRI_TRANSITIONS=1039} [2022-12-13 01:58:38,835 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 287 predicate places. [2022-12-13 01:58:38,835 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:38,835 INFO L89 Accepts]: Start accepts. Operand has 307 places, 1039 transitions, 33761 flow [2022-12-13 01:58:38,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:38,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:38,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 307 places, 1039 transitions, 33761 flow [2022-12-13 01:58:38,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 303 places, 1039 transitions, 33761 flow [2022-12-13 01:58:39,392 INFO L130 PetriNetUnfolder]: 774/2778 cut-off events. [2022-12-13 01:58:39,392 INFO L131 PetriNetUnfolder]: For 94257/94298 co-relation queries the response was YES. [2022-12-13 01:58:39,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28023 conditions, 2778 events. 774/2778 cut-off events. For 94257/94298 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 30016 event pairs, 4 based on Foata normal form. 2/2777 useless extension candidates. Maximal degree in co-relation 27491. Up to 655 conditions per place. [2022-12-13 01:58:39,440 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 303 places, 1039 transitions, 33761 flow [2022-12-13 01:58:39,440 INFO L226 LiptonReduction]: Number of co-enabled transitions 3808 [2022-12-13 01:58:39,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:39,558 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:58:39,558 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 723 [2022-12-13 01:58:39,558 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 1038 transitions, 33771 flow [2022-12-13 01:58:39,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:39,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:39,559 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:39,565 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-13 01:58:39,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:39,763 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:39,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1048476332, now seen corresponding path program 1 times [2022-12-13 01:58:39,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:39,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097500685] [2022-12-13 01:58:39,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:39,797 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-13 01:58:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:39,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097500685] [2022-12-13 01:58:39,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097500685] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:39,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790656471] [2022-12-13 01:58:39,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:39,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:39,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:39,810 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-13 01:58:39,812 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-13 01:58:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:39,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:58:39,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:39,912 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-13 01:58:39,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:39,929 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-13 01:58:39,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790656471] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:39,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:39,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 01:58:39,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075358394] [2022-12-13 01:58:39,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:39,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:58:39,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:39,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:58:39,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:58:39,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:58:39,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 1038 transitions, 33771 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 01:58:39,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:39,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:58:39,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:43,081 INFO L130 PetriNetUnfolder]: 3907/7481 cut-off events. [2022-12-13 01:58:43,081 INFO L131 PetriNetUnfolder]: For 363355/363355 co-relation queries the response was YES. [2022-12-13 01:58:43,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87956 conditions, 7481 events. 3907/7481 cut-off events. For 363355/363355 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 61307 event pairs, 507 based on Foata normal form. 390/7871 useless extension candidates. Maximal degree in co-relation 86338. Up to 3442 conditions per place. [2022-12-13 01:58:43,178 INFO L137 encePairwiseOnDemand]: 15/42 looper letters, 461 selfloop transitions, 804 changer transitions 27/1292 dead transitions. [2022-12-13 01:58:43,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 1292 transitions, 43027 flow [2022-12-13 01:58:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 01:58:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 01:58:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2022-12-13 01:58:43,180 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21825396825396826 [2022-12-13 01:58:43,180 INFO L175 Difference]: Start difference. First operand has 302 places, 1038 transitions, 33771 flow. Second operand 12 states and 110 transitions. [2022-12-13 01:58:43,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 1292 transitions, 43027 flow [2022-12-13 01:58:45,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 1292 transitions, 41958 flow, removed 444 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:45,880 INFO L231 Difference]: Finished difference. Result has 316 places, 1178 transitions, 40073 flow [2022-12-13 01:58:45,881 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=32895, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=670, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=40073, PETRI_PLACES=316, PETRI_TRANSITIONS=1178} [2022-12-13 01:58:45,881 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 296 predicate places. [2022-12-13 01:58:45,881 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:45,881 INFO L89 Accepts]: Start accepts. Operand has 316 places, 1178 transitions, 40073 flow [2022-12-13 01:58:45,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:45,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:45,890 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 316 places, 1178 transitions, 40073 flow [2022-12-13 01:58:45,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 316 places, 1178 transitions, 40073 flow [2022-12-13 01:58:46,566 INFO L130 PetriNetUnfolder]: 840/2905 cut-off events. [2022-12-13 01:58:46,566 INFO L131 PetriNetUnfolder]: For 105280/105321 co-relation queries the response was YES. [2022-12-13 01:58:46,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30729 conditions, 2905 events. 840/2905 cut-off events. For 105280/105321 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 31548 event pairs, 4 based on Foata normal form. 2/2902 useless extension candidates. Maximal degree in co-relation 30126. Up to 697 conditions per place. [2022-12-13 01:58:46,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 316 places, 1178 transitions, 40073 flow [2022-12-13 01:58:46,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 4250 [2022-12-13 01:58:46,641 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] $Ultimate##0-->L41-4: Formula: (and (= 7 v_thread1Thread1of1ForFork0_~i~0_179) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|) (= v_~counter~0_367 (+ v_~counter~0_369 6)) (< 6 v_~N~0_129) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153| (ite (< 0 (+ v_~counter~0_369 1)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_207| 1)) InVars {~counter~0=v_~counter~0_369, ~N~0=v_~N~0_129} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_153|, ~counter~0=v_~counter~0_367, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_153|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_146|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_140|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_179, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_153|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_157|, ~N~0=v_~N~0_129, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_207|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:46,641 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:46,641 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:46,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:46,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 866 [2022-12-13 01:58:46,748 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 1178 transitions, 40109 flow [2022-12-13 01:58:46,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 01:58:46,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:46,748 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:46,752 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-13 01:58:46,948 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,SelfDestructingSolverStorable43 [2022-12-13 01:58:46,948 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2003990803, now seen corresponding path program 1 times [2022-12-13 01:58:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:46,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336286669] [2022-12-13 01:58:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:46,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:46,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:46,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336286669] [2022-12-13 01:58:46,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336286669] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:46,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676029379] [2022-12-13 01:58:46,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:46,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:46,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:46,986 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-13 01:58:47,015 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-13 01:58:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:47,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:58:47,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:47,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:47,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676029379] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:47,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:47,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-13 01:58:47,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547721987] [2022-12-13 01:58:47,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:47,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:58:47,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:47,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:58:47,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:58:47,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 01:58:47,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 1178 transitions, 40109 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-13 01:58:47,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:47,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 01:58:47,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:50,667 INFO L130 PetriNetUnfolder]: 4148/7940 cut-off events. [2022-12-13 01:58:50,667 INFO L131 PetriNetUnfolder]: For 391949/391949 co-relation queries the response was YES. [2022-12-13 01:58:50,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96256 conditions, 7940 events. 4148/7940 cut-off events. For 391949/391949 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 65740 event pairs, 669 based on Foata normal form. 64/8004 useless extension candidates. Maximal degree in co-relation 94564. Up to 4550 conditions per place. [2022-12-13 01:58:50,762 INFO L137 encePairwiseOnDemand]: 16/43 looper letters, 814 selfloop transitions, 634 changer transitions 2/1450 dead transitions. [2022-12-13 01:58:50,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 1450 transitions, 49231 flow [2022-12-13 01:58:50,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 01:58:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 01:58:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 122 transitions. [2022-12-13 01:58:50,763 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18914728682170542 [2022-12-13 01:58:50,763 INFO L175 Difference]: Start difference. First operand has 316 places, 1178 transitions, 40109 flow. Second operand 15 states and 122 transitions. [2022-12-13 01:58:50,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 1450 transitions, 49231 flow [2022-12-13 01:58:53,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 1450 transitions, 47606 flow, removed 543 selfloop flow, removed 3 redundant places. [2022-12-13 01:58:53,983 INFO L231 Difference]: Finished difference. Result has 330 places, 1261 transitions, 43487 flow [2022-12-13 01:58:53,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=38642, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=561, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=43487, PETRI_PLACES=330, PETRI_TRANSITIONS=1261} [2022-12-13 01:58:53,984 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 310 predicate places. [2022-12-13 01:58:53,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:53,984 INFO L89 Accepts]: Start accepts. Operand has 330 places, 1261 transitions, 43487 flow [2022-12-13 01:58:53,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:53,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:53,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 330 places, 1261 transitions, 43487 flow [2022-12-13 01:58:54,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 330 places, 1261 transitions, 43487 flow [2022-12-13 01:58:54,731 INFO L130 PetriNetUnfolder]: 906/3142 cut-off events. [2022-12-13 01:58:54,731 INFO L131 PetriNetUnfolder]: For 115318/115360 co-relation queries the response was YES. [2022-12-13 01:58:54,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33344 conditions, 3142 events. 906/3142 cut-off events. For 115318/115360 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 34622 event pairs, 4 based on Foata normal form. 2/3139 useless extension candidates. Maximal degree in co-relation 32755. Up to 761 conditions per place. [2022-12-13 01:58:54,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 330 places, 1261 transitions, 43487 flow [2022-12-13 01:58:54,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 4608 [2022-12-13 01:58:54,797 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:54,797 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:54,914 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:54,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 931 [2022-12-13 01:58:54,915 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 1261 transitions, 43518 flow [2022-12-13 01:58:54,915 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-13 01:58:54,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:54,915 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:54,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-13 01:58:55,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:55,119 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1656321263, now seen corresponding path program 1 times [2022-12-13 01:58:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:55,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183663055] [2022-12-13 01:58:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:55,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:55,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:55,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183663055] [2022-12-13 01:58:55,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183663055] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:55,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698584919] [2022-12-13 01:58:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:55,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:55,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:55,189 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-13 01:58:55,204 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-13 01:58:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:55,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 01:58:55,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:55,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:55,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698584919] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:55,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:55,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 5 [2022-12-13 01:58:55,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007615244] [2022-12-13 01:58:55,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:55,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:58:55,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:55,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:58:55,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:58:55,319 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 01:58:55,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 1261 transitions, 43518 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-13 01:58:55,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:55,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 01:58:55,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:59,055 INFO L130 PetriNetUnfolder]: 4196/8056 cut-off events. [2022-12-13 01:58:59,056 INFO L131 PetriNetUnfolder]: For 378698/378698 co-relation queries the response was YES. [2022-12-13 01:58:59,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98496 conditions, 8056 events. 4196/8056 cut-off events. For 378698/378698 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 66865 event pairs, 389 based on Foata normal form. 5/8061 useless extension candidates. Maximal degree in co-relation 96647. Up to 6882 conditions per place. [2022-12-13 01:58:59,159 INFO L137 encePairwiseOnDemand]: 15/44 looper letters, 1135 selfloop transitions, 182 changer transitions 30/1347 dead transitions. [2022-12-13 01:58:59,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1347 transitions, 47840 flow [2022-12-13 01:58:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:58:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:58:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-13 01:58:59,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3106060606060606 [2022-12-13 01:58:59,160 INFO L175 Difference]: Start difference. First operand has 330 places, 1261 transitions, 43518 flow. Second operand 6 states and 82 transitions. [2022-12-13 01:58:59,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 1347 transitions, 47840 flow [2022-12-13 01:59:01,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 1347 transitions, 47498 flow, removed 152 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:01,926 INFO L231 Difference]: Finished difference. Result has 334 places, 1267 transitions, 44040 flow [2022-12-13 01:59:01,927 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=43182, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1079, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=44040, PETRI_PLACES=334, PETRI_TRANSITIONS=1267} [2022-12-13 01:59:01,927 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 314 predicate places. [2022-12-13 01:59:01,927 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:01,927 INFO L89 Accepts]: Start accepts. Operand has 334 places, 1267 transitions, 44040 flow [2022-12-13 01:59:01,936 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:01,937 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:01,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 334 places, 1267 transitions, 44040 flow [2022-12-13 01:59:01,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 1267 transitions, 44040 flow [2022-12-13 01:59:02,679 INFO L130 PetriNetUnfolder]: 913/3164 cut-off events. [2022-12-13 01:59:02,680 INFO L131 PetriNetUnfolder]: For 117054/117103 co-relation queries the response was YES. [2022-12-13 01:59:02,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33935 conditions, 3164 events. 913/3164 cut-off events. For 117054/117103 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 34945 event pairs, 6 based on Foata normal form. 2/3161 useless extension candidates. Maximal degree in co-relation 33306. Up to 772 conditions per place. [2022-12-13 01:59:02,738 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 334 places, 1267 transitions, 44040 flow [2022-12-13 01:59:02,738 INFO L226 LiptonReduction]: Number of co-enabled transitions 4624 [2022-12-13 01:59:02,741 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:59:02,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 814 [2022-12-13 01:59:02,741 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 1267 transitions, 44040 flow [2022-12-13 01:59:02,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-13 01:59:02,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:02,741 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:02,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-13 01:59:02,942 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,SelfDestructingSolverStorable45 [2022-12-13 01:59:02,943 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:02,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:02,943 INFO L85 PathProgramCache]: Analyzing trace with hash 232520517, now seen corresponding path program 1 times [2022-12-13 01:59:02,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:02,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95111823] [2022-12-13 01:59:02,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:02,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:03,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:03,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95111823] [2022-12-13 01:59:03,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95111823] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:03,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49805305] [2022-12-13 01:59:03,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:03,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:03,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:03,011 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-13 01:59:03,013 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-13 01:59:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:03,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 01:59:03,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:03,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:03,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49805305] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:03,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:03,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 5 [2022-12-13 01:59:03,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504156796] [2022-12-13 01:59:03,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:03,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:59:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:03,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:59:03,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:59:03,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 01:59:03,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 1267 transitions, 44040 flow. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:03,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:03,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 01:59:03,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:06,970 INFO L130 PetriNetUnfolder]: 4351/8360 cut-off events. [2022-12-13 01:59:06,970 INFO L131 PetriNetUnfolder]: For 393430/393430 co-relation queries the response was YES. [2022-12-13 01:59:07,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102268 conditions, 8360 events. 4351/8360 cut-off events. For 393430/393430 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 69911 event pairs, 349 based on Foata normal form. 12/8372 useless extension candidates. Maximal degree in co-relation 100421. Up to 5120 conditions per place. [2022-12-13 01:59:07,095 INFO L137 encePairwiseOnDemand]: 15/44 looper letters, 965 selfloop transitions, 451 changer transitions 43/1459 dead transitions. [2022-12-13 01:59:07,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 1459 transitions, 51268 flow [2022-12-13 01:59:07,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:59:07,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:59:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-13 01:59:07,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32954545454545453 [2022-12-13 01:59:07,096 INFO L175 Difference]: Start difference. First operand has 334 places, 1267 transitions, 44040 flow. Second operand 6 states and 87 transitions. [2022-12-13 01:59:07,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 1459 transitions, 51268 flow [2022-12-13 01:59:10,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 1459 transitions, 51209 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-13 01:59:10,134 INFO L231 Difference]: Finished difference. Result has 342 places, 1297 transitions, 46772 flow [2022-12-13 01:59:10,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=43991, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=425, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=825, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=46772, PETRI_PLACES=342, PETRI_TRANSITIONS=1297} [2022-12-13 01:59:10,135 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 322 predicate places. [2022-12-13 01:59:10,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:10,135 INFO L89 Accepts]: Start accepts. Operand has 342 places, 1297 transitions, 46772 flow [2022-12-13 01:59:10,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:10,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:10,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 342 places, 1297 transitions, 46772 flow [2022-12-13 01:59:10,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 342 places, 1297 transitions, 46772 flow [2022-12-13 01:59:10,968 INFO L130 PetriNetUnfolder]: 942/3273 cut-off events. [2022-12-13 01:59:10,968 INFO L131 PetriNetUnfolder]: For 124897/124897 co-relation queries the response was YES. [2022-12-13 01:59:11,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36068 conditions, 3273 events. 942/3273 cut-off events. For 124897/124897 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 36417 event pairs, 8 based on Foata normal form. 0/3269 useless extension candidates. Maximal degree in co-relation 35409. Up to 812 conditions per place. [2022-12-13 01:59:11,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 342 places, 1297 transitions, 46772 flow [2022-12-13 01:59:11,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 4724 [2022-12-13 01:59:11,046 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:59:11,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 911 [2022-12-13 01:59:11,046 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 1297 transitions, 46772 flow [2022-12-13 01:59:11,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:11,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:11,046 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:11,051 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-13 01:59:11,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:11,251 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:11,251 INFO L85 PathProgramCache]: Analyzing trace with hash 446513277, now seen corresponding path program 2 times [2022-12-13 01:59:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:11,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987100653] [2022-12-13 01:59:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:11,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:11,289 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-13 01:59:11,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:11,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987100653] [2022-12-13 01:59:11,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987100653] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:11,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477915913] [2022-12-13 01:59:11,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:59:11,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:11,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:11,297 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:11,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-13 01:59:11,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:59:11,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:59:11,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:59:11,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:11,411 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-13 01:59:11,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:11,446 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-13 01:59:11,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477915913] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:11,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:11,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 01:59:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797153095] [2022-12-13 01:59:11,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:11,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 01:59:11,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:11,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 01:59:11,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-12-13 01:59:11,448 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 01:59:11,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 1297 transitions, 46772 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-13 01:59:11,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:11,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 01:59:11,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:15,938 INFO L130 PetriNetUnfolder]: 4581/8835 cut-off events. [2022-12-13 01:59:15,939 INFO L131 PetriNetUnfolder]: For 437904/437904 co-relation queries the response was YES. [2022-12-13 01:59:16,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110141 conditions, 8835 events. 4581/8835 cut-off events. For 437904/437904 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 74730 event pairs, 183 based on Foata normal form. 220/9055 useless extension candidates. Maximal degree in co-relation 108288. Up to 2285 conditions per place. [2022-12-13 01:59:16,064 INFO L137 encePairwiseOnDemand]: 12/44 looper letters, 270 selfloop transitions, 1212 changer transitions 5/1487 dead transitions. [2022-12-13 01:59:16,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 1487 transitions, 54338 flow [2022-12-13 01:59:16,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 01:59:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 01:59:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 132 transitions. [2022-12-13 01:59:16,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1875 [2022-12-13 01:59:16,065 INFO L175 Difference]: Start difference. First operand has 342 places, 1297 transitions, 46772 flow. Second operand 16 states and 132 transitions. [2022-12-13 01:59:16,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 1487 transitions, 54338 flow [2022-12-13 01:59:19,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 1487 transitions, 53361 flow, removed 149 selfloop flow, removed 8 redundant places. [2022-12-13 01:59:19,501 INFO L231 Difference]: Finished difference. Result has 353 places, 1396 transitions, 53643 flow [2022-12-13 01:59:19,502 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=45509, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=53643, PETRI_PLACES=353, PETRI_TRANSITIONS=1396} [2022-12-13 01:59:19,503 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 333 predicate places. [2022-12-13 01:59:19,503 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:19,503 INFO L89 Accepts]: Start accepts. Operand has 353 places, 1396 transitions, 53643 flow [2022-12-13 01:59:19,511 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:19,511 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:19,511 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 353 places, 1396 transitions, 53643 flow [2022-12-13 01:59:19,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 1396 transitions, 53643 flow [2022-12-13 01:59:20,393 INFO L130 PetriNetUnfolder]: 998/3522 cut-off events. [2022-12-13 01:59:20,393 INFO L131 PetriNetUnfolder]: For 142373/142430 co-relation queries the response was YES. [2022-12-13 01:59:20,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39873 conditions, 3522 events. 998/3522 cut-off events. For 142373/142430 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 39825 event pairs, 7 based on Foata normal form. 2/3523 useless extension candidates. Maximal degree in co-relation 39196. Up to 882 conditions per place. [2022-12-13 01:59:20,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 353 places, 1396 transitions, 53643 flow [2022-12-13 01:59:20,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 5058 [2022-12-13 01:59:20,463 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:59:20,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 960 [2022-12-13 01:59:20,463 INFO L495 AbstractCegarLoop]: Abstraction has has 353 places, 1396 transitions, 53643 flow [2022-12-13 01:59:20,464 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-13 01:59:20,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:20,464 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:20,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-12-13 01:59:20,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-13 01:59:20,669 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:20,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1611584767, now seen corresponding path program 1 times [2022-12-13 01:59:20,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:20,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781011791] [2022-12-13 01:59:20,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:20,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:20,736 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-13 01:59:20,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:20,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781011791] [2022-12-13 01:59:20,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781011791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:20,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456738707] [2022-12-13 01:59:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:20,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:20,738 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:20,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-13 01:59:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:20,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 01:59:20,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:20,829 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-13 01:59:20,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:20,854 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-13 01:59:20,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456738707] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:20,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:20,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 6 [2022-12-13 01:59:20,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955783726] [2022-12-13 01:59:20,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:20,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:59:20,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:20,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:59:20,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:59:20,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 01:59:20,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 1396 transitions, 53643 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:20,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:20,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 01:59:20,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:27,152 INFO L130 PetriNetUnfolder]: 6160/11790 cut-off events. [2022-12-13 01:59:27,152 INFO L131 PetriNetUnfolder]: For 630971/630971 co-relation queries the response was YES. [2022-12-13 01:59:27,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152921 conditions, 11790 events. 6160/11790 cut-off events. For 630971/630971 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 103459 event pairs, 345 based on Foata normal form. 12/11802 useless extension candidates. Maximal degree in co-relation 148726. Up to 5301 conditions per place. [2022-12-13 01:59:27,312 INFO L137 encePairwiseOnDemand]: 14/44 looper letters, 1021 selfloop transitions, 926 changer transitions 70/2017 dead transitions. [2022-12-13 01:59:27,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 2017 transitions, 76927 flow [2022-12-13 01:59:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:59:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:59:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-12-13 01:59:27,313 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3246753246753247 [2022-12-13 01:59:27,313 INFO L175 Difference]: Start difference. First operand has 353 places, 1396 transitions, 53643 flow. Second operand 7 states and 100 transitions. [2022-12-13 01:59:27,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 2017 transitions, 76927 flow [2022-12-13 01:59:33,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 2017 transitions, 75584 flow, removed 592 selfloop flow, removed 5 redundant places. [2022-12-13 01:59:33,314 INFO L231 Difference]: Finished difference. Result has 359 places, 1794 transitions, 71219 flow [2022-12-13 01:59:33,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=52636, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=525, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=71219, PETRI_PLACES=359, PETRI_TRANSITIONS=1794} [2022-12-13 01:59:33,318 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 339 predicate places. [2022-12-13 01:59:33,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:33,318 INFO L89 Accepts]: Start accepts. Operand has 359 places, 1794 transitions, 71219 flow [2022-12-13 01:59:33,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:33,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:33,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 359 places, 1794 transitions, 71219 flow [2022-12-13 01:59:33,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 1794 transitions, 71219 flow [2022-12-13 01:59:34,795 INFO L130 PetriNetUnfolder]: 1323/4597 cut-off events. [2022-12-13 01:59:34,796 INFO L131 PetriNetUnfolder]: For 188413/188478 co-relation queries the response was YES. [2022-12-13 01:59:34,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53721 conditions, 4597 events. 1323/4597 cut-off events. For 188413/188478 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 54169 event pairs, 10 based on Foata normal form. 2/4598 useless extension candidates. Maximal degree in co-relation 52479. Up to 1214 conditions per place. [2022-12-13 01:59:34,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 1794 transitions, 71219 flow [2022-12-13 01:59:34,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 6662 [2022-12-13 01:59:34,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] $Ultimate##0-->L41-4: Formula: (and (= 5 v_thread1Thread1of1ForFork0_~i~0_257) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_256| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_332| 1) (= (ite (< 2 v_~counter~0_539) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_256|) (= v_~counter~0_539 (+ v_~counter~0_541 4)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_256| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_256|) (< 4 v_~N~0_163)) InVars {~counter~0=v_~counter~0_541, ~N~0=v_~N~0_163} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_256|, ~counter~0=v_~counter~0_539, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_256|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_219|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_213|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_257, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_256|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_260|, ~N~0=v_~N~0_163, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_332|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:34,899 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:34,899 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:34,990 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:34,991 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1673 [2022-12-13 01:59:34,991 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 1794 transitions, 71260 flow [2022-12-13 01:59:34,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:34,991 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:34,991 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:34,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-12-13 01:59:35,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 01:59:35,195 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash 148156060, now seen corresponding path program 1 times [2022-12-13 01:59:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:35,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327726819] [2022-12-13 01:59:35,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:35,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:35,247 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-13 01:59:35,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:35,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327726819] [2022-12-13 01:59:35,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327726819] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:35,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889523357] [2022-12-13 01:59:35,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:35,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:35,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:35,265 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:35,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-13 01:59:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:35,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:59:35,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:35,378 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-13 01:59:35,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:35,398 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-13 01:59:35,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889523357] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:35,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:35,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 01:59:35,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733774782] [2022-12-13 01:59:35,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:35,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:59:35,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:35,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:59:35,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:59:35,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 01:59:35,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 1794 transitions, 71260 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:35,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:35,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 01:59:35,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:44,392 INFO L130 PetriNetUnfolder]: 7239/13806 cut-off events. [2022-12-13 01:59:44,392 INFO L131 PetriNetUnfolder]: For 797972/797972 co-relation queries the response was YES. [2022-12-13 01:59:44,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186347 conditions, 13806 events. 7239/13806 cut-off events. For 797972/797972 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 123852 event pairs, 850 based on Foata normal form. 100/13906 useless extension candidates. Maximal degree in co-relation 184487. Up to 5784 conditions per place. [2022-12-13 01:59:44,579 INFO L137 encePairwiseOnDemand]: 11/43 looper letters, 707 selfloop transitions, 1548 changer transitions 15/2270 dead transitions. [2022-12-13 01:59:44,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 2270 transitions, 92160 flow [2022-12-13 01:59:44,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 01:59:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 01:59:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 109 transitions. [2022-12-13 01:59:44,580 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19499105545617174 [2022-12-13 01:59:44,580 INFO L175 Difference]: Start difference. First operand has 357 places, 1794 transitions, 71260 flow. Second operand 13 states and 109 transitions. [2022-12-13 01:59:44,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 2270 transitions, 92160 flow [2022-12-13 01:59:52,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 2270 transitions, 89079 flow, removed 1508 selfloop flow, removed 3 redundant places. [2022-12-13 01:59:52,291 INFO L231 Difference]: Finished difference. Result has 373 places, 2165 transitions, 88372 flow [2022-12-13 01:59:52,292 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=69163, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=88372, PETRI_PLACES=373, PETRI_TRANSITIONS=2165} [2022-12-13 01:59:52,293 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 353 predicate places. [2022-12-13 01:59:52,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:52,293 INFO L89 Accepts]: Start accepts. Operand has 373 places, 2165 transitions, 88372 flow [2022-12-13 01:59:52,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:52,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:52,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 373 places, 2165 transitions, 88372 flow [2022-12-13 01:59:52,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 373 places, 2165 transitions, 88372 flow [2022-12-13 01:59:54,109 INFO L130 PetriNetUnfolder]: 1568/5414 cut-off events. [2022-12-13 01:59:54,109 INFO L131 PetriNetUnfolder]: For 237703/237768 co-relation queries the response was YES. [2022-12-13 01:59:54,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65549 conditions, 5414 events. 1568/5414 cut-off events. For 237703/237768 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 65559 event pairs, 10 based on Foata normal form. 2/5415 useless extension candidates. Maximal degree in co-relation 64148. Up to 1292 conditions per place. [2022-12-13 01:59:54,225 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 373 places, 2165 transitions, 88372 flow [2022-12-13 01:59:54,225 INFO L226 LiptonReduction]: Number of co-enabled transitions 8076 [2022-12-13 01:59:54,228 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:59:54,228 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1935 [2022-12-13 01:59:54,228 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 2165 transitions, 88372 flow [2022-12-13 01:59:54,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:54,229 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:54,229 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:54,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-13 01:59:54,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-13 01:59:54,433 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash -399854335, now seen corresponding path program 1 times [2022-12-13 01:59:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:54,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709490006] [2022-12-13 01:59:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:54,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:54,474 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-13 01:59:54,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:54,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709490006] [2022-12-13 01:59:54,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709490006] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:54,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910135227] [2022-12-13 01:59:54,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:54,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:54,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:54,476 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:54,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-13 01:59:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:54,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 01:59:54,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:54,598 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-13 01:59:54,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:54,629 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-13 01:59:54,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910135227] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:54,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:54,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-13 01:59:54,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990695054] [2022-12-13 01:59:54,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:54,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 01:59:54,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:54,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 01:59:54,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-12-13 01:59:54,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 01:59:54,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 2165 transitions, 88372 flow. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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-13 01:59:54,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:54,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 01:59:54,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:05,858 INFO L130 PetriNetUnfolder]: 7614/14499 cut-off events. [2022-12-13 02:00:05,858 INFO L131 PetriNetUnfolder]: For 929149/929149 co-relation queries the response was YES. [2022-12-13 02:00:06,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201524 conditions, 14499 events. 7614/14499 cut-off events. For 929149/929149 co-relation queries the response was YES. Maximal size of possible extension queue 1179. Compared 131378 event pairs, 1421 based on Foata normal form. 4/14503 useless extension candidates. Maximal degree in co-relation 196843. Up to 9831 conditions per place. [2022-12-13 02:00:06,118 INFO L137 encePairwiseOnDemand]: 15/43 looper letters, 1561 selfloop transitions, 953 changer transitions 0/2514 dead transitions. [2022-12-13 02:00:06,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 2514 transitions, 102642 flow [2022-12-13 02:00:06,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 02:00:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 02:00:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 129 transitions. [2022-12-13 02:00:06,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17647058823529413 [2022-12-13 02:00:06,119 INFO L175 Difference]: Start difference. First operand has 373 places, 2165 transitions, 88372 flow. Second operand 17 states and 129 transitions. [2022-12-13 02:00:06,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 2514 transitions, 102642 flow [2022-12-13 02:00:15,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 2514 transitions, 101459 flow, removed 585 selfloop flow, removed 1 redundant places. [2022-12-13 02:00:15,917 INFO L231 Difference]: Finished difference. Result has 391 places, 2270 transitions, 94521 flow [2022-12-13 02:00:15,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=87339, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=856, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=94521, PETRI_PLACES=391, PETRI_TRANSITIONS=2270} [2022-12-13 02:00:15,919 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 371 predicate places. [2022-12-13 02:00:15,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:15,919 INFO L89 Accepts]: Start accepts. Operand has 391 places, 2270 transitions, 94521 flow [2022-12-13 02:00:15,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:15,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:15,941 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 391 places, 2270 transitions, 94521 flow [2022-12-13 02:00:16,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 391 places, 2270 transitions, 94521 flow [2022-12-13 02:00:18,267 INFO L130 PetriNetUnfolder]: 1646/5695 cut-off events. [2022-12-13 02:00:18,267 INFO L131 PetriNetUnfolder]: For 261733/261798 co-relation queries the response was YES. [2022-12-13 02:00:18,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69807 conditions, 5695 events. 1646/5695 cut-off events. For 261733/261798 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 69587 event pairs, 10 based on Foata normal form. 2/5696 useless extension candidates. Maximal degree in co-relation 68370. Up to 1382 conditions per place. [2022-12-13 02:00:18,387 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 391 places, 2270 transitions, 94521 flow [2022-12-13 02:00:18,387 INFO L226 LiptonReduction]: Number of co-enabled transitions 8550 [2022-12-13 02:00:18,684 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:00:18,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2765 [2022-12-13 02:00:18,684 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 2270 transitions, 94647 flow [2022-12-13 02:00:18,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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-13 02:00:18,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:18,685 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:18,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-13 02:00:18,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-12-13 02:00:18,890 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:18,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:18,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1934894665, now seen corresponding path program 1 times [2022-12-13 02:00:18,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:18,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311950603] [2022-12-13 02:00:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:18,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:18,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:18,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311950603] [2022-12-13 02:00:18,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311950603] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:00:18,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235676024] [2022-12-13 02:00:18,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:18,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:00:18,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:00:18,945 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:00:18,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-13 02:00:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:19,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 02:00:19,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:00:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:19,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:00:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:19,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235676024] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:00:19,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:00:19,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-13 02:00:19,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796398899] [2022-12-13 02:00:19,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:00:19,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 02:00:19,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:19,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 02:00:19,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-12-13 02:00:19,081 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 02:00:19,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 2270 transitions, 94647 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:19,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:19,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 02:00:19,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:31,901 INFO L130 PetriNetUnfolder]: 8111/15428 cut-off events. [2022-12-13 02:00:31,901 INFO L131 PetriNetUnfolder]: For 1042884/1042884 co-relation queries the response was YES. [2022-12-13 02:00:32,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217790 conditions, 15428 events. 8111/15428 cut-off events. For 1042884/1042884 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 140721 event pairs, 1329 based on Foata normal form. 164/15592 useless extension candidates. Maximal degree in co-relation 212917. Up to 9157 conditions per place. [2022-12-13 02:00:32,167 INFO L137 encePairwiseOnDemand]: 14/45 looper letters, 1491 selfloop transitions, 1183 changer transitions 36/2710 dead transitions. [2022-12-13 02:00:32,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 2710 transitions, 111619 flow [2022-12-13 02:00:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 02:00:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 02:00:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 162 transitions. [2022-12-13 02:00:32,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16363636363636364 [2022-12-13 02:00:32,168 INFO L175 Difference]: Start difference. First operand has 391 places, 2270 transitions, 94647 flow. Second operand 22 states and 162 transitions. [2022-12-13 02:00:32,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 2710 transitions, 111619 flow [2022-12-13 02:00:43,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 2710 transitions, 111117 flow, removed 228 selfloop flow, removed 6 redundant places. [2022-12-13 02:00:43,271 INFO L231 Difference]: Finished difference. Result has 413 places, 2386 transitions, 102136 flow [2022-12-13 02:00:43,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=94161, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1069, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=102136, PETRI_PLACES=413, PETRI_TRANSITIONS=2386} [2022-12-13 02:00:43,273 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 393 predicate places. [2022-12-13 02:00:43,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:43,273 INFO L89 Accepts]: Start accepts. Operand has 413 places, 2386 transitions, 102136 flow [2022-12-13 02:00:43,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:43,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:43,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 413 places, 2386 transitions, 102136 flow [2022-12-13 02:00:43,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 413 places, 2386 transitions, 102136 flow [2022-12-13 02:00:45,789 INFO L130 PetriNetUnfolder]: 1737/6006 cut-off events. [2022-12-13 02:00:45,790 INFO L131 PetriNetUnfolder]: For 295071/295136 co-relation queries the response was YES. [2022-12-13 02:00:45,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75423 conditions, 6006 events. 1737/6006 cut-off events. For 295071/295136 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 74122 event pairs, 10 based on Foata normal form. 2/6006 useless extension candidates. Maximal degree in co-relation 73909. Up to 1486 conditions per place. [2022-12-13 02:00:45,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 413 places, 2386 transitions, 102136 flow [2022-12-13 02:00:45,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 8970 [2022-12-13 02:00:46,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [350] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290| (ite (< 0 (+ v_~counter~0_595 1)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290|) (= v_~counter~0_595 (+ v_~counter~0_597 3)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_373|) (not (= (ite (< 1 v_~counter~0_595) 1 0) 0)) (= 5 v_thread1Thread1of1ForFork0_~i~0_278) (< 4 v_~N~0_169)) InVars {~counter~0=v_~counter~0_597, ~N~0=v_~N~0_169} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290|, ~counter~0=v_~counter~0_595, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_290|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_240|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_234|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_278, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_290|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_294|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_373|, ~N~0=v_~N~0_169} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 02:00:46,112 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:46,113 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:46,207 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [252] L41-4-->L41-4: Formula: (and (= (+ v_~counter~0_77 1) v_~counter~0_76) (< v_thread1Thread1of1ForFork0_~i~0_24 v_~N~0_43) (= (+ v_thread1Thread1of1ForFork0_~i~0_24 1) v_thread1Thread1of1ForFork0_~i~0_23)) InVars {~counter~0=v_~counter~0_77, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_24, ~N~0=v_~N~0_43} OutVars{~counter~0=v_~counter~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_23, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:46,258 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:00:46,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2985 [2022-12-13 02:00:46,258 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 2385 transitions, 102236 flow [2022-12-13 02:00:46,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:46,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:46,258 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:46,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-13 02:00:46,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:00:46,462 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:46,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1444899217, now seen corresponding path program 1 times [2022-12-13 02:00:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:46,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476407039] [2022-12-13 02:00:46,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:46,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:46,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476407039] [2022-12-13 02:00:46,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476407039] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:00:46,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162819498] [2022-12-13 02:00:46,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:46,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:00:46,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:00:46,517 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:00:46,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-13 02:00:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:46,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:00:46,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:00:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:46,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:00:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:46,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162819498] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:00:46,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:00:46,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 02:00:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794567021] [2022-12-13 02:00:46,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:00:46,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 02:00:46,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:46,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 02:00:46,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-12-13 02:00:46,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 02:00:46,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 2385 transitions, 102236 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-13 02:00:46,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:46,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 02:00:46,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:00,619 INFO L130 PetriNetUnfolder]: 8094/15407 cut-off events. [2022-12-13 02:01:00,619 INFO L131 PetriNetUnfolder]: For 1117566/1117566 co-relation queries the response was YES. [2022-12-13 02:01:00,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223677 conditions, 15407 events. 8094/15407 cut-off events. For 1117566/1117566 co-relation queries the response was YES. Maximal size of possible extension queue 1250. Compared 140701 event pairs, 1602 based on Foata normal form. 34/15439 useless extension candidates. Maximal degree in co-relation 218523. Up to 11028 conditions per place. [2022-12-13 02:01:00,885 INFO L137 encePairwiseOnDemand]: 16/48 looper letters, 1740 selfloop transitions, 902 changer transitions 1/2643 dead transitions. [2022-12-13 02:01:00,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 2643 transitions, 113462 flow [2022-12-13 02:01:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 02:01:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 02:01:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 121 transitions. [2022-12-13 02:01:00,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1800595238095238 [2022-12-13 02:01:00,886 INFO L175 Difference]: Start difference. First operand has 412 places, 2385 transitions, 102236 flow. Second operand 14 states and 121 transitions. [2022-12-13 02:01:00,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 2643 transitions, 113462 flow [2022-12-13 02:01:12,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 2643 transitions, 112051 flow, removed 591 selfloop flow, removed 3 redundant places. [2022-12-13 02:01:13,009 INFO L231 Difference]: Finished difference. Result has 423 places, 2408 transitions, 103889 flow [2022-12-13 02:01:13,011 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=100825, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=878, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=103889, PETRI_PLACES=423, PETRI_TRANSITIONS=2408} [2022-12-13 02:01:13,011 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 403 predicate places. [2022-12-13 02:01:13,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:13,011 INFO L89 Accepts]: Start accepts. Operand has 423 places, 2408 transitions, 103889 flow [2022-12-13 02:01:13,031 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:13,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:13,032 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 423 places, 2408 transitions, 103889 flow [2022-12-13 02:01:13,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 422 places, 2408 transitions, 103889 flow [2022-12-13 02:01:15,865 INFO L130 PetriNetUnfolder]: 1755/6041 cut-off events. [2022-12-13 02:01:15,865 INFO L131 PetriNetUnfolder]: For 306198/306265 co-relation queries the response was YES. [2022-12-13 02:01:15,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76556 conditions, 6041 events. 1755/6041 cut-off events. For 306198/306265 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 74442 event pairs, 11 based on Foata normal form. 2/6041 useless extension candidates. Maximal degree in co-relation 74953. Up to 1500 conditions per place. [2022-12-13 02:01:16,004 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 422 places, 2408 transitions, 103889 flow [2022-12-13 02:01:16,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 9074 [2022-12-13 02:01:16,008 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:01:16,008 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2997 [2022-12-13 02:01:16,008 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 2408 transitions, 103889 flow [2022-12-13 02:01:16,008 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-13 02:01:16,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:16,009 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:16,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-13 02:01:16,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:01:16,213 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:16,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:16,213 INFO L85 PathProgramCache]: Analyzing trace with hash 234421136, now seen corresponding path program 1 times [2022-12-13 02:01:16,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:16,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53931386] [2022-12-13 02:01:16,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:16,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:16,248 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-13 02:01:16,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:16,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53931386] [2022-12-13 02:01:16,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53931386] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:01:16,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29915004] [2022-12-13 02:01:16,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:16,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:01:16,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:01:16,265 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:01:16,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-13 02:01:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:16,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:01:16,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:01:16,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-13 02:01:16,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:01:16,385 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-13 02:01:16,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29915004] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:01:16,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:01:16,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 02:01:16,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412089417] [2022-12-13 02:01:16,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:01:16,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:01:16,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:16,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:01:16,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:01:16,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 02:01:16,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 2408 transitions, 103889 flow. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:16,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:16,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 02:01:16,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:32,564 INFO L130 PetriNetUnfolder]: 8793/16837 cut-off events. [2022-12-13 02:01:32,564 INFO L131 PetriNetUnfolder]: For 1164066/1164066 co-relation queries the response was YES. [2022-12-13 02:01:32,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243773 conditions, 16837 events. 8793/16837 cut-off events. For 1164066/1164066 co-relation queries the response was YES. Maximal size of possible extension queue 1362. Compared 155787 event pairs, 207 based on Foata normal form. 64/16899 useless extension candidates. Maximal degree in co-relation 237001. Up to 5085 conditions per place. [2022-12-13 02:01:32,840 INFO L137 encePairwiseOnDemand]: 11/47 looper letters, 406 selfloop transitions, 2382 changer transitions 2/2790 dead transitions. [2022-12-13 02:01:32,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 2790 transitions, 120508 flow [2022-12-13 02:01:32,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 02:01:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 02:01:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 173 transitions. [2022-12-13 02:01:32,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15336879432624115 [2022-12-13 02:01:32,841 INFO L175 Difference]: Start difference. First operand has 422 places, 2408 transitions, 103889 flow. Second operand 24 states and 173 transitions. [2022-12-13 02:01:32,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 2790 transitions, 120508 flow [2022-12-13 02:01:47,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 2790 transitions, 119516 flow, removed 156 selfloop flow, removed 6 redundant places. [2022-12-13 02:01:47,967 INFO L231 Difference]: Finished difference. Result has 451 places, 2665 transitions, 121017 flow [2022-12-13 02:01:47,969 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=102917, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=121017, PETRI_PLACES=451, PETRI_TRANSITIONS=2665} [2022-12-13 02:01:47,969 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 431 predicate places. [2022-12-13 02:01:47,969 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:47,969 INFO L89 Accepts]: Start accepts. Operand has 451 places, 2665 transitions, 121017 flow [2022-12-13 02:01:48,000 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:48,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:48,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 451 places, 2665 transitions, 121017 flow [2022-12-13 02:01:48,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 451 places, 2665 transitions, 121017 flow [2022-12-13 02:01:51,894 INFO L130 PetriNetUnfolder]: 1881/6524 cut-off events. [2022-12-13 02:01:51,894 INFO L131 PetriNetUnfolder]: For 378443/378510 co-relation queries the response was YES. [2022-12-13 02:01:51,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88588 conditions, 6524 events. 1881/6524 cut-off events. For 378443/378510 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 81626 event pairs, 8 based on Foata normal form. 2/6523 useless extension candidates. Maximal degree in co-relation 86446. Up to 1628 conditions per place. [2022-12-13 02:01:52,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 451 places, 2665 transitions, 121017 flow [2022-12-13 02:01:52,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 9908 [2022-12-13 02:01:52,061 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:01:52,063 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4094 [2022-12-13 02:01:52,063 INFO L495 AbstractCegarLoop]: Abstraction has has 451 places, 2665 transitions, 121017 flow [2022-12-13 02:01:52,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:52,063 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:52,063 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:52,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-12-13 02:01:52,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-13 02:01:52,266 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:52,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:52,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1495843032, now seen corresponding path program 2 times [2022-12-13 02:01:52,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:52,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763249954] [2022-12-13 02:01:52,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:52,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:52,299 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-13 02:01:52,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:52,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763249954] [2022-12-13 02:01:52,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763249954] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:01:52,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638949143] [2022-12-13 02:01:52,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:01:52,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:01:52,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:01:52,316 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:01:52,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-13 02:01:52,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:01:52,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:01:52,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:01:52,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:01:52,461 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-13 02:01:52,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:01:52,489 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-13 02:01:52,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638949143] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:01:52,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:01:52,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 02:01:52,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506874228] [2022-12-13 02:01:52,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:01:52,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:01:52,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:52,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:01:52,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:01:52,490 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 02:01:52,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 2665 transitions, 121017 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 02:01:52,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:52,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 02:01:52,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:12,011 INFO L130 PetriNetUnfolder]: 9219/17569 cut-off events. [2022-12-13 02:02:12,011 INFO L131 PetriNetUnfolder]: For 1517669/1517669 co-relation queries the response was YES. [2022-12-13 02:02:12,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270883 conditions, 17569 events. 9219/17569 cut-off events. For 1517669/1517669 co-relation queries the response was YES. Maximal size of possible extension queue 1421. Compared 163437 event pairs, 1722 based on Foata normal form. 134/17701 useless extension candidates. Maximal degree in co-relation 263639. Up to 11797 conditions per place. [2022-12-13 02:02:12,305 INFO L137 encePairwiseOnDemand]: 14/47 looper letters, 1713 selfloop transitions, 1234 changer transitions 21/2968 dead transitions. [2022-12-13 02:02:12,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 2968 transitions, 136707 flow [2022-12-13 02:02:12,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 02:02:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 02:02:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 123 transitions. [2022-12-13 02:02:12,306 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17446808510638298 [2022-12-13 02:02:12,306 INFO L175 Difference]: Start difference. First operand has 451 places, 2665 transitions, 121017 flow. Second operand 15 states and 123 transitions. [2022-12-13 02:02:12,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 2968 transitions, 136707 flow [2022-12-13 02:02:37,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 2968 transitions, 133653 flow, removed 1466 selfloop flow, removed 1 redundant places. [2022-12-13 02:02:38,030 INFO L231 Difference]: Finished difference. Result has 468 places, 2782 transitions, 127555 flow [2022-12-13 02:02:38,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=118036, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=127555, PETRI_PLACES=468, PETRI_TRANSITIONS=2782} [2022-12-13 02:02:38,032 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 448 predicate places. [2022-12-13 02:02:38,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:38,033 INFO L89 Accepts]: Start accepts. Operand has 468 places, 2782 transitions, 127555 flow [2022-12-13 02:02:38,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:38,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:38,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 468 places, 2782 transitions, 127555 flow [2022-12-13 02:02:38,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 467 places, 2782 transitions, 127555 flow [2022-12-13 02:02:41,964 INFO L130 PetriNetUnfolder]: 1979/6791 cut-off events. [2022-12-13 02:02:41,965 INFO L131 PetriNetUnfolder]: For 399742/399808 co-relation queries the response was YES. [2022-12-13 02:02:42,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92751 conditions, 6791 events. 1979/6791 cut-off events. For 399742/399808 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 85024 event pairs, 8 based on Foata normal form. 2/6790 useless extension candidates. Maximal degree in co-relation 90756. Up to 1747 conditions per place. [2022-12-13 02:02:42,346 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 467 places, 2782 transitions, 127555 flow [2022-12-13 02:02:42,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 10394 [2022-12-13 02:02:42,372 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:02:42,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4339 [2022-12-13 02:02:42,372 INFO L495 AbstractCegarLoop]: Abstraction has has 467 places, 2782 transitions, 127555 flow [2022-12-13 02:02:42,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 02:02:42,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:42,373 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:42,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-12-13 02:02:42,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:02:42,573 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1753716746, now seen corresponding path program 3 times [2022-12-13 02:02:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:42,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161975733] [2022-12-13 02:02:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:42,617 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-13 02:02:42,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:42,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161975733] [2022-12-13 02:02:42,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161975733] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:02:42,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881596752] [2022-12-13 02:02:42,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 02:02:42,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:02:42,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:02:42,619 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:02:42,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-13 02:02:42,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 02:02:42,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:02:42,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 02:02:42,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:02:42,734 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-13 02:02:42,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:02:42,753 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-13 02:02:42,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881596752] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:02:42,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:02:42,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 02:02:42,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44148124] [2022-12-13 02:02:42,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:02:42,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:02:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:42,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:02:42,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:02:42,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 02:02:42,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 2782 transitions, 127555 flow. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:42,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:42,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 02:02:42,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:02,357 INFO L130 PetriNetUnfolder]: 9157/17413 cut-off events. [2022-12-13 02:03:02,357 INFO L131 PetriNetUnfolder]: For 1424676/1424676 co-relation queries the response was YES. [2022-12-13 02:03:02,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271989 conditions, 17413 events. 9157/17413 cut-off events. For 1424676/1424676 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 160878 event pairs, 350 based on Foata normal form. 112/17523 useless extension candidates. Maximal degree in co-relation 264593. Up to 5497 conditions per place. [2022-12-13 02:03:02,659 INFO L137 encePairwiseOnDemand]: 12/47 looper letters, 440 selfloop transitions, 2441 changer transitions 5/2886 dead transitions. [2022-12-13 02:03:02,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 2886 transitions, 135674 flow [2022-12-13 02:03:02,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 02:03:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 02:03:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2022-12-13 02:03:02,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18581560283687942 [2022-12-13 02:03:02,660 INFO L175 Difference]: Start difference. First operand has 467 places, 2782 transitions, 127555 flow. Second operand 15 states and 131 transitions. [2022-12-13 02:03:02,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 2886 transitions, 135674 flow [2022-12-13 02:03:29,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 2886 transitions, 133820 flow, removed 295 selfloop flow, removed 7 redundant places. [2022-12-13 02:03:29,304 INFO L231 Difference]: Finished difference. Result has 475 places, 2789 transitions, 133267 flow [2022-12-13 02:03:29,306 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=125548, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2424, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=133267, PETRI_PLACES=475, PETRI_TRANSITIONS=2789} [2022-12-13 02:03:29,306 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 455 predicate places. [2022-12-13 02:03:29,306 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:29,306 INFO L89 Accepts]: Start accepts. Operand has 475 places, 2789 transitions, 133267 flow [2022-12-13 02:03:29,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:29,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:29,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 475 places, 2789 transitions, 133267 flow [2022-12-13 02:03:29,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 475 places, 2789 transitions, 133267 flow [2022-12-13 02:03:33,145 INFO L130 PetriNetUnfolder]: 1973/6756 cut-off events. [2022-12-13 02:03:33,145 INFO L131 PetriNetUnfolder]: For 425588/425654 co-relation queries the response was YES. [2022-12-13 02:03:33,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94859 conditions, 6756 events. 1973/6756 cut-off events. For 425588/425654 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 84508 event pairs, 8 based on Foata normal form. 2/6756 useless extension candidates. Maximal degree in co-relation 92709. Up to 1759 conditions per place. [2022-12-13 02:03:33,485 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 475 places, 2789 transitions, 133267 flow [2022-12-13 02:03:33,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 10428 [2022-12-13 02:03:33,490 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:03:33,490 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4184 [2022-12-13 02:03:33,490 INFO L495 AbstractCegarLoop]: Abstraction has has 475 places, 2789 transitions, 133267 flow [2022-12-13 02:03:33,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:33,490 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:33,491 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:33,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-12-13 02:03:33,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-13 02:03:33,695 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:33,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2143080157, now seen corresponding path program 1 times [2022-12-13 02:03:33,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:33,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094217032] [2022-12-13 02:03:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:33,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:33,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094217032] [2022-12-13 02:03:33,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094217032] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:03:33,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413767294] [2022-12-13 02:03:33,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:33,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:03:33,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:03:33,730 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:03:33,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-13 02:03:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:33,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 02:03:33,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:03:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:33,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:03:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:33,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413767294] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:03:33,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:03:33,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 02:03:33,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132118737] [2022-12-13 02:03:33,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:03:33,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 02:03:33,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:33,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 02:03:33,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-13 02:03:33,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 02:03:33,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 2789 transitions, 133267 flow. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 02:03:33,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:33,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 02:03:33,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:58,983 INFO L130 PetriNetUnfolder]: 10327/19748 cut-off events. [2022-12-13 02:03:58,983 INFO L131 PetriNetUnfolder]: For 1725808/1725808 co-relation queries the response was YES. [2022-12-13 02:03:59,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311110 conditions, 19748 events. 10327/19748 cut-off events. For 1725808/1725808 co-relation queries the response was YES. Maximal size of possible extension queue 1607. Compared 186743 event pairs, 215 based on Foata normal form. 52/19798 useless extension candidates. Maximal degree in co-relation 302353. Up to 6279 conditions per place. [2022-12-13 02:03:59,385 INFO L137 encePairwiseOnDemand]: 11/47 looper letters, 303 selfloop transitions, 3015 changer transitions 39/3357 dead transitions. [2022-12-13 02:03:59,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 3357 transitions, 157848 flow [2022-12-13 02:03:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 02:03:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 02:03:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 227 transitions. [2022-12-13 02:03:59,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.13799392097264437 [2022-12-13 02:03:59,395 INFO L175 Difference]: Start difference. First operand has 475 places, 2789 transitions, 133267 flow. Second operand 35 states and 227 transitions. [2022-12-13 02:03:59,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 3357 transitions, 157848 flow [2022-12-13 02:04:32,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 3357 transitions, 155601 flow, removed 326 selfloop flow, removed 5 redundant places. [2022-12-13 02:04:32,547 INFO L231 Difference]: Finished difference. Result has 516 places, 3173 transitions, 156113 flow [2022-12-13 02:04:32,549 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=131172, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2663, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=156113, PETRI_PLACES=516, PETRI_TRANSITIONS=3173} [2022-12-13 02:04:32,549 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 496 predicate places. [2022-12-13 02:04:32,549 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:32,549 INFO L89 Accepts]: Start accepts. Operand has 516 places, 3173 transitions, 156113 flow [2022-12-13 02:04:32,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:32,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:32,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 516 places, 3173 transitions, 156113 flow [2022-12-13 02:04:32,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 515 places, 3173 transitions, 156113 flow [2022-12-13 02:04:37,165 INFO L130 PetriNetUnfolder]: 2194/7477 cut-off events. [2022-12-13 02:04:37,165 INFO L131 PetriNetUnfolder]: For 497415/497481 co-relation queries the response was YES. [2022-12-13 02:04:37,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110893 conditions, 7477 events. 2194/7477 cut-off events. For 497415/497481 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 94524 event pairs, 4 based on Foata normal form. 2/7471 useless extension candidates. Maximal degree in co-relation 108744. Up to 2009 conditions per place. [2022-12-13 02:04:37,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 515 places, 3173 transitions, 156113 flow [2022-12-13 02:04:37,367 INFO L226 LiptonReduction]: Number of co-enabled transitions 11788 [2022-12-13 02:04:37,372 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:04:37,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4823 [2022-12-13 02:04:37,372 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 3173 transitions, 156113 flow [2022-12-13 02:04:37,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 02:04:37,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:37,373 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:37,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-13 02:04:37,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:04:37,578 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:37,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:37,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1448919552, now seen corresponding path program 1 times [2022-12-13 02:04:37,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:37,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874420063] [2022-12-13 02:04:37,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:37,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:37,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:37,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874420063] [2022-12-13 02:04:37,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874420063] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:04:37,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000636897] [2022-12-13 02:04:37,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:37,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:04:37,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:04:37,629 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:04:37,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-13 02:04:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:37,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 02:04:37,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:04:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:37,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:04:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:37,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000636897] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:04:37,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:04:37,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 02:04:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107423398] [2022-12-13 02:04:37,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:04:37,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 02:04:37,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:37,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 02:04:37,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-12-13 02:04:37,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 02:04:37,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 3173 transitions, 156113 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-13 02:04:37,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:37,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 02:04:37,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:06,286 INFO L130 PetriNetUnfolder]: 10634/20178 cut-off events. [2022-12-13 02:05:06,286 INFO L131 PetriNetUnfolder]: For 2082223/2082223 co-relation queries the response was YES. [2022-12-13 02:05:06,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338336 conditions, 20178 events. 10634/20178 cut-off events. For 2082223/2082223 co-relation queries the response was YES. Maximal size of possible extension queue 1604. Compared 190003 event pairs, 2111 based on Foata normal form. 168/20344 useless extension candidates. Maximal degree in co-relation 332535. Up to 13234 conditions per place. [2022-12-13 02:05:06,874 INFO L137 encePairwiseOnDemand]: 16/47 looper letters, 2310 selfloop transitions, 1289 changer transitions 1/3600 dead transitions. [2022-12-13 02:05:06,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 3600 transitions, 177266 flow [2022-12-13 02:05:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 02:05:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 02:05:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 138 transitions. [2022-12-13 02:05:06,875 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17271589486858574 [2022-12-13 02:05:06,875 INFO L175 Difference]: Start difference. First operand has 515 places, 3173 transitions, 156113 flow. Second operand 17 states and 138 transitions. [2022-12-13 02:05:06,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 3600 transitions, 177266 flow [2022-12-13 02:05:59,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 3600 transitions, 167629 flow, removed 4178 selfloop flow, removed 5 redundant places. [2022-12-13 02:06:00,023 INFO L231 Difference]: Finished difference. Result has 528 places, 3276 transitions, 156864 flow [2022-12-13 02:06:00,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=147794, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1918, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=156864, PETRI_PLACES=528, PETRI_TRANSITIONS=3276} [2022-12-13 02:06:00,025 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 508 predicate places. [2022-12-13 02:06:00,025 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:00,025 INFO L89 Accepts]: Start accepts. Operand has 528 places, 3276 transitions, 156864 flow [2022-12-13 02:06:00,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:00,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:00,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 528 places, 3276 transitions, 156864 flow [2022-12-13 02:06:00,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 528 places, 3276 transitions, 156864 flow [2022-12-13 02:06:04,259 INFO L130 PetriNetUnfolder]: 2274/7750 cut-off events. [2022-12-13 02:06:04,260 INFO L131 PetriNetUnfolder]: For 489820/489886 co-relation queries the response was YES. [2022-12-13 02:06:04,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111372 conditions, 7750 events. 2274/7750 cut-off events. For 489820/489886 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 98357 event pairs, 4 based on Foata normal form. 2/7744 useless extension candidates. Maximal degree in co-relation 109180. Up to 1998 conditions per place. [2022-12-13 02:06:04,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 528 places, 3276 transitions, 156864 flow [2022-12-13 02:06:04,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 12246 [2022-12-13 02:06:04,701 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:06:04,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4677 [2022-12-13 02:06:04,702 INFO L495 AbstractCegarLoop]: Abstraction has has 528 places, 3276 transitions, 156864 flow [2022-12-13 02:06:04,702 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-13 02:06:04,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:04,702 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:04,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-12-13 02:06:04,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:06:04,907 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:04,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1060474652, now seen corresponding path program 2 times [2022-12-13 02:06:04,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:04,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123636082] [2022-12-13 02:06:04,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:04,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:04,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123636082] [2022-12-13 02:06:04,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123636082] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:06:04,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206184075] [2022-12-13 02:06:04,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:06:04,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:06:04,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:06:04,985 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:06:04,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-13 02:06:05,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:06:05,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:06:05,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 02:06:05,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:06:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:05,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:06:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:05,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206184075] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:06:05,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:06:05,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 7 [2022-12-13 02:06:05,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750950697] [2022-12-13 02:06:05,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:06:05,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:06:05,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:05,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:06:05,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:06:05,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 02:06:05,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 3276 transitions, 156864 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:05,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:05,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 02:06:05,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:36,343 INFO L130 PetriNetUnfolder]: 11032/20917 cut-off events. [2022-12-13 02:06:36,344 INFO L131 PetriNetUnfolder]: For 1899099/1899099 co-relation queries the response was YES. [2022-12-13 02:06:36,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342856 conditions, 20917 events. 11032/20917 cut-off events. For 1899099/1899099 co-relation queries the response was YES. Maximal size of possible extension queue 1641. Compared 196887 event pairs, 952 based on Foata normal form. 5/20920 useless extension candidates. Maximal degree in co-relation 336630. Up to 15796 conditions per place. [2022-12-13 02:06:36,779 INFO L137 encePairwiseOnDemand]: 15/47 looper letters, 2682 selfloop transitions, 868 changer transitions 36/3586 dead transitions. [2022-12-13 02:06:36,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 3586 transitions, 175236 flow [2022-12-13 02:06:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:06:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:06:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-12-13 02:06:36,780 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27393617021276595 [2022-12-13 02:06:36,780 INFO L175 Difference]: Start difference. First operand has 528 places, 3276 transitions, 156864 flow. Second operand 8 states and 103 transitions. [2022-12-13 02:06:36,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 3586 transitions, 175236 flow [2022-12-13 02:07:25,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 3586 transitions, 173439 flow, removed 788 selfloop flow, removed 7 redundant places. [2022-12-13 02:07:25,683 INFO L231 Difference]: Finished difference. Result has 534 places, 3394 transitions, 165142 flow [2022-12-13 02:07:25,686 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=155132, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=751, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=165142, PETRI_PLACES=534, PETRI_TRANSITIONS=3394} [2022-12-13 02:07:25,686 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 514 predicate places. [2022-12-13 02:07:25,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:25,686 INFO L89 Accepts]: Start accepts. Operand has 534 places, 3394 transitions, 165142 flow [2022-12-13 02:07:25,722 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:25,722 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:25,723 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 534 places, 3394 transitions, 165142 flow [2022-12-13 02:07:25,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 534 places, 3394 transitions, 165142 flow [2022-12-13 02:07:30,376 INFO L130 PetriNetUnfolder]: 2355/8016 cut-off events. [2022-12-13 02:07:30,376 INFO L131 PetriNetUnfolder]: For 515366/515441 co-relation queries the response was YES. [2022-12-13 02:07:30,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117128 conditions, 8016 events. 2355/8016 cut-off events. For 515366/515441 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 102133 event pairs, 4 based on Foata normal form. 2/8011 useless extension candidates. Maximal degree in co-relation 114929. Up to 1861 conditions per place. [2022-12-13 02:07:30,625 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 534 places, 3394 transitions, 165142 flow [2022-12-13 02:07:30,625 INFO L226 LiptonReduction]: Number of co-enabled transitions 12702 [2022-12-13 02:07:30,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [353] $Ultimate##0-->L41-4: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308| 0)) (< v_thread1Thread1of1ForFork0_~i~0_296 (+ v_~N~0_175 1)) (= 6 v_thread1Thread1of1ForFork0_~i~0_296) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308| (ite (< 0 (+ v_~counter~0_629 2)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_398| 1) (= v_~counter~0_627 (+ v_~counter~0_629 5)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308|)) InVars {~counter~0=v_~counter~0_629, ~N~0=v_~N~0_175} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_308|, ~counter~0=v_~counter~0_627, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_308|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_257|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_251|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_296, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_312|, ~N~0=v_~N~0_175, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_398|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:07:30,628 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:30,628 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:30,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [352] $Ultimate##0-->L41-4: Formula: (and (= v_~counter~0_616 (+ v_~counter~0_618 6)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_302| (ite (< 0 (+ v_~counter~0_618 5)) 1 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_389|) (< v_thread1Thread1of1ForFork0_~i~0_290 (+ v_~N~0_173 1)) (= 9 v_thread1Thread1of1ForFork0_~i~0_290) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_302| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302|) (not (= (ite (< 0 (+ v_~counter~0_618 1)) 1 0) 0))) InVars {~counter~0=v_~counter~0_618, ~N~0=v_~N~0_173} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_302|, ~counter~0=v_~counter~0_616, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_302|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_251|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_245|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_290, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_302|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_306|, ~N~0=v_~N~0_173, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_389|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] and [257] L51-4-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (= (+ v_~counter~0_88 1) v_~counter~0_89) (= (ite (< 0 v_~counter~0_89) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N~0_47) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13| 0))) InVars {~counter~0=v_~counter~0_89, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N~0=v_~N~0_47} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, ~counter~0=v_~counter~0_88, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_17|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N~0=v_~N~0_47} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:07:30,719 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:30,719 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:30,834 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:07:30,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5149 [2022-12-13 02:07:30,835 INFO L495 AbstractCegarLoop]: Abstraction has has 534 places, 3394 transitions, 165219 flow [2022-12-13 02:07:30,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:30,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:30,835 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:30,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-13 02:07:31,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-13 02:07:31,036 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:31,036 INFO L85 PathProgramCache]: Analyzing trace with hash 647942867, now seen corresponding path program 2 times [2022-12-13 02:07:31,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:31,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264280708] [2022-12-13 02:07:31,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:31,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:31,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:31,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264280708] [2022-12-13 02:07:31,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264280708] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:07:31,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398528542] [2022-12-13 02:07:31,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:07:31,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:07:31,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:07:31,121 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:07:31,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-13 02:07:31,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:07:31,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:07:31,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 02:07:31,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:07:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:31,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:07:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:31,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398528542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:07:31,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:07:31,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 02:07:31,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365232120] [2022-12-13 02:07:31,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:07:31,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 02:07:31,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:31,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 02:07:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-12-13 02:07:31,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 02:07:31,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 3394 transitions, 165219 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-13 02:07:31,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:31,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 02:07:31,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:09,279 INFO L130 PetriNetUnfolder]: 12748/23992 cut-off events. [2022-12-13 02:08:09,279 INFO L131 PetriNetUnfolder]: For 2231765/2231765 co-relation queries the response was YES. [2022-12-13 02:08:09,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395276 conditions, 23992 events. 12748/23992 cut-off events. For 2231765/2231765 co-relation queries the response was YES. Maximal size of possible extension queue 1903. Compared 229066 event pairs, 1380 based on Foata normal form. 346/24338 useless extension candidates. Maximal degree in co-relation 388180. Up to 9901 conditions per place. [2022-12-13 02:08:09,830 INFO L137 encePairwiseOnDemand]: 14/49 looper letters, 1310 selfloop transitions, 2855 changer transitions 68/4233 dead transitions. [2022-12-13 02:08:09,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 4233 transitions, 205527 flow [2022-12-13 02:08:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 02:08:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 02:08:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 157 transitions. [2022-12-13 02:08:09,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16020408163265307 [2022-12-13 02:08:09,831 INFO L175 Difference]: Start difference. First operand has 534 places, 3394 transitions, 165219 flow. Second operand 20 states and 157 transitions. [2022-12-13 02:08:09,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 4233 transitions, 205527 flow [2022-12-13 02:09:12,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 4233 transitions, 204232 flow, removed 395 selfloop flow, removed 2 redundant places. [2022-12-13 02:09:12,870 INFO L231 Difference]: Finished difference. Result has 562 places, 3961 transitions, 198603 flow [2022-12-13 02:09:12,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=164035, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2336, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=893, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=198603, PETRI_PLACES=562, PETRI_TRANSITIONS=3961} [2022-12-13 02:09:12,873 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 542 predicate places. [2022-12-13 02:09:12,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:12,873 INFO L89 Accepts]: Start accepts. Operand has 562 places, 3961 transitions, 198603 flow [2022-12-13 02:09:12,943 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:12,943 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:12,943 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 562 places, 3961 transitions, 198603 flow [2022-12-13 02:09:13,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 562 places, 3961 transitions, 198603 flow [2022-12-13 02:09:18,995 INFO L130 PetriNetUnfolder]: 2719/9164 cut-off events. [2022-12-13 02:09:18,995 INFO L131 PetriNetUnfolder]: For 631056/631131 co-relation queries the response was YES. [2022-12-13 02:09:19,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140141 conditions, 9164 events. 2719/9164 cut-off events. For 631056/631131 co-relation queries the response was YES. Maximal size of possible extension queue 1276. Compared 118911 event pairs, 5 based on Foata normal form. 2/9157 useless extension candidates. Maximal degree in co-relation 137935. Up to 2195 conditions per place. [2022-12-13 02:09:19,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 562 places, 3961 transitions, 198603 flow [2022-12-13 02:09:19,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 14720 [2022-12-13 02:09:19,281 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:19,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6408 [2022-12-13 02:09:19,281 INFO L495 AbstractCegarLoop]: Abstraction has has 562 places, 3961 transitions, 198603 flow [2022-12-13 02:09:19,281 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-13 02:09:19,282 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:19,282 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:19,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-12-13 02:09:19,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-13 02:09:19,491 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:09:19,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:19,491 INFO L85 PathProgramCache]: Analyzing trace with hash 800806349, now seen corresponding path program 1 times [2022-12-13 02:09:19,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:19,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727613563] [2022-12-13 02:09:19,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:19,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:19,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:19,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727613563] [2022-12-13 02:09:19,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727613563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:19,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574602595] [2022-12-13 02:09:19,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:19,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:19,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:19,532 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:09:19,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-13 02:09:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:19,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:09:19,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:19,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:19,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574602595] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:19,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:19,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 02:09:19,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167585949] [2022-12-13 02:09:19,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:19,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 02:09:19,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:19,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 02:09:19,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-12-13 02:09:19,677 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 02:09:19,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 3961 transitions, 198603 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-13 02:09:19,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:19,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 02:09:19,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:03,619 INFO L130 PetriNetUnfolder]: 13222/24920 cut-off events. [2022-12-13 02:10:03,619 INFO L131 PetriNetUnfolder]: For 2533854/2533854 co-relation queries the response was YES. [2022-12-13 02:10:04,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430830 conditions, 24920 events. 13222/24920 cut-off events. For 2533854/2533854 co-relation queries the response was YES. Maximal size of possible extension queue 1943. Compared 239715 event pairs, 2382 based on Foata normal form. 62/24982 useless extension candidates. Maximal degree in co-relation 423026. Up to 15369 conditions per place. [2022-12-13 02:10:04,230 INFO L137 encePairwiseOnDemand]: 16/49 looper letters, 2770 selfloop transitions, 1726 changer transitions 1/4497 dead transitions. [2022-12-13 02:10:04,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 4497 transitions, 226655 flow [2022-12-13 02:10:04,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 02:10:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 02:10:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-12-13 02:10:04,231 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18524332810047095 [2022-12-13 02:10:04,231 INFO L175 Difference]: Start difference. First operand has 562 places, 3961 transitions, 198603 flow. Second operand 13 states and 118 transitions. [2022-12-13 02:10:04,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 4497 transitions, 226655 flow [2022-12-13 02:11:17,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 4497 transitions, 222355 flow, removed 1811 selfloop flow, removed 6 redundant places. [2022-12-13 02:11:17,842 INFO L231 Difference]: Finished difference. Result has 569 places, 4134 transitions, 207732 flow [2022-12-13 02:11:17,844 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=194829, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1553, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=207732, PETRI_PLACES=569, PETRI_TRANSITIONS=4134} [2022-12-13 02:11:17,845 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 549 predicate places. [2022-12-13 02:11:17,845 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:17,845 INFO L89 Accepts]: Start accepts. Operand has 569 places, 4134 transitions, 207732 flow [2022-12-13 02:11:17,912 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:17,912 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:17,912 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 569 places, 4134 transitions, 207732 flow [2022-12-13 02:11:17,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 569 places, 4134 transitions, 207732 flow [2022-12-13 02:11:26,004 INFO L130 PetriNetUnfolder]: 2857/9615 cut-off events. [2022-12-13 02:11:26,005 INFO L131 PetriNetUnfolder]: For 667592/667667 co-relation queries the response was YES. [2022-12-13 02:11:26,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146691 conditions, 9615 events. 2857/9615 cut-off events. For 667592/667667 co-relation queries the response was YES. Maximal size of possible extension queue 1323. Compared 125641 event pairs, 5 based on Foata normal form. 2/9608 useless extension candidates. Maximal degree in co-relation 144493. Up to 2319 conditions per place. [2022-12-13 02:11:26,321 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 569 places, 4134 transitions, 207732 flow [2022-12-13 02:11:26,321 INFO L226 LiptonReduction]: Number of co-enabled transitions 15482 [2022-12-13 02:11:26,324 WARN L322 ript$VariableManager]: TermVariable LBE110 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:11:26,325 WARN L322 ript$VariableManager]: TermVariable LBE38 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:11:26,447 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:11:26,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8602 [2022-12-13 02:11:26,447 INFO L495 AbstractCegarLoop]: Abstraction has has 569 places, 4134 transitions, 207772 flow [2022-12-13 02:11:26,447 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-13 02:11:26,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:26,447 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:26,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-13 02:11:26,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-12-13 02:11:26,652 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:11:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1167972397, now seen corresponding path program 1 times [2022-12-13 02:11:26,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:26,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465607749] [2022-12-13 02:11:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:26,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:26,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465607749] [2022-12-13 02:11:26,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465607749] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:11:26,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296145440] [2022-12-13 02:11:26,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:26,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:11:26,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:11:26,721 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:11:26,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-13 02:11:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:26,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 02:11:26,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:11:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:26,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:11:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:26,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296145440] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:11:26,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:11:26,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-12-13 02:11:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663419173] [2022-12-13 02:11:26,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:11:26,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 02:11:26,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 02:11:26,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 02:11:26,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 02:11:26,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 4134 transitions, 207772 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-13 02:11:26,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:26,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 02:11:26,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 02:11:36,109 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:11:36,109 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:11:36,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:11:36,130 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 02:11:36,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-13 02:11:36,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:11:36,334 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (7states, 0/50 universal loopers) in iteration 62,while PetriNetUnfolder was constructing finite prefix that currently has 81876 conditions, 4797 events (2475/4796 cut-off events. For 573863/573863 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 45793 event pairs, 117 based on Foata normal form. 4/6343 useless extension candidates. Maximal degree in co-relation 81328. Up to 2272 conditions per place.). [2022-12-13 02:11:36,336 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 02:11:36,336 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 02:11:36,336 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:36,338 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:11:36,338 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:11:36,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:11:36 BasicIcfg [2022-12-13 02:11:36,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:11:36,342 INFO L158 Benchmark]: Toolchain (without parser) took 842845.86ms. Allocated memory was 209.7MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 185.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2022-12-13 02:11:36,342 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 209.7MB. Free memory was 185.8MB in the beginning and 185.7MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:11:36,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.84ms. Allocated memory is still 209.7MB. Free memory was 185.4MB in the beginning and 173.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 02:11:36,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.44ms. Allocated memory is still 209.7MB. Free memory was 173.8MB in the beginning and 172.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 02:11:36,342 INFO L158 Benchmark]: Boogie Preprocessor took 25.88ms. Allocated memory is still 209.7MB. Free memory was 172.3MB in the beginning and 171.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 02:11:36,343 INFO L158 Benchmark]: RCFGBuilder took 292.18ms. Allocated memory is still 209.7MB. Free memory was 171.2MB in the beginning and 157.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 02:11:36,346 INFO L158 Benchmark]: TraceAbstraction took 842356.87ms. Allocated memory was 209.7MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 156.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-12-13 02:11:36,348 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.39ms. Allocated memory is still 209.7MB. Free memory was 185.8MB in the beginning and 185.7MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 140.84ms. Allocated memory is still 209.7MB. Free memory was 185.4MB in the beginning and 173.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.44ms. Allocated memory is still 209.7MB. Free memory was 173.8MB in the beginning and 172.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.88ms. Allocated memory is still 209.7MB. Free memory was 172.3MB in the beginning and 171.2MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 292.18ms. Allocated memory is still 209.7MB. Free memory was 171.2MB in the beginning and 157.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 842356.87ms. Allocated memory was 209.7MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 156.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 64 PlacesBefore, 20 PlacesAfterwards, 62 TransitionsBefore, 15 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 25 TrivialYvCompositions, 19 ConcurrentYvCompositions, 3 ChoiceCompositions, 47 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 249, independent: 247, independent conditional: 247, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 249, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 249, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 249, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 249, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 249, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 249, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 249, unknown conditional: 0, unknown unconditional: 249] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 388, Positive conditional cache size: 0, Positive unconditional cache size: 388, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 19 PlacesBefore, 19 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 60 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.1s, 24 PlacesBefore, 23 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 58 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): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, 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, 24 PlacesBefore, 22 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 1, Positive unconditional cache size: 10, 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, 23 PlacesBefore, 23 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 72 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): 11, Positive cache size: 11, Positive conditional cache size: 1, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 5, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 13, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 130 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): 24, Positive cache size: 24, Positive conditional cache size: 13, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 43 PlacesBefore, 43 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 11, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 32, Positive conditional cache size: 21, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 49 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 42 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 39, Positive conditional cache size: 28, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 49 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 40, Positive conditional cache size: 28, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 54 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 43, Positive conditional cache size: 31, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 59 PlacesBefore, 58 PlacesAfterwards, 58 TransitionsBefore, 57 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 35, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 73 PlacesBefore, 71 PlacesAfterwards, 73 TransitionsBefore, 71 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 52, Positive conditional cache size: 39, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 78 PlacesBefore, 78 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 53, Positive conditional cache size: 40, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 144 TransitionsBefore, 144 TransitionsAfterwards, 446 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): 53, Positive cache size: 53, Positive conditional cache size: 40, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 143 TransitionsBefore, 143 TransitionsAfterwards, 440 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): 53, Positive cache size: 53, Positive conditional cache size: 40, Positive unconditional cache size: 13, 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, 91 PlacesBefore, 91 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 460 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): 53, Positive cache size: 53, Positive conditional cache size: 40, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 98 PlacesBefore, 98 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 54, Positive conditional cache size: 41, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 177 TransitionsBefore, 177 TransitionsAfterwards, 592 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): 54, Positive cache size: 54, Positive conditional cache size: 41, Positive unconditional cache size: 13, 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, 106 PlacesBefore, 106 PlacesAfterwards, 179 TransitionsBefore, 179 TransitionsAfterwards, 612 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): 54, Positive cache size: 54, Positive conditional cache size: 41, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 108 PlacesBefore, 108 PlacesAfterwards, 195 TransitionsBefore, 195 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 55, Positive conditional cache size: 42, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 124 PlacesBefore, 124 PlacesAfterwards, 240 TransitionsBefore, 240 TransitionsAfterwards, 798 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): 55, Positive cache size: 55, Positive conditional cache size: 42, Positive unconditional cache size: 13, 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.7s, 133 PlacesBefore, 133 PlacesAfterwards, 242 TransitionsBefore, 242 TransitionsAfterwards, 806 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 58, Positive conditional cache size: 45, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 135 PlacesBefore, 135 PlacesAfterwards, 252 TransitionsBefore, 252 TransitionsAfterwards, 838 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): 58, Positive cache size: 58, Positive conditional cache size: 45, Positive unconditional cache size: 13, 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, 141 PlacesBefore, 141 PlacesAfterwards, 284 TransitionsBefore, 284 TransitionsAfterwards, 978 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): 58, Positive cache size: 58, Positive conditional cache size: 45, Positive unconditional cache size: 13, 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, 146 PlacesBefore, 146 PlacesAfterwards, 286 TransitionsBefore, 286 TransitionsAfterwards, 990 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): 58, Positive cache size: 58, Positive conditional cache size: 45, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 156 PlacesBefore, 155 PlacesAfterwards, 311 TransitionsBefore, 310 TransitionsAfterwards, 1096 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 60, Positive conditional cache size: 47, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 158 PlacesBefore, 158 PlacesAfterwards, 310 TransitionsBefore, 310 TransitionsAfterwards, 1094 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): 60, Positive cache size: 60, Positive conditional cache size: 47, Positive unconditional cache size: 13, 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, 166 PlacesBefore, 166 PlacesAfterwards, 326 TransitionsBefore, 326 TransitionsAfterwards, 1170 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): 60, Positive cache size: 60, Positive conditional cache size: 47, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 172 PlacesBefore, 172 PlacesAfterwards, 328 TransitionsBefore, 328 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 61, Positive conditional cache size: 48, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 189 PlacesBefore, 189 PlacesAfterwards, 460 TransitionsBefore, 460 TransitionsAfterwards, 1718 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): 61, Positive cache size: 61, Positive conditional cache size: 48, Positive unconditional cache size: 13, 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.4s, 200 PlacesBefore, 201 PlacesAfterwards, 484 TransitionsBefore, 484 TransitionsAfterwards, 1830 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 66, Positive conditional cache size: 53, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 204 PlacesBefore, 204 PlacesAfterwards, 505 TransitionsBefore, 505 TransitionsAfterwards, 1932 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): 66, Positive cache size: 66, Positive conditional cache size: 53, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 209 PlacesBefore, 209 PlacesAfterwards, 520 TransitionsBefore, 520 TransitionsAfterwards, 2014 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 67, Positive conditional cache size: 54, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 217 PlacesBefore, 217 PlacesAfterwards, 534 TransitionsBefore, 534 TransitionsAfterwards, 2058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 68, Positive conditional cache size: 55, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 229 PlacesBefore, 229 PlacesAfterwards, 562 TransitionsBefore, 562 TransitionsAfterwards, 2186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 69, Positive conditional cache size: 56, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 234 PlacesBefore, 234 PlacesAfterwards, 585 TransitionsBefore, 585 TransitionsAfterwards, 2296 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): 69, Positive cache size: 69, Positive conditional cache size: 56, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 249 PlacesBefore, 248 PlacesAfterwards, 614 TransitionsBefore, 613 TransitionsAfterwards, 2386 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 71, Positive conditional cache size: 58, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 269 PlacesBefore, 269 PlacesAfterwards, 676 TransitionsBefore, 676 TransitionsAfterwards, 2634 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 72, Positive conditional cache size: 59, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 299 PlacesBefore, 298 PlacesAfterwards, 901 TransitionsBefore, 900 TransitionsAfterwards, 3356 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 75, Positive conditional cache size: 62, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 299 PlacesBefore, 299 PlacesAfterwards, 905 TransitionsBefore, 905 TransitionsAfterwards, 3360 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): 75, Positive cache size: 75, Positive conditional cache size: 62, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 303 PlacesBefore, 302 PlacesAfterwards, 1039 TransitionsBefore, 1038 TransitionsAfterwards, 3808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 77, Positive conditional cache size: 64, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 316 PlacesBefore, 316 PlacesAfterwards, 1178 TransitionsBefore, 1178 TransitionsAfterwards, 4250 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 78, Positive conditional cache size: 65, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 330 PlacesBefore, 330 PlacesAfterwards, 1261 TransitionsBefore, 1261 TransitionsAfterwards, 4608 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 79, Positive conditional cache size: 66, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 334 PlacesBefore, 334 PlacesAfterwards, 1267 TransitionsBefore, 1267 TransitionsAfterwards, 4624 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): 79, Positive cache size: 79, Positive conditional cache size: 66, Positive unconditional cache size: 13, 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, 342 PlacesBefore, 342 PlacesAfterwards, 1297 TransitionsBefore, 1297 TransitionsAfterwards, 4724 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): 79, Positive cache size: 79, Positive conditional cache size: 66, Positive unconditional cache size: 13, 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, 353 PlacesBefore, 353 PlacesAfterwards, 1396 TransitionsBefore, 1396 TransitionsAfterwards, 5058 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): 79, Positive cache size: 79, Positive conditional cache size: 66, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 357 PlacesBefore, 357 PlacesAfterwards, 1794 TransitionsBefore, 1794 TransitionsAfterwards, 6662 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 80, Positive conditional cache size: 67, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 373 PlacesBefore, 373 PlacesAfterwards, 2165 TransitionsBefore, 2165 TransitionsAfterwards, 8076 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): 80, Positive cache size: 80, Positive conditional cache size: 67, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 391 PlacesBefore, 391 PlacesAfterwards, 2270 TransitionsBefore, 2270 TransitionsAfterwards, 8550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 81, Positive conditional cache size: 68, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 413 PlacesBefore, 412 PlacesAfterwards, 2386 TransitionsBefore, 2385 TransitionsAfterwards, 8970 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 422 PlacesBefore, 422 PlacesAfterwards, 2408 TransitionsBefore, 2408 TransitionsAfterwards, 9074 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): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, 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, 451 PlacesBefore, 451 PlacesAfterwards, 2665 TransitionsBefore, 2665 TransitionsAfterwards, 9908 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): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, 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, 467 PlacesBefore, 467 PlacesAfterwards, 2782 TransitionsBefore, 2782 TransitionsAfterwards, 10394 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): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, 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, 475 PlacesBefore, 475 PlacesAfterwards, 2789 TransitionsBefore, 2789 TransitionsAfterwards, 10428 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): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, 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, 515 PlacesBefore, 515 PlacesAfterwards, 3173 TransitionsBefore, 3173 TransitionsAfterwards, 11788 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): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, 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, 528 PlacesBefore, 528 PlacesAfterwards, 3276 TransitionsBefore, 3276 TransitionsAfterwards, 12246 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): 83, Positive cache size: 83, Positive conditional cache size: 70, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 534 PlacesBefore, 534 PlacesAfterwards, 3394 TransitionsBefore, 3394 TransitionsAfterwards, 12702 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 85, Positive conditional cache size: 72, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 562 PlacesBefore, 562 PlacesAfterwards, 3961 TransitionsBefore, 3961 TransitionsAfterwards, 14720 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): 85, Positive cache size: 85, Positive conditional cache size: 72, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 569 PlacesBefore, 569 PlacesAfterwards, 4134 TransitionsBefore, 4134 TransitionsAfterwards, 15482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 86, Positive conditional cache size: 73, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (7states, 0/50 universal loopers) in iteration 62,while PetriNetUnfolder was constructing finite prefix that currently has 81876 conditions, 4797 events (2475/4796 cut-off events. For 573863/573863 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 45793 event pairs, 117 based on Foata normal form. 4/6343 useless extension candidates. Maximal degree in co-relation 81328. Up to 2272 conditions per place.). - TimeoutResultAtElement [Line: 68]: 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 (7states, 0/50 universal loopers) in iteration 62,while PetriNetUnfolder was constructing finite prefix that currently has 81876 conditions, 4797 events (2475/4796 cut-off events. For 573863/573863 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 45793 event pairs, 117 based on Foata normal form. 4/6343 useless extension candidates. Maximal degree in co-relation 81328. Up to 2272 conditions per place.). - TimeoutResultAtElement [Line: 67]: 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 (7states, 0/50 universal loopers) in iteration 62,while PetriNetUnfolder was constructing finite prefix that currently has 81876 conditions, 4797 events (2475/4796 cut-off events. For 573863/573863 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 45793 event pairs, 117 based on Foata normal form. 4/6343 useless extension candidates. Maximal degree in co-relation 81328. Up to 2272 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 88 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: 842.3s, OverallIterations: 62, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 750.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2964 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2964 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 2421 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15553 IncrementalHoareTripleChecker+Invalid, 17974 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2421 mSolverCounterUnsat, 6 mSDtfsCounter, 15553 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2033 GetRequests, 1228 SyntacticMatches, 150 SemanticMatches, 655 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207772occurred in iteration=61, InterpolantAutomatonStates: 618, 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.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1607 NumberOfCodeBlocks, 1607 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 2175 ConstructedInterpolants, 0 QuantifiedInterpolants, 6836 SizeOfPredicates, 101 NumberOfNonLiveVariables, 7007 ConjunctsInSsa, 419 ConjunctsInUnsatCore, 164 InterpolantComputations, 11 PerfectInterpolantSequences, 35/543 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