/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/pthread/fib_unsafe-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:38:30,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:38:30,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:38:30,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:38:30,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:38:30,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:38:30,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:38:30,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:38:30,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:38:30,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:38:30,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:38:30,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:38:30,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:38:30,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:38:30,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:38:30,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:38:30,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:38:30,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:38:30,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:38:30,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:38:30,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:38:30,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:38:30,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:38:30,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:38:30,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:38:30,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:38:30,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:38:30,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:38:30,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:38:30,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:38:30,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:38:30,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:38:30,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:38:30,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:38:30,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:38:30,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:38:30,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:38:30,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:38:30,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:38:30,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:38:30,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:38:30,864 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-05 22:38:30,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:38:30,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:38:30,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:38:30,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:38:30,891 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:38:30,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:38:30,892 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:38:30,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:38:30,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:38:30,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:38:30,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:38:30,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:38:30,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:38:30,892 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:38:30,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:38:30,893 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:38:30,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:38:30,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:38:30,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:38:30,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:38:30,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:38:30,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:38:30,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:38:30,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:38:30,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:38:30,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:38:30,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:38:30,894 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:38:30,895 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-05 22:38:31,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:38:31,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:38:31,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:38:31,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:38:31,222 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:38:31,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-10.i [2022-12-05 22:38:32,335 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:38:32,605 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:38:32,606 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i [2022-12-05 22:38:32,617 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6a5dde2/35f73f8e18bf4c5994ad993b71f67302/FLAG1f73c3065 [2022-12-05 22:38:32,634 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6a5dde2/35f73f8e18bf4c5994ad993b71f67302 [2022-12-05 22:38:32,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:38:32,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:38:32,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:38:32,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:38:32,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:38:32,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2066f1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:32, skipping insertion in model container [2022-12-05 22:38:32,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:38:32" (1/1) ... [2022-12-05 22:38:32,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:38:32,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:38:32,904 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i[30243,30256] [2022-12-05 22:38:32,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:38:32,935 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:38:32,986 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i[30243,30256] [2022-12-05 22:38:32,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:32,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:32,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:33,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:33,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:33,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:38:33,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:38:33,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:38:33,039 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:38:33,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33 WrapperNode [2022-12-05 22:38:33,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:38:33,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:38:33,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:38:33,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:38:33,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33" (1/1) ... [2022-12-05 22:38:33,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33" (1/1) ... [2022-12-05 22:38:33,099 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-12-05 22:38:33,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:38:33,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:38:33,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:38:33,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:38:33,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33" (1/1) ... [2022-12-05 22:38:33,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33" (1/1) ... [2022-12-05 22:38:33,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33" (1/1) ... [2022-12-05 22:38:33,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33" (1/1) ... [2022-12-05 22:38:33,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33" (1/1) ... [2022-12-05 22:38:33,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33" (1/1) ... [2022-12-05 22:38:33,123 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33" (1/1) ... [2022-12-05 22:38:33,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33" (1/1) ... [2022-12-05 22:38:33,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:38:33,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:38:33,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:38:33,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:38:33,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33" (1/1) ... [2022-12-05 22:38:33,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:38:33,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:33,154 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-05 22:38:33,161 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-05 22:38:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-05 22:38:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-05 22:38:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-05 22:38:33,188 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-05 22:38:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:38:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:38:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:38:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:38:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:38:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:38:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:38:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:38:33,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:38:33,190 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:38:33,348 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:38:33,350 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:38:33,582 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:38:33,588 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:38:33,588 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-05 22:38:33,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:38:33 BoogieIcfgContainer [2022-12-05 22:38:33,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:38:33,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:38:33,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:38:33,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:38:33,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:38:32" (1/3) ... [2022-12-05 22:38:33,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59586797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:38:33, skipping insertion in model container [2022-12-05 22:38:33,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:38:33" (2/3) ... [2022-12-05 22:38:33,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59586797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:38:33, skipping insertion in model container [2022-12-05 22:38:33,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:38:33" (3/3) ... [2022-12-05 22:38:33,606 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-10.i [2022-12-05 22:38:33,623 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:38:33,623 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 22:38:33,623 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:38:33,698 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:38:33,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 93 transitions, 196 flow [2022-12-05 22:38:33,796 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-05 22:38:33,797 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:33,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-05 22:38:33,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 93 transitions, 196 flow [2022-12-05 22:38:33,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:33,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,848 INFO L130 PetriNetUnfolder]: 7/91 cut-off events. [2022-12-05 22:38:33,848 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:33,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 7/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-05 22:38:33,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 91 transitions, 188 flow [2022-12-05 22:38:33,853 INFO L188 LiptonReduction]: Number of co-enabled transitions 1914 [2022-12-05 22:38:37,295 INFO L203 LiptonReduction]: Total number of compositions: 77 [2022-12-05 22:38:37,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:38:37,314 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;@f537699, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:38:37,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 22:38:37,317 INFO L130 PetriNetUnfolder]: 3/12 cut-off events. [2022-12-05 22:38:37,317 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:37,317 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:37,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 22:38:37,318 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-05 22:38:37,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:37,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1750465324, now seen corresponding path program 1 times [2022-12-05 22:38:37,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:37,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818531070] [2022-12-05 22:38:37,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,559 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-05 22:38:37,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:37,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818531070] [2022-12-05 22:38:37,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818531070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:37,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:38:37,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:38:37,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202899689] [2022-12-05 22:38:37,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:37,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:38:37,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:37,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:38:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:38:37,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:37,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 34 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:37,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:37,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:37,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:37,662 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-05 22:38:37,663 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 22:38:37,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 149 events. 97/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 331 event pairs, 20 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 300. Up to 91 conditions per place. [2022-12-05 22:38:37,665 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 18 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2022-12-05 22:38:37,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 21 transitions, 90 flow [2022-12-05 22:38:37,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:38:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:38:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-05 22:38:37,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-05 22:38:37,681 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 34 flow. Second operand 3 states and 23 transitions. [2022-12-05 22:38:37,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 21 transitions, 90 flow [2022-12-05 22:38:37,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:38:37,686 INFO L231 Difference]: Finished difference. Result has 19 places, 14 transitions, 42 flow [2022-12-05 22:38:37,688 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=19, PETRI_TRANSITIONS=14} [2022-12-05 22:38:37,693 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-05 22:38:37,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:37,694 INFO L89 Accepts]: Start accepts. Operand has 19 places, 14 transitions, 42 flow [2022-12-05 22:38:37,696 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:37,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:37,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 42 flow [2022-12-05 22:38:37,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 14 transitions, 42 flow [2022-12-05 22:38:37,704 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-05 22:38:37,704 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:38:37,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 14 events. 3/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 18. Up to 4 conditions per place. [2022-12-05 22:38:37,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 14 transitions, 42 flow [2022-12-05 22:38:37,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-05 22:38:37,706 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:37,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-05 22:38:37,715 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 14 transitions, 42 flow [2022-12-05 22:38:37,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:37,720 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:37,720 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:37,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:38:37,723 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-05 22:38:37,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:37,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1570150653, now seen corresponding path program 1 times [2022-12-05 22:38:37,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:37,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443185856] [2022-12-05 22:38:37,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,808 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-05 22:38:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:37,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443185856] [2022-12-05 22:38:37,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443185856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:37,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755001418] [2022-12-05 22:38:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:37,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:37,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:37,812 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-05 22:38:37,854 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-05 22:38:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:37,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:37,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:37,945 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-05 22:38:37,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:37,959 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-05 22:38:37,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755001418] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:37,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:37,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:37,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840943493] [2022-12-05 22:38:37,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:37,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:37,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:37,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:37,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:37,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 22:38:37,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 42 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:37,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:37,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 22:38:37,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:38,059 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-05 22:38:38,060 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:38,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 203 events. 133/203 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-05 22:38:38,062 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-05 22:38:38,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 41 transitions, 184 flow [2022-12-05 22:38:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:38:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:38:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 22:38:38,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-05 22:38:38,063 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 42 flow. Second operand 6 states and 44 transitions. [2022-12-05 22:38:38,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 41 transitions, 184 flow [2022-12-05 22:38:38,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:38:38,065 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:38,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 22:38:38,065 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:38:38,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:38,066 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:38,066 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:38,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:38,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:38,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:38,070 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-05 22:38:38,070 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 22:38:38,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-05 22:38:38,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:38,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 22:38:38,342 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:38,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 277 [2022-12-05 22:38:38,344 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-05 22:38:38,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:38,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:38,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:38,355 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-05 22:38:38,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:38,552 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-05 22:38:38,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:38,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149351, now seen corresponding path program 1 times [2022-12-05 22:38:38,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:38,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251719866] [2022-12-05 22:38:38,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,627 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-05 22:38:38,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:38,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251719866] [2022-12-05 22:38:38,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251719866] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:38,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021251546] [2022-12-05 22:38:38,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:38,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:38,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:38,629 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-05 22:38:38,631 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-05 22:38:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:38,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:38,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:38,711 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-05 22:38:38,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:38,721 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-05 22:38:38,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021251546] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:38,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:38,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:38,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170809305] [2022-12-05 22:38:38,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:38,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:38,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:38,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:38,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:38,723 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:38,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:38,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:38,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:38,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:38,814 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-05 22:38:38,814 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-05 22:38:38,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 203 events. 133/203 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 27/186 useless extension candidates. Maximal degree in co-relation 561. Up to 64 conditions per place. [2022-12-05 22:38:38,817 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-05 22:38:38,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:38:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:38:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 22:38:38,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-05 22:38:38,819 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-05 22:38:38,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:38,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-05 22:38:38,821 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:38,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 22:38:38,822 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:38:38,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:38,822 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:38,823 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:38,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:38,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:38,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:38,826 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-05 22:38:38,826 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 22:38:38,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-05 22:38:38,827 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:38,827 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 22:38:39,046 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:39,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-05 22:38:39,047 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-05 22:38:39,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:39,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:39,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:39,055 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-05 22:38:39,248 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,SelfDestructingSolverStorable2 [2022-12-05 22:38:39,249 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-05 22:38:39,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:39,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149258, now seen corresponding path program 1 times [2022-12-05 22:38:39,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:39,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215841478] [2022-12-05 22:38:39,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:39,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-05 22:38:39,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:39,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215841478] [2022-12-05 22:38:39,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215841478] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:39,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647001440] [2022-12-05 22:38:39,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:39,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:39,299 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-05 22:38:39,301 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-05 22:38:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:39,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:39,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:39,427 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-05 22:38:39,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:39,438 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-05 22:38:39,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647001440] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:39,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:39,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:39,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615262894] [2022-12-05 22:38:39,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:39,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:39,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:39,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:39,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:39,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:39,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:39,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:39,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:39,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:39,516 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-05 22:38:39,516 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-05 22:38:39,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 203 events. 133/203 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 27/186 useless extension candidates. Maximal degree in co-relation 561. Up to 64 conditions per place. [2022-12-05 22:38:39,520 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-05 22:38:39,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:38:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:38:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 22:38:39,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-05 22:38:39,524 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-05 22:38:39,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:39,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-05 22:38:39,528 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:39,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 22:38:39,532 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:38:39,532 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:39,532 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:39,534 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:39,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:39,534 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:39,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:39,539 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-05 22:38:39,539 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 22:38:39,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-05 22:38:39,540 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:39,540 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 22:38:39,749 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:39,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-05 22:38:39,750 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-05 22:38:39,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:39,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:39,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:39,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-05 22:38:39,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:39,956 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-05 22:38:39,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149165, now seen corresponding path program 1 times [2022-12-05 22:38:39,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:39,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646809203] [2022-12-05 22:38:39,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:39,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:40,019 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-05 22:38:40,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:40,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646809203] [2022-12-05 22:38:40,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646809203] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:40,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679620692] [2022-12-05 22:38:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:40,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:40,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:40,021 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-05 22:38:40,046 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-05 22:38:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:40,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:40,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:40,102 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-05 22:38:40,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:40,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-05 22:38:40,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679620692] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:40,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:40,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330755998] [2022-12-05 22:38:40,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:40,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:40,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:40,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:40,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:40,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:40,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:40,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:40,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:40,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:40,183 INFO L130 PetriNetUnfolder]: 133/203 cut-off events. [2022-12-05 22:38:40,183 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-05 22:38:40,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 203 events. 133/203 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 20 based on Foata normal form. 27/186 useless extension candidates. Maximal degree in co-relation 561. Up to 64 conditions per place. [2022-12-05 22:38:40,185 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2022-12-05 22:38:40,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:40,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:38:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:38:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 22:38:40,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-05 22:38:40,187 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 6 states and 44 transitions. [2022-12-05 22:38:40,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 206 flow [2022-12-05 22:38:40,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-05 22:38:40,189 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:40,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 22:38:40,191 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-05 22:38:40,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:40,192 INFO L89 Accepts]: Start accepts. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:40,193 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:40,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:40,193 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:40,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:40,197 INFO L130 PetriNetUnfolder]: 3/17 cut-off events. [2022-12-05 22:38:40,197 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 22:38:40,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 17 events. 3/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 34. Up to 7 conditions per place. [2022-12-05 22:38:40,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 76 flow [2022-12-05 22:38:40,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-05 22:38:40,415 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:40,416 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-05 22:38:40,416 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 58 flow [2022-12-05 22:38:40,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:40,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:40,416 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:40,425 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-05 22:38:40,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:40,617 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-05 22:38:40,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:40,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149072, now seen corresponding path program 1 times [2022-12-05 22:38:40,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:40,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132133385] [2022-12-05 22:38:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:40,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:40,663 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-05 22:38:40,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:40,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132133385] [2022-12-05 22:38:40,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132133385] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:40,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667011058] [2022-12-05 22:38:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:40,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:40,666 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-05 22:38:40,668 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-05 22:38:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:40,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:40,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:40,735 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-05 22:38:40,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:40,746 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-05 22:38:40,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667011058] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:40,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:40,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:40,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087514780] [2022-12-05 22:38:40,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:40,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:40,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:40,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:40,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:40,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:40,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 58 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:40,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:40,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:40,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:40,803 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-05 22:38:40,803 INFO L131 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2022-12-05 22:38:40,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 176 events. 115/176 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 489. Up to 64 conditions per place. [2022-12-05 22:38:40,805 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 22:38:40,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 174 flow [2022-12-05 22:38:40,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:38:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:38:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 22:38:40,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 22:38:40,806 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 58 flow. Second operand 5 states and 36 transitions. [2022-12-05 22:38:40,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 174 flow [2022-12-05 22:38:40,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-05 22:38:40,807 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:40,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-05 22:38:40,808 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-05 22:38:40,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:40,808 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:40,809 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:40,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:40,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:40,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:40,811 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-05 22:38:40,811 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:40,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-05 22:38:40,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:40,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 22:38:40,947 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:40,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-05 22:38:40,948 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-05 22:38:40,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:40,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:40,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:40,959 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-05 22:38:41,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:41,155 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-05 22:38:41,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:41,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1570149010, now seen corresponding path program 1 times [2022-12-05 22:38:41,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:41,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514969263] [2022-12-05 22:38:41,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:41,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:41,227 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-05 22:38:41,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:41,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514969263] [2022-12-05 22:38:41,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514969263] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:41,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515698472] [2022-12-05 22:38:41,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:41,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:41,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:41,232 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-05 22:38:41,259 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-05 22:38:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:41,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:41,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:41,307 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-05 22:38:41,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:41,317 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-05 22:38:41,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515698472] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:41,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:41,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645381252] [2022-12-05 22:38:41,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:41,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:41,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:41,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:41,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:41,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:41,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:41,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:41,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:41,374 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-05 22:38:41,374 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 22:38:41,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 377 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-05 22:38:41,375 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 22:38:41,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:38:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:38:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 22:38:41,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 22:38:41,378 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-05 22:38:41,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:41,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:41,380 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:41,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-05 22:38:41,381 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-05 22:38:41,381 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:41,381 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:41,382 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:41,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:41,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:41,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:41,386 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-05 22:38:41,386 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:41,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-05 22:38:41,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:41,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 22:38:41,539 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:41,540 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-05 22:38:41,540 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-05 22:38:41,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:41,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:41,540 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:41,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-05 22:38:41,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:41,741 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-05 22:38:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148948, now seen corresponding path program 1 times [2022-12-05 22:38:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:41,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494789787] [2022-12-05 22:38:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:41,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:41,778 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-05 22:38:41,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:41,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494789787] [2022-12-05 22:38:41,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494789787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:41,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627733252] [2022-12-05 22:38:41,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:41,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:41,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:41,780 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-05 22:38:41,783 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-05 22:38:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:41,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:41,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:41,852 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-05 22:38:41,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:41,863 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-05 22:38:41,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627733252] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:41,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:41,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:41,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200530523] [2022-12-05 22:38:41,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:41,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:41,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:41,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:41,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:41,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:41,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:41,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:41,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:41,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:41,911 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-05 22:38:41,911 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 22:38:41,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 378 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-05 22:38:41,912 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 22:38:41,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:38:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:38:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 22:38:41,914 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 22:38:41,914 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-05 22:38:41,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:41,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:41,915 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:41,915 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-05 22:38:41,916 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-05 22:38:41,916 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:41,916 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:41,916 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:41,916 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:41,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:41,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:41,919 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-05 22:38:41,919 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:41,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-05 22:38:41,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:41,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 22:38:42,064 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:42,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-05 22:38:42,065 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-05 22:38:42,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:42,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:42,066 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:42,074 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-05 22:38:42,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:42,267 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-05 22:38:42,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:42,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148886, now seen corresponding path program 1 times [2022-12-05 22:38:42,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:42,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777078265] [2022-12-05 22:38:42,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:42,300 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-05 22:38:42,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:42,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777078265] [2022-12-05 22:38:42,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777078265] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:42,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101335597] [2022-12-05 22:38:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:42,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:42,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:42,302 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-05 22:38:42,328 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-05 22:38:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:42,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:42,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:42,376 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-05 22:38:42,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:42,386 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-05 22:38:42,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101335597] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:42,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:42,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 22:38:42,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344593308] [2022-12-05 22:38:42,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:42,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:38:42,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:42,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:38:42,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:38:42,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:42,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:42,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:42,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:42,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:42,441 INFO L130 PetriNetUnfolder]: 115/176 cut-off events. [2022-12-05 22:38:42,441 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-05 22:38:42,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 176 events. 115/176 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 377 event pairs, 20 based on Foata normal form. 18/156 useless extension candidates. Maximal degree in co-relation 471. Up to 64 conditions per place. [2022-12-05 22:38:42,442 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-05 22:38:42,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:38:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:38:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-05 22:38:42,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-05 22:38:42,443 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 5 states and 36 transitions. [2022-12-05 22:38:42,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 34 transitions, 170 flow [2022-12-05 22:38:42,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 34 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:42,445 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:42,445 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2022-12-05 22:38:42,446 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-05 22:38:42,446 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:42,446 INFO L89 Accepts]: Start accepts. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:42,447 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:42,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:42,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:42,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:42,450 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-05 22:38:42,450 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:42,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 16 events. 3/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 29. Up to 6 conditions per place. [2022-12-05 22:38:42,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 66 flow [2022-12-05 22:38:42,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-05 22:38:42,597 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:42,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-05 22:38:42,598 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 54 flow [2022-12-05 22:38:42,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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-05 22:38:42,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:42,598 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:42,612 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-05 22:38:42,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-05 22:38:42,799 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-05 22:38:42,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148824, now seen corresponding path program 1 times [2022-12-05 22:38:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:42,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984485925] [2022-12-05 22:38:42,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:42,828 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-05 22:38:42,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:42,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984485925] [2022-12-05 22:38:42,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984485925] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:42,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993026447] [2022-12-05 22:38:42,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:42,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:42,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:42,830 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-05 22:38:42,833 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-05 22:38:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:42,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:42,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:42,900 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-05 22:38:42,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:42,908 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-05 22:38:42,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993026447] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:42,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:42,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-12-05 22:38:42,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859560580] [2022-12-05 22:38:42,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:42,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:38:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:42,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:38:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:38:42,909 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:42,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 54 flow. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:42,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:42,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:42,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:42,944 INFO L130 PetriNetUnfolder]: 97/149 cut-off events. [2022-12-05 22:38:42,945 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-05 22:38:42,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 149 events. 97/149 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 310 event pairs, 20 based on Foata normal form. 9/126 useless extension candidates. Maximal degree in co-relation 399. Up to 64 conditions per place. [2022-12-05 22:38:42,946 INFO L137 encePairwiseOnDemand]: 10/14 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2022-12-05 22:38:42,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 27 transitions, 138 flow [2022-12-05 22:38:42,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:38:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:38:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-05 22:38:42,946 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 22:38:42,947 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 54 flow. Second operand 4 states and 28 transitions. [2022-12-05 22:38:42,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 27 transitions, 138 flow [2022-12-05 22:38:42,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 27 transitions, 122 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:42,948 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:42,948 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=56, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2022-12-05 22:38:42,948 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-05 22:38:42,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:42,948 INFO L89 Accepts]: Start accepts. Operand has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:42,949 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:42,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:42,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:42,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:42,951 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-05 22:38:42,951 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 22:38:42,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 15 events. 3/15 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 24. Up to 5 conditions per place. [2022-12-05 22:38:42,951 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 15 transitions, 56 flow [2022-12-05 22:38:42,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-05 22:38:43,041 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:38:43,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-05 22:38:43,042 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 50 flow [2022-12-05 22:38:43,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:43,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:43,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:43,047 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-05 22:38:43,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-05 22:38:43,243 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-05 22:38:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148793, now seen corresponding path program 1 times [2022-12-05 22:38:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:43,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041402120] [2022-12-05 22:38:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:43,366 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-05 22:38:43,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:43,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041402120] [2022-12-05 22:38:43,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041402120] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:43,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534743344] [2022-12-05 22:38:43,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:43,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:43,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:43,368 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-05 22:38:43,372 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-05 22:38:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:43,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-05 22:38:43,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:43,481 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-05 22:38:43,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:43,551 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-05 22:38:43,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534743344] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:43,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:43,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-05 22:38:43,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332123810] [2022-12-05 22:38:43,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:43,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 22:38:43,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:43,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 22:38:43,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-05 22:38:43,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:38:43,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 14 transitions, 50 flow. Second operand has 8 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-05 22:38:43,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:43,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:38:43,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:43,687 INFO L130 PetriNetUnfolder]: 265/405 cut-off events. [2022-12-05 22:38:43,688 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-05 22:38:43,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 405 events. 265/405 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1298 event pairs, 28 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 1045. Up to 167 conditions per place. [2022-12-05 22:38:43,690 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 46 selfloop transitions, 19 changer transitions 0/65 dead transitions. [2022-12-05 22:38:43,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 65 transitions, 326 flow [2022-12-05 22:38:43,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:38:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:38:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-12-05 22:38:43,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-05 22:38:43,691 INFO L175 Difference]: Start difference. First operand has 20 places, 14 transitions, 50 flow. Second operand 8 states and 68 transitions. [2022-12-05 22:38:43,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 65 transitions, 326 flow [2022-12-05 22:38:43,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 65 transitions, 294 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-05 22:38:43,693 INFO L231 Difference]: Finished difference. Result has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:43,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=159, PETRI_PLACES=27, PETRI_TRANSITIONS=33} [2022-12-05 22:38:43,693 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 9 predicate places. [2022-12-05 22:38:43,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:43,693 INFO L89 Accepts]: Start accepts. Operand has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:43,694 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:43,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:43,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:43,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:43,699 INFO L130 PetriNetUnfolder]: 35/73 cut-off events. [2022-12-05 22:38:43,699 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-12-05 22:38:43,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 73 events. 35/73 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 191 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 172. Up to 41 conditions per place. [2022-12-05 22:38:43,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 33 transitions, 159 flow [2022-12-05 22:38:43,700 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-05 22:38:43,714 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 10) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:38:43,764 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 10)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:38:43,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 10) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:38:43,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 10)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:38:44,058 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:44,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 366 [2022-12-05 22:38:44,059 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 32 transitions, 174 flow [2022-12-05 22:38:44,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 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-05 22:38:44,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:44,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:44,071 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-05 22:38:44,260 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,SelfDestructingSolverStorable10 [2022-12-05 22:38:44,260 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-05 22:38:44,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:44,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1570148607, now seen corresponding path program 1 times [2022-12-05 22:38:44,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:44,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856013612] [2022-12-05 22:38:44,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:44,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:44,284 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-05 22:38:44,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:44,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856013612] [2022-12-05 22:38:44,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856013612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:44,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:38:44,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:38:44,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476084690] [2022-12-05 22:38:44,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:44,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:38:44,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:44,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:38:44,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:38:44,285 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 22:38:44,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 32 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:44,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:44,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 22:38:44,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:44,325 INFO L130 PetriNetUnfolder]: 170/268 cut-off events. [2022-12-05 22:38:44,325 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2022-12-05 22:38:44,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 268 events. 170/268 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 819 event pairs, 63 based on Foata normal form. 8/276 useless extension candidates. Maximal degree in co-relation 766. Up to 155 conditions per place. [2022-12-05 22:38:44,327 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 25 selfloop transitions, 6 changer transitions 1/32 dead transitions. [2022-12-05 22:38:44,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 32 transitions, 218 flow [2022-12-05 22:38:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:38:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:38:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-05 22:38:44,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-05 22:38:44,328 INFO L175 Difference]: Start difference. First operand has 26 places, 32 transitions, 174 flow. Second operand 3 states and 26 transitions. [2022-12-05 22:38:44,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 32 transitions, 218 flow [2022-12-05 22:38:44,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 204 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-05 22:38:44,329 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 129 flow [2022-12-05 22:38:44,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2022-12-05 22:38:44,330 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 8 predicate places. [2022-12-05 22:38:44,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:44,330 INFO L89 Accepts]: Start accepts. Operand has 26 places, 25 transitions, 129 flow [2022-12-05 22:38:44,330 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:44,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:44,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 25 transitions, 129 flow [2022-12-05 22:38:44,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 129 flow [2022-12-05 22:38:44,335 INFO L130 PetriNetUnfolder]: 26/58 cut-off events. [2022-12-05 22:38:44,335 INFO L131 PetriNetUnfolder]: For 56/58 co-relation queries the response was YES. [2022-12-05 22:38:44,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 58 events. 26/58 cut-off events. For 56/58 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 134. Up to 33 conditions per place. [2022-12-05 22:38:44,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 129 flow [2022-12-05 22:38:44,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-05 22:38:44,336 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:44,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 22:38:44,337 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 129 flow [2022-12-05 22:38:44,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:44,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:44,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:44,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 22:38:44,337 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-05 22:38:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:44,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1106078391, now seen corresponding path program 1 times [2022-12-05 22:38:44,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:44,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798605617] [2022-12-05 22:38:44,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:44,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:44,478 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-05 22:38:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:44,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798605617] [2022-12-05 22:38:44,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798605617] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:44,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605234547] [2022-12-05 22:38:44,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:44,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:44,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:44,480 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-05 22:38:44,482 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-05 22:38:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:44,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-05 22:38:44,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:44,628 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-05 22:38:44,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:44,730 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-05 22:38:44,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605234547] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:44,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:44,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-05 22:38:44,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987483671] [2022-12-05 22:38:44,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:44,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 22:38:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:44,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 22:38:44,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-05 22:38:44,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 22:38:44,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 129 flow. Second operand has 11 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-05 22:38:44,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:44,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 22:38:44,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:45,347 INFO L130 PetriNetUnfolder]: 350/539 cut-off events. [2022-12-05 22:38:45,348 INFO L131 PetriNetUnfolder]: For 508/508 co-relation queries the response was YES. [2022-12-05 22:38:45,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 539 events. 350/539 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1946 event pairs, 25 based on Foata normal form. 20/559 useless extension candidates. Maximal degree in co-relation 1556. Up to 219 conditions per place. [2022-12-05 22:38:45,351 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 60 selfloop transitions, 41 changer transitions 0/101 dead transitions. [2022-12-05 22:38:45,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 101 transitions, 604 flow [2022-12-05 22:38:45,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 22:38:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 22:38:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-12-05 22:38:45,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-12-05 22:38:45,352 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 129 flow. Second operand 12 states and 100 transitions. [2022-12-05 22:38:45,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 101 transitions, 604 flow [2022-12-05 22:38:45,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 101 transitions, 576 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-05 22:38:45,355 INFO L231 Difference]: Finished difference. Result has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:45,355 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=385, PETRI_PLACES=37, PETRI_TRANSITIONS=55} [2022-12-05 22:38:45,356 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 19 predicate places. [2022-12-05 22:38:45,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:45,356 INFO L89 Accepts]: Start accepts. Operand has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:45,356 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:45,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:45,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:45,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:45,364 INFO L130 PetriNetUnfolder]: 52/109 cut-off events. [2022-12-05 22:38:45,364 INFO L131 PetriNetUnfolder]: For 125/129 co-relation queries the response was YES. [2022-12-05 22:38:45,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 109 events. 52/109 cut-off events. For 125/129 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 343 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 339. Up to 72 conditions per place. [2022-12-05 22:38:45,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 55 transitions, 385 flow [2022-12-05 22:38:45,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 268 [2022-12-05 22:38:45,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 10)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [291] L705-6-->L705-6: Formula: (and (= v_~next~0_14 v_~cur~0_29) (= v_~prev~0_29 v_~cur~0_30) (= v_~x~0_21 (+ v_~x~0_22 1)) (< v_~x~0_22 22) (= (+ v_~prev~0_30 v_~cur~0_30) v_~next~0_14)) InVars {~prev~0=v_~prev~0_30, ~cur~0=v_~cur~0_30, ~x~0=v_~x~0_22} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_15|, ~next~0=v_~next~0_14, ~prev~0=v_~prev~0_29, ~cur~0=v_~cur~0_29, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] [2022-12-05 22:38:45,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] L705-6-->L687-5: Formula: (and (= (+ (* 28657 v_~cur~0_192) (* v_~prev~0_221 17711)) v_~next~0_124) (= (+ v_~j~0_125 v_~i~0_110) v_~i~0_109) (= v_~p~0_43 (+ v_~p~0_44 1)) (= v_~next~0_124 v_~cur~0_191) (< v_~p~0_44 10) (= (+ 22 v_~x~0_213) v_~x~0_212) (= v_~prev~0_220 (+ (* 17711 v_~cur~0_192) (* 10946 v_~prev~0_221))) (< v_~x~0_212 23)) InVars {~j~0=v_~j~0_125, ~prev~0=v_~prev~0_221, ~i~0=v_~i~0_110, ~p~0=v_~p~0_44, ~cur~0=v_~cur~0_192, ~x~0=v_~x~0_213} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_133|, ~j~0=v_~j~0_125, ~next~0=v_~next~0_124, ~prev~0=v_~prev~0_220, ~i~0=v_~i~0_109, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_30|, ~p~0=v_~p~0_43, ~cur~0=v_~cur~0_191, ~x~0=v_~x~0_212} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] and [291] L705-6-->L705-6: Formula: (and (= v_~next~0_14 v_~cur~0_29) (= v_~prev~0_29 v_~cur~0_30) (= v_~x~0_21 (+ v_~x~0_22 1)) (< v_~x~0_22 22) (= (+ v_~prev~0_30 v_~cur~0_30) v_~next~0_14)) InVars {~prev~0=v_~prev~0_30, ~cur~0=v_~cur~0_30, ~x~0=v_~x~0_22} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_15|, ~next~0=v_~next~0_14, ~prev~0=v_~prev~0_29, ~cur~0=v_~cur~0_29, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] [2022-12-05 22:38:45,679 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 10)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [353] L705-6-->L687-5: Formula: (and (< v_~x~0_198 23) (= (+ v_~j~0_119 v_~i~0_104) v_~i~0_103) (= v_~next~0_116 (+ (* 28657 v_~cur~0_178) (* v_~prev~0_207 17711))) (< v_~p~0_40 10) (= v_~p~0_39 (+ v_~p~0_40 1)) (= v_~prev~0_206 (+ (* 17711 v_~cur~0_178) (* 10946 v_~prev~0_207))) (= (+ 22 v_~x~0_199) v_~x~0_198) (= v_~next~0_116 v_~cur~0_177)) InVars {~j~0=v_~j~0_119, ~prev~0=v_~prev~0_207, ~i~0=v_~i~0_104, ~p~0=v_~p~0_40, ~cur~0=v_~cur~0_178, ~x~0=v_~x~0_199} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_125|, ~j~0=v_~j~0_119, ~next~0=v_~next~0_116, ~prev~0=v_~prev~0_206, ~i~0=v_~i~0_103, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_28|, ~p~0=v_~p~0_39, ~cur~0=v_~cur~0_177, ~x~0=v_~x~0_198} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-05 22:38:45,773 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:38:45,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 418 [2022-12-05 22:38:45,774 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 55 transitions, 403 flow [2022-12-05 22:38:45,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 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-05 22:38:45,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:45,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:45,780 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-05 22:38:45,979 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,SelfDestructingSolverStorable12 [2022-12-05 22:38:45,980 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-05 22:38:45,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:45,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1421156745, now seen corresponding path program 1 times [2022-12-05 22:38:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:45,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997263721] [2022-12-05 22:38:45,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:45,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:46,020 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-05 22:38:46,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:46,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997263721] [2022-12-05 22:38:46,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997263721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:46,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:38:46,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:38:46,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203244649] [2022-12-05 22:38:46,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:46,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:38:46,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:46,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:38:46,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:38:46,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:38:46,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 55 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:46,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:46,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:38:46,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:46,081 INFO L130 PetriNetUnfolder]: 285/446 cut-off events. [2022-12-05 22:38:46,081 INFO L131 PetriNetUnfolder]: For 652/652 co-relation queries the response was YES. [2022-12-05 22:38:46,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 446 events. 285/446 cut-off events. For 652/652 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1556 event pairs, 111 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 1520. Up to 251 conditions per place. [2022-12-05 22:38:46,084 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 47 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2022-12-05 22:38:46,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 58 transitions, 511 flow [2022-12-05 22:38:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:38:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:38:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-05 22:38:46,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 22:38:46,085 INFO L175 Difference]: Start difference. First operand has 37 places, 55 transitions, 403 flow. Second operand 3 states and 30 transitions. [2022-12-05 22:38:46,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 58 transitions, 511 flow [2022-12-05 22:38:46,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 439 flow, removed 32 selfloop flow, removed 1 redundant places. [2022-12-05 22:38:46,089 INFO L231 Difference]: Finished difference. Result has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:46,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=37, PETRI_TRANSITIONS=50} [2022-12-05 22:38:46,089 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 19 predicate places. [2022-12-05 22:38:46,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:46,089 INFO L89 Accepts]: Start accepts. Operand has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:46,090 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:46,090 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:46,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:46,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:46,097 INFO L130 PetriNetUnfolder]: 43/92 cut-off events. [2022-12-05 22:38:46,097 INFO L131 PetriNetUnfolder]: For 155/164 co-relation queries the response was YES. [2022-12-05 22:38:46,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 92 events. 43/92 cut-off events. For 155/164 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 290 event pairs, 0 based on Foata normal form. 3/92 useless extension candidates. Maximal degree in co-relation 258. Up to 45 conditions per place. [2022-12-05 22:38:46,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:46,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-05 22:38:46,099 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:46,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 22:38:46,099 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 50 transitions, 321 flow [2022-12-05 22:38:46,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:46,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:46,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:46,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 22:38:46,100 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-05 22:38:46,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:46,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1104857022, now seen corresponding path program 1 times [2022-12-05 22:38:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:46,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215631569] [2022-12-05 22:38:46,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:46,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:46,209 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-05 22:38:46,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:46,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215631569] [2022-12-05 22:38:46,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215631569] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:46,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034495972] [2022-12-05 22:38:46,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:46,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:46,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:46,212 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-05 22:38:46,238 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-05 22:38:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:46,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-05 22:38:46,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:46,366 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-05 22:38:46,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:46,472 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-05 22:38:46,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034495972] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:46,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:46,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-05 22:38:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048239958] [2022-12-05 22:38:46,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:46,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 22:38:46,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:46,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 22:38:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-05 22:38:46,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 22:38:46,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 50 transitions, 321 flow. Second operand has 11 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-05 22:38:46,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:46,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 22:38:46,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:46,722 INFO L130 PetriNetUnfolder]: 497/766 cut-off events. [2022-12-05 22:38:46,723 INFO L131 PetriNetUnfolder]: For 1305/1305 co-relation queries the response was YES. [2022-12-05 22:38:46,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 766 events. 497/766 cut-off events. For 1305/1305 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3081 event pairs, 29 based on Foata normal form. 20/772 useless extension candidates. Maximal degree in co-relation 2431. Up to 279 conditions per place. [2022-12-05 22:38:46,727 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 58 selfloop transitions, 65 changer transitions 0/123 dead transitions. [2022-12-05 22:38:46,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 123 transitions, 850 flow [2022-12-05 22:38:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 22:38:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 22:38:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-12-05 22:38:46,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-05 22:38:46,729 INFO L175 Difference]: Start difference. First operand has 37 places, 50 transitions, 321 flow. Second operand 10 states and 96 transitions. [2022-12-05 22:38:46,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 123 transitions, 850 flow [2022-12-05 22:38:46,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 123 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:38:46,736 INFO L231 Difference]: Finished difference. Result has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:46,736 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=635, PETRI_PLACES=47, PETRI_TRANSITIONS=79} [2022-12-05 22:38:46,736 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 29 predicate places. [2022-12-05 22:38:46,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:46,737 INFO L89 Accepts]: Start accepts. Operand has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:46,737 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:46,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:46,738 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:46,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:46,764 INFO L130 PetriNetUnfolder]: 77/160 cut-off events. [2022-12-05 22:38:46,764 INFO L131 PetriNetUnfolder]: For 385/394 co-relation queries the response was YES. [2022-12-05 22:38:46,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 160 events. 77/160 cut-off events. For 385/394 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 643 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 588. Up to 96 conditions per place. [2022-12-05 22:38:46,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:46,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-05 22:38:46,767 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:46,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-05 22:38:46,768 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 79 transitions, 635 flow [2022-12-05 22:38:46,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 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-05 22:38:46,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:46,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:46,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-05 22:38:46,974 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,SelfDestructingSolverStorable14 [2022-12-05 22:38:46,974 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-05 22:38:46,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1106186023, now seen corresponding path program 1 times [2022-12-05 22:38:46,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:46,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126283708] [2022-12-05 22:38:46,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:46,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:47,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:47,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126283708] [2022-12-05 22:38:47,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126283708] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:47,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989422651] [2022-12-05 22:38:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:47,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:47,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:47,007 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-05 22:38:47,017 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-05 22:38:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:47,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-05 22:38:47,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:38:47,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:38:47,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989422651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:38:47,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:38:47,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-05 22:38:47,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190527510] [2022-12-05 22:38:47,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:38:47,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:38:47,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:47,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:38:47,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:38:47,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 22:38:47,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 79 transitions, 635 flow. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:47,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:47,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 22:38:47,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:47,176 INFO L130 PetriNetUnfolder]: 382/627 cut-off events. [2022-12-05 22:38:47,176 INFO L131 PetriNetUnfolder]: For 1660/1660 co-relation queries the response was YES. [2022-12-05 22:38:47,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 627 events. 382/627 cut-off events. For 1660/1660 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2636 event pairs, 163 based on Foata normal form. 67/683 useless extension candidates. Maximal degree in co-relation 2205. Up to 359 conditions per place. [2022-12-05 22:38:47,180 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 58 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2022-12-05 22:38:47,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 703 flow [2022-12-05 22:38:47,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:38:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:38:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-12-05 22:38:47,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31521739130434784 [2022-12-05 22:38:47,181 INFO L175 Difference]: Start difference. First operand has 47 places, 79 transitions, 635 flow. Second operand 4 states and 29 transitions. [2022-12-05 22:38:47,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 703 flow [2022-12-05 22:38:47,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 73 transitions, 665 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:47,189 INFO L231 Difference]: Finished difference. Result has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:47,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=509, PETRI_PLACES=45, PETRI_TRANSITIONS=63} [2022-12-05 22:38:47,191 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 27 predicate places. [2022-12-05 22:38:47,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:47,191 INFO L89 Accepts]: Start accepts. Operand has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:47,191 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:47,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:47,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:47,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:47,201 INFO L130 PetriNetUnfolder]: 52/131 cut-off events. [2022-12-05 22:38:47,201 INFO L131 PetriNetUnfolder]: For 261/269 co-relation queries the response was YES. [2022-12-05 22:38:47,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 131 events. 52/131 cut-off events. For 261/269 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 572 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 427. Up to 53 conditions per place. [2022-12-05 22:38:47,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:47,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-05 22:38:47,204 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:38:47,204 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-05 22:38:47,204 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 63 transitions, 509 flow [2022-12-05 22:38:47,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:47,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:47,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:47,213 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-05 22:38:47,410 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,SelfDestructingSolverStorable15 [2022-12-05 22:38:47,411 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-05 22:38:47,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:47,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1429423767, now seen corresponding path program 1 times [2022-12-05 22:38:47,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:47,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651923517] [2022-12-05 22:38:47,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:47,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:47,557 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-05 22:38:47,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:47,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651923517] [2022-12-05 22:38:47,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651923517] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:47,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467368747] [2022-12-05 22:38:47,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:47,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:47,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:47,559 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-05 22:38:47,562 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-05 22:38:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:47,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-05 22:38:47,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:47,704 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-05 22:38:47,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:47,800 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-05 22:38:47,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467368747] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:47,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:47,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-05 22:38:47,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130603924] [2022-12-05 22:38:47,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:47,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-05 22:38:47,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:47,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-05 22:38:47,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-05 22:38:47,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 22:38:47,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 63 transitions, 509 flow. Second operand has 11 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-05 22:38:47,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:47,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 22:38:47,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:48,172 INFO L130 PetriNetUnfolder]: 412/689 cut-off events. [2022-12-05 22:38:48,173 INFO L131 PetriNetUnfolder]: For 1603/1603 co-relation queries the response was YES. [2022-12-05 22:38:48,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 689 events. 412/689 cut-off events. For 1603/1603 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3043 event pairs, 37 based on Foata normal form. 26/701 useless extension candidates. Maximal degree in co-relation 2326. Up to 427 conditions per place. [2022-12-05 22:38:48,177 INFO L137 encePairwiseOnDemand]: 8/21 looper letters, 68 selfloop transitions, 42 changer transitions 0/110 dead transitions. [2022-12-05 22:38:48,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 110 transitions, 883 flow [2022-12-05 22:38:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 22:38:48,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 22:38:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-12-05 22:38:48,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3523809523809524 [2022-12-05 22:38:48,179 INFO L175 Difference]: Start difference. First operand has 45 places, 63 transitions, 509 flow. Second operand 10 states and 74 transitions. [2022-12-05 22:38:48,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 110 transitions, 883 flow [2022-12-05 22:38:48,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 110 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:38:48,186 INFO L231 Difference]: Finished difference. Result has 56 places, 77 transitions, 717 flow [2022-12-05 22:38:48,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=717, PETRI_PLACES=56, PETRI_TRANSITIONS=77} [2022-12-05 22:38:48,187 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 38 predicate places. [2022-12-05 22:38:48,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:48,187 INFO L89 Accepts]: Start accepts. Operand has 56 places, 77 transitions, 717 flow [2022-12-05 22:38:48,187 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:48,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:48,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 77 transitions, 717 flow [2022-12-05 22:38:48,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 77 transitions, 717 flow [2022-12-05 22:38:48,198 INFO L130 PetriNetUnfolder]: 62/154 cut-off events. [2022-12-05 22:38:48,211 INFO L131 PetriNetUnfolder]: For 382/394 co-relation queries the response was YES. [2022-12-05 22:38:48,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 154 events. 62/154 cut-off events. For 382/394 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 688 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 598. Up to 62 conditions per place. [2022-12-05 22:38:48,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 77 transitions, 717 flow [2022-12-05 22:38:48,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-05 22:38:48,443 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:48,444 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 257 [2022-12-05 22:38:48,444 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 77 transitions, 732 flow [2022-12-05 22:38:48,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 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-05 22:38:48,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:48,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:48,453 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-05 22:38:48,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:48,644 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-05 22:38:48,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash 68095705, now seen corresponding path program 1 times [2022-12-05 22:38:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:48,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960467311] [2022-12-05 22:38:48,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:48,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:48,788 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-05 22:38:48,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:48,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960467311] [2022-12-05 22:38:48,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960467311] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:48,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113754644] [2022-12-05 22:38:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:48,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:48,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:48,790 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-05 22:38:48,800 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-05 22:38:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:48,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:38:48,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:48,948 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-05 22:38:48,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:49,089 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-05 22:38:49,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113754644] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:49,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:49,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:38:49,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114272362] [2022-12-05 22:38:49,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:49,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:38:49,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:49,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:38:49,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:38:49,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-05 22:38:49,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 77 transitions, 732 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:49,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:49,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-05 22:38:49,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:50,025 INFO L130 PetriNetUnfolder]: 472/809 cut-off events. [2022-12-05 22:38:50,026 INFO L131 PetriNetUnfolder]: For 3388/3388 co-relation queries the response was YES. [2022-12-05 22:38:50,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 809 events. 472/809 cut-off events. For 3388/3388 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3814 event pairs, 35 based on Foata normal form. 40/838 useless extension candidates. Maximal degree in co-relation 3038. Up to 460 conditions per place. [2022-12-05 22:38:50,032 INFO L137 encePairwiseOnDemand]: 8/23 looper letters, 79 selfloop transitions, 58 changer transitions 0/137 dead transitions. [2022-12-05 22:38:50,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 137 transitions, 1256 flow [2022-12-05 22:38:50,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 22:38:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 22:38:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-12-05 22:38:50,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3241106719367589 [2022-12-05 22:38:50,034 INFO L175 Difference]: Start difference. First operand has 56 places, 77 transitions, 732 flow. Second operand 11 states and 82 transitions. [2022-12-05 22:38:50,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 137 transitions, 1256 flow [2022-12-05 22:38:50,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 137 transitions, 1203 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-05 22:38:50,047 INFO L231 Difference]: Finished difference. Result has 67 places, 101 transitions, 1061 flow [2022-12-05 22:38:50,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1061, PETRI_PLACES=67, PETRI_TRANSITIONS=101} [2022-12-05 22:38:50,048 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 49 predicate places. [2022-12-05 22:38:50,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:50,048 INFO L89 Accepts]: Start accepts. Operand has 67 places, 101 transitions, 1061 flow [2022-12-05 22:38:50,050 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:50,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:50,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 101 transitions, 1061 flow [2022-12-05 22:38:50,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 101 transitions, 1061 flow [2022-12-05 22:38:50,066 INFO L130 PetriNetUnfolder]: 76/197 cut-off events. [2022-12-05 22:38:50,066 INFO L131 PetriNetUnfolder]: For 726/738 co-relation queries the response was YES. [2022-12-05 22:38:50,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 197 events. 76/197 cut-off events. For 726/738 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 962 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 866. Up to 82 conditions per place. [2022-12-05 22:38:50,068 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 101 transitions, 1061 flow [2022-12-05 22:38:50,068 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-05 22:38:50,110 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:38:50,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-05 22:38:50,114 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 1064 flow [2022-12-05 22:38:50,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:50,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:50,114 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:50,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-05 22:38:50,319 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,SelfDestructingSolverStorable17 [2022-12-05 22:38:50,319 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-05 22:38:50,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1362136593, now seen corresponding path program 1 times [2022-12-05 22:38:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:50,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181916748] [2022-12-05 22:38:50,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:50,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:50,500 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-05 22:38:50,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:50,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181916748] [2022-12-05 22:38:50,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181916748] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:50,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177824473] [2022-12-05 22:38:50,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:50,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:50,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:50,502 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-05 22:38:50,514 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-05 22:38:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:50,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:38:50,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:50,679 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-05 22:38:50,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:50,806 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-05 22:38:50,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177824473] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:50,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:50,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:38:50,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846477062] [2022-12-05 22:38:50,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:50,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:38:50,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:50,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:38:50,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:38:50,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:38:50,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 1064 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:50,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:50,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:38:50,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:38:55,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:38:55,173 INFO L130 PetriNetUnfolder]: 512/889 cut-off events. [2022-12-05 22:38:55,173 INFO L131 PetriNetUnfolder]: For 4881/4881 co-relation queries the response was YES. [2022-12-05 22:38:55,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 889 events. 512/889 cut-off events. For 4881/4881 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4395 event pairs, 47 based on Foata normal form. 24/902 useless extension candidates. Maximal degree in co-relation 3656. Up to 544 conditions per place. [2022-12-05 22:38:55,180 INFO L137 encePairwiseOnDemand]: 9/24 looper letters, 91 selfloop transitions, 62 changer transitions 0/153 dead transitions. [2022-12-05 22:38:55,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 153 transitions, 1586 flow [2022-12-05 22:38:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 22:38:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 22:38:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2022-12-05 22:38:55,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3143939393939394 [2022-12-05 22:38:55,183 INFO L175 Difference]: Start difference. First operand has 67 places, 101 transitions, 1064 flow. Second operand 11 states and 83 transitions. [2022-12-05 22:38:55,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 153 transitions, 1586 flow [2022-12-05 22:38:55,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 153 transitions, 1547 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-05 22:38:55,201 INFO L231 Difference]: Finished difference. Result has 78 places, 117 transitions, 1366 flow [2022-12-05 22:38:55,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1366, PETRI_PLACES=78, PETRI_TRANSITIONS=117} [2022-12-05 22:38:55,202 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 60 predicate places. [2022-12-05 22:38:55,202 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:38:55,202 INFO L89 Accepts]: Start accepts. Operand has 78 places, 117 transitions, 1366 flow [2022-12-05 22:38:55,203 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:38:55,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:38:55,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 117 transitions, 1366 flow [2022-12-05 22:38:55,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 117 transitions, 1366 flow [2022-12-05 22:38:55,227 INFO L130 PetriNetUnfolder]: 86/226 cut-off events. [2022-12-05 22:38:55,227 INFO L131 PetriNetUnfolder]: For 1146/1158 co-relation queries the response was YES. [2022-12-05 22:38:55,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 226 events. 86/226 cut-off events. For 1146/1158 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1151 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 1100. Up to 102 conditions per place. [2022-12-05 22:38:55,229 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 117 transitions, 1366 flow [2022-12-05 22:38:55,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-05 22:38:55,315 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:38:55,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-05 22:38:55,316 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 117 transitions, 1375 flow [2022-12-05 22:38:55,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:55,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:38:55,316 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:38:55,324 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-05 22:38:55,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:55,517 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-05 22:38:55,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:38:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash 549143970, now seen corresponding path program 1 times [2022-12-05 22:38:55,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:38:55,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19380924] [2022-12-05 22:38:55,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:55,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:38:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:55,706 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-05 22:38:55,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:38:55,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19380924] [2022-12-05 22:38:55,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19380924] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:38:55,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461156965] [2022-12-05 22:38:55,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:38:55,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:38:55,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:38:55,708 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-05 22:38:55,711 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-05 22:38:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:38:55,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:38:55,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:38:55,889 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-05 22:38:55,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:38:56,024 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-05 22:38:56,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461156965] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:38:56,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:38:56,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:38:56,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990694864] [2022-12-05 22:38:56,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:38:56,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:38:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:38:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:38:56,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:38:56,027 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 22:38:56,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 117 transitions, 1375 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:38:56,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:38:56,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 22:38:56,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:04,182 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 33 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:39:12,274 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 31 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:39:16,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:39:19,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:39:19,215 INFO L130 PetriNetUnfolder]: 532/933 cut-off events. [2022-12-05 22:39:19,216 INFO L131 PetriNetUnfolder]: For 5392/5392 co-relation queries the response was YES. [2022-12-05 22:39:19,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4164 conditions, 933 events. 532/933 cut-off events. For 5392/5392 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4776 event pairs, 35 based on Foata normal form. 12/934 useless extension candidates. Maximal degree in co-relation 4128. Up to 468 conditions per place. [2022-12-05 22:39:19,222 INFO L137 encePairwiseOnDemand]: 8/26 looper letters, 101 selfloop transitions, 88 changer transitions 2/191 dead transitions. [2022-12-05 22:39:19,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 191 transitions, 2063 flow [2022-12-05 22:39:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 22:39:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 22:39:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 118 transitions. [2022-12-05 22:39:19,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2669683257918552 [2022-12-05 22:39:19,224 INFO L175 Difference]: Start difference. First operand has 78 places, 117 transitions, 1375 flow. Second operand 17 states and 118 transitions. [2022-12-05 22:39:19,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 191 transitions, 2063 flow [2022-12-05 22:39:19,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 191 transitions, 2003 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-05 22:39:19,246 INFO L231 Difference]: Finished difference. Result has 93 places, 133 transitions, 1764 flow [2022-12-05 22:39:19,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1764, PETRI_PLACES=93, PETRI_TRANSITIONS=133} [2022-12-05 22:39:19,247 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 75 predicate places. [2022-12-05 22:39:19,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:19,247 INFO L89 Accepts]: Start accepts. Operand has 93 places, 133 transitions, 1764 flow [2022-12-05 22:39:19,248 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:19,248 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:19,248 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 133 transitions, 1764 flow [2022-12-05 22:39:19,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 133 transitions, 1764 flow [2022-12-05 22:39:19,268 INFO L130 PetriNetUnfolder]: 91/244 cut-off events. [2022-12-05 22:39:19,268 INFO L131 PetriNetUnfolder]: For 1385/1393 co-relation queries the response was YES. [2022-12-05 22:39:19,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 244 events. 91/244 cut-off events. For 1385/1393 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1351 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 1314. Up to 112 conditions per place. [2022-12-05 22:39:19,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 133 transitions, 1764 flow [2022-12-05 22:39:19,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-05 22:39:19,781 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:39:19,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 534 [2022-12-05 22:39:19,782 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 133 transitions, 1799 flow [2022-12-05 22:39:19,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:19,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:19,782 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:19,791 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-05 22:39:19,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:19,982 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-05 22:39:19,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:19,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2108969978, now seen corresponding path program 1 times [2022-12-05 22:39:19,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:19,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891791273] [2022-12-05 22:39:19,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:19,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:20,136 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-05 22:39:20,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:20,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891791273] [2022-12-05 22:39:20,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891791273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:20,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433219893] [2022-12-05 22:39:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:20,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:20,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:20,138 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-05 22:39:20,141 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-05 22:39:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:20,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:39:20,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:20,320 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-05 22:39:20,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:20,465 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-05 22:39:20,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433219893] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:20,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:20,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:20,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003218963] [2022-12-05 22:39:20,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:20,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:20,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:20,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:20,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:20,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-05 22:39:20,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 133 transitions, 1799 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:20,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:20,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-05 22:39:20,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:22,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:39:24,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:39:24,450 INFO L130 PetriNetUnfolder]: 766/1357 cut-off events. [2022-12-05 22:39:24,451 INFO L131 PetriNetUnfolder]: For 17981/17981 co-relation queries the response was YES. [2022-12-05 22:39:24,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6450 conditions, 1357 events. 766/1357 cut-off events. For 17981/17981 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 7593 event pairs, 45 based on Foata normal form. 54/1400 useless extension candidates. Maximal degree in co-relation 6410. Up to 427 conditions per place. [2022-12-05 22:39:24,461 INFO L137 encePairwiseOnDemand]: 8/30 looper letters, 111 selfloop transitions, 163 changer transitions 0/274 dead transitions. [2022-12-05 22:39:24,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 274 transitions, 3397 flow [2022-12-05 22:39:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 22:39:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 22:39:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 144 transitions. [2022-12-05 22:39:24,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2022-12-05 22:39:24,463 INFO L175 Difference]: Start difference. First operand has 93 places, 133 transitions, 1799 flow. Second operand 18 states and 144 transitions. [2022-12-05 22:39:24,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 274 transitions, 3397 flow [2022-12-05 22:39:24,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 274 transitions, 3265 flow, removed 29 selfloop flow, removed 9 redundant places. [2022-12-05 22:39:24,499 INFO L231 Difference]: Finished difference. Result has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:24,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3051, PETRI_PLACES=109, PETRI_TRANSITIONS=205} [2022-12-05 22:39:24,499 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 91 predicate places. [2022-12-05 22:39:24,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:24,500 INFO L89 Accepts]: Start accepts. Operand has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:24,501 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:24,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:24,502 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:24,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:24,534 INFO L130 PetriNetUnfolder]: 133/352 cut-off events. [2022-12-05 22:39:24,534 INFO L131 PetriNetUnfolder]: For 2811/2823 co-relation queries the response was YES. [2022-12-05 22:39:24,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 352 events. 133/352 cut-off events. For 2811/2823 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2103 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 2172. Up to 183 conditions per place. [2022-12-05 22:39:24,538 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 205 transitions, 3051 flow [2022-12-05 22:39:24,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-05 22:39:24,581 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:24,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-05 22:39:24,584 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 205 transitions, 3056 flow [2022-12-05 22:39:24,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:24,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:24,584 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:24,593 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-05 22:39:24,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:24,789 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-05 22:39:24,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:24,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1363948078, now seen corresponding path program 1 times [2022-12-05 22:39:24,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:24,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41609827] [2022-12-05 22:39:24,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:24,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:24,947 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-05 22:39:24,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:24,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41609827] [2022-12-05 22:39:24,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41609827] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:24,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406008992] [2022-12-05 22:39:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:24,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:24,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:24,952 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-05 22:39:24,983 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-05 22:39:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:25,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:39:25,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:25,127 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-05 22:39:25,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:25,245 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-05 22:39:25,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406008992] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:25,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:25,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:25,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603090633] [2022-12-05 22:39:25,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:25,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:25,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:25,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:25,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-05 22:39:25,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 205 transitions, 3056 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:25,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:25,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-05 22:39:25,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:33,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:39:33,568 INFO L130 PetriNetUnfolder]: 868/1533 cut-off events. [2022-12-05 22:39:33,568 INFO L131 PetriNetUnfolder]: For 18338/18338 co-relation queries the response was YES. [2022-12-05 22:39:33,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8095 conditions, 1533 events. 868/1533 cut-off events. For 18338/18338 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 8860 event pairs, 95 based on Foata normal form. 22/1536 useless extension candidates. Maximal degree in co-relation 8047. Up to 1000 conditions per place. [2022-12-05 22:39:33,580 INFO L137 encePairwiseOnDemand]: 9/31 looper letters, 176 selfloop transitions, 104 changer transitions 2/282 dead transitions. [2022-12-05 22:39:33,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 282 transitions, 4120 flow [2022-12-05 22:39:33,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 22:39:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 22:39:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2022-12-05 22:39:33,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2465437788018433 [2022-12-05 22:39:33,581 INFO L175 Difference]: Start difference. First operand has 109 places, 205 transitions, 3056 flow. Second operand 14 states and 107 transitions. [2022-12-05 22:39:33,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 282 transitions, 4120 flow [2022-12-05 22:39:33,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 282 transitions, 3891 flow, removed 92 selfloop flow, removed 6 redundant places. [2022-12-05 22:39:33,629 INFO L231 Difference]: Finished difference. Result has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:33,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2841, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3569, PETRI_PLACES=121, PETRI_TRANSITIONS=234} [2022-12-05 22:39:33,630 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 103 predicate places. [2022-12-05 22:39:33,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:33,630 INFO L89 Accepts]: Start accepts. Operand has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:33,631 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:33,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:33,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:33,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:33,665 INFO L130 PetriNetUnfolder]: 153/401 cut-off events. [2022-12-05 22:39:33,665 INFO L131 PetriNetUnfolder]: For 2853/2865 co-relation queries the response was YES. [2022-12-05 22:39:33,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 401 events. 153/401 cut-off events. For 2853/2865 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2519 event pairs, 0 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 2526. Up to 187 conditions per place. [2022-12-05 22:39:33,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 234 transitions, 3569 flow [2022-12-05 22:39:33,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-05 22:39:33,703 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 10) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [352] L705-6-->L695-5: Formula: (and (= (+ (* 10946 v_~prev~0_203) (* 17711 v_~cur~0_174)) v_~prev~0_202) (= (+ (* 28657 v_~cur~0_174) (* v_~prev~0_203 17711)) v_~next~0_114) (= v_~next~0_114 v_~cur~0_173) (< v_~x~0_194 23) (= v_~j~0_115 (+ v_~j~0_116 v_~i~0_101)) (= v_~q~0_55 (+ v_~q~0_56 1)) (< v_~q~0_56 10) (= (+ 22 v_~x~0_195) v_~x~0_194)) InVars {~j~0=v_~j~0_116, ~prev~0=v_~prev~0_203, ~i~0=v_~i~0_101, ~q~0=v_~q~0_56, ~cur~0=v_~cur~0_174, ~x~0=v_~x~0_195} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_123|, ~j~0=v_~j~0_115, ~next~0=v_~next~0_114, ~prev~0=v_~prev~0_202, ~i~0=v_~i~0_101, ~q~0=v_~q~0_55, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_38|, ~cur~0=v_~cur~0_173, ~x~0=v_~x~0_194} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-05 22:39:33,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 10) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [371] L705-6-->L695-5: Formula: (and (= (+ (* 28657 v_~cur~0_234) (* v_~prev~0_269 17711)) v_~next~0_150) (< v_~x~0_262 23) (= (+ (* 17711 v_~cur~0_234) (* 10946 v_~prev~0_269)) v_~prev~0_268) (= (+ 2 v_~q~0_110) v_~q~0_108) (= (+ 22 v_~x~0_263) v_~x~0_262) (= v_~j~0_189 (+ v_~j~0_191 (* 2 v_~i~0_179))) (< v_~q~0_110 9) (= v_~next~0_150 v_~cur~0_233)) InVars {~j~0=v_~j~0_191, ~prev~0=v_~prev~0_269, ~i~0=v_~i~0_179, ~q~0=v_~q~0_110, ~cur~0=v_~cur~0_234, ~x~0=v_~x~0_263} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_165|, ~j~0=v_~j~0_189, ~next~0=v_~next~0_150, ~prev~0=v_~prev~0_268, ~i~0=v_~i~0_179, ~q~0=v_~q~0_108, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_78|, ~cur~0=v_~cur~0_233, ~x~0=v_~x~0_262} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-05 22:39:33,890 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:39:33,891 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 261 [2022-12-05 22:39:33,891 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 234 transitions, 3562 flow [2022-12-05 22:39:33,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:33,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:33,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:33,896 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-05 22:39:34,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:34,096 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-05 22:39:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:34,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2110580583, now seen corresponding path program 1 times [2022-12-05 22:39:34,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:34,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136991780] [2022-12-05 22:39:34,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:34,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:34,253 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-05 22:39:34,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:34,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136991780] [2022-12-05 22:39:34,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136991780] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:34,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131782185] [2022-12-05 22:39:34,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:34,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:34,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:34,256 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-05 22:39:34,286 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-05 22:39:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:34,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:39:34,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:34,455 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-05 22:39:34,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:34,616 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-05 22:39:34,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131782185] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:34,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:34,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:34,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018026636] [2022-12-05 22:39:34,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:34,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:34,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:34,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:34,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:34,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-05 22:39:34,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 234 transitions, 3562 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:34,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:34,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-05 22:39:34,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:35,235 INFO L130 PetriNetUnfolder]: 1116/1949 cut-off events. [2022-12-05 22:39:35,235 INFO L131 PetriNetUnfolder]: For 24974/24974 co-relation queries the response was YES. [2022-12-05 22:39:35,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10685 conditions, 1949 events. 1116/1949 cut-off events. For 24974/24974 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 11501 event pairs, 39 based on Foata normal form. 26/1953 useless extension candidates. Maximal degree in co-relation 10634. Up to 566 conditions per place. [2022-12-05 22:39:35,249 INFO L137 encePairwiseOnDemand]: 8/34 looper letters, 99 selfloop transitions, 253 changer transitions 0/352 dead transitions. [2022-12-05 22:39:35,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 352 transitions, 5256 flow [2022-12-05 22:39:35,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 22:39:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 22:39:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2022-12-05 22:39:35,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27647058823529413 [2022-12-05 22:39:35,256 INFO L175 Difference]: Start difference. First operand has 121 places, 234 transitions, 3562 flow. Second operand 15 states and 141 transitions. [2022-12-05 22:39:35,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 352 transitions, 5256 flow [2022-12-05 22:39:35,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 352 transitions, 5174 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-05 22:39:35,343 INFO L231 Difference]: Finished difference. Result has 136 places, 281 transitions, 5003 flow [2022-12-05 22:39:35,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3484, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5003, PETRI_PLACES=136, PETRI_TRANSITIONS=281} [2022-12-05 22:39:35,344 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 118 predicate places. [2022-12-05 22:39:35,344 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:35,344 INFO L89 Accepts]: Start accepts. Operand has 136 places, 281 transitions, 5003 flow [2022-12-05 22:39:35,345 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:35,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:35,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 281 transitions, 5003 flow [2022-12-05 22:39:35,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 281 transitions, 5003 flow [2022-12-05 22:39:35,395 INFO L130 PetriNetUnfolder]: 184/484 cut-off events. [2022-12-05 22:39:35,395 INFO L131 PetriNetUnfolder]: For 5311/5327 co-relation queries the response was YES. [2022-12-05 22:39:35,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 484 events. 184/484 cut-off events. For 5311/5327 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3151 event pairs, 0 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 3580. Up to 229 conditions per place. [2022-12-05 22:39:35,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 281 transitions, 5003 flow [2022-12-05 22:39:35,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 912 [2022-12-05 22:39:35,434 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:39:35,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-05 22:39:35,435 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 281 transitions, 5007 flow [2022-12-05 22:39:35,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:35,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:35,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:35,440 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-05 22:39:35,639 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,SelfDestructingSolverStorable22 [2022-12-05 22:39:35,639 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-05 22:39:35,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:35,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1361673391, now seen corresponding path program 1 times [2022-12-05 22:39:35,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:35,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583943502] [2022-12-05 22:39:35,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:35,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:35,759 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-05 22:39:35,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:35,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583943502] [2022-12-05 22:39:35,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583943502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:35,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085647988] [2022-12-05 22:39:35,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:35,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:35,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:35,762 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-05 22:39:35,784 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-05 22:39:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:35,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-05 22:39:35,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:35,911 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-05 22:39:35,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:36,038 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-05 22:39:36,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085647988] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:36,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:36,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:36,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825220228] [2022-12-05 22:39:36,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:36,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:36,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:36,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:36,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 22:39:36,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 281 transitions, 5007 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:36,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:36,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 22:39:36,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:37,984 INFO L130 PetriNetUnfolder]: 1266/2207 cut-off events. [2022-12-05 22:39:37,984 INFO L131 PetriNetUnfolder]: For 39233/39233 co-relation queries the response was YES. [2022-12-05 22:39:37,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13568 conditions, 2207 events. 1266/2207 cut-off events. For 39233/39233 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 13478 event pairs, 132 based on Foata normal form. 30/2215 useless extension candidates. Maximal degree in co-relation 13511. Up to 1395 conditions per place. [2022-12-05 22:39:37,999 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 214 selfloop transitions, 154 changer transitions 0/368 dead transitions. [2022-12-05 22:39:37,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 368 transitions, 6552 flow [2022-12-05 22:39:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 22:39:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 22:39:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-12-05 22:39:38,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23877551020408164 [2022-12-05 22:39:38,000 INFO L175 Difference]: Start difference. First operand has 136 places, 281 transitions, 5007 flow. Second operand 14 states and 117 transitions. [2022-12-05 22:39:38,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 368 transitions, 6552 flow [2022-12-05 22:39:38,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 368 transitions, 6292 flow, removed 63 selfloop flow, removed 7 redundant places. [2022-12-05 22:39:38,131 INFO L231 Difference]: Finished difference. Result has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:38,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4775, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5968, PETRI_PLACES=152, PETRI_TRANSITIONS=319} [2022-12-05 22:39:38,131 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 134 predicate places. [2022-12-05 22:39:38,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:38,131 INFO L89 Accepts]: Start accepts. Operand has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:38,133 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:38,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:38,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:38,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:38,184 INFO L130 PetriNetUnfolder]: 204/534 cut-off events. [2022-12-05 22:39:38,184 INFO L131 PetriNetUnfolder]: For 7110/7126 co-relation queries the response was YES. [2022-12-05 22:39:38,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4244 conditions, 534 events. 204/534 cut-off events. For 7110/7126 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 3613 event pairs, 0 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 4183. Up to 247 conditions per place. [2022-12-05 22:39:38,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:38,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 1026 [2022-12-05 22:39:38,190 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:38,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-05 22:39:38,191 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 319 transitions, 5968 flow [2022-12-05 22:39:38,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:38,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:38,191 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:38,197 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-05 22:39:38,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-05 22:39:38,392 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-05 22:39:38,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash 550722893, now seen corresponding path program 1 times [2022-12-05 22:39:38,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:38,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897328076] [2022-12-05 22:39:38,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:38,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:38,505 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-05 22:39:38,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:38,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897328076] [2022-12-05 22:39:38,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897328076] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:38,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818164535] [2022-12-05 22:39:38,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:38,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:38,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:38,512 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-05 22:39:38,514 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-05 22:39:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:38,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:39:38,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:38,664 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-05 22:39:38,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:38,770 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-05 22:39:38,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818164535] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:38,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:38,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:39:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581117055] [2022-12-05 22:39:38,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:38,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:39:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:38,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:39:38,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:39:38,772 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 22:39:38,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 319 transitions, 5968 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:38,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:38,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 22:39:38,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:40,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:39:42,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:39:43,202 INFO L130 PetriNetUnfolder]: 1318/2311 cut-off events. [2022-12-05 22:39:43,202 INFO L131 PetriNetUnfolder]: For 48020/48020 co-relation queries the response was YES. [2022-12-05 22:39:43,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14893 conditions, 2311 events. 1318/2311 cut-off events. For 48020/48020 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 14246 event pairs, 169 based on Foata normal form. 28/2320 useless extension candidates. Maximal degree in co-relation 14829. Up to 1570 conditions per place. [2022-12-05 22:39:43,220 INFO L137 encePairwiseOnDemand]: 9/35 looper letters, 224 selfloop transitions, 160 changer transitions 2/386 dead transitions. [2022-12-05 22:39:43,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 386 transitions, 7310 flow [2022-12-05 22:39:43,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 22:39:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 22:39:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-12-05 22:39:43,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22197802197802197 [2022-12-05 22:39:43,221 INFO L175 Difference]: Start difference. First operand has 152 places, 319 transitions, 5968 flow. Second operand 13 states and 101 transitions. [2022-12-05 22:39:43,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 386 transitions, 7310 flow [2022-12-05 22:39:43,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 386 transitions, 7184 flow, removed 54 selfloop flow, removed 2 redundant places. [2022-12-05 22:39:43,403 INFO L231 Difference]: Finished difference. Result has 166 places, 345 transitions, 6868 flow [2022-12-05 22:39:43,403 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5842, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6868, PETRI_PLACES=166, PETRI_TRANSITIONS=345} [2022-12-05 22:39:43,404 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 148 predicate places. [2022-12-05 22:39:43,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:43,404 INFO L89 Accepts]: Start accepts. Operand has 166 places, 345 transitions, 6868 flow [2022-12-05 22:39:43,405 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:43,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:43,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 345 transitions, 6868 flow [2022-12-05 22:39:43,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 345 transitions, 6868 flow [2022-12-05 22:39:43,461 INFO L130 PetriNetUnfolder]: 216/569 cut-off events. [2022-12-05 22:39:43,461 INFO L131 PetriNetUnfolder]: For 8975/8995 co-relation queries the response was YES. [2022-12-05 22:39:43,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4751 conditions, 569 events. 216/569 cut-off events. For 8975/8995 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3852 event pairs, 0 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 4686. Up to 258 conditions per place. [2022-12-05 22:39:43,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 345 transitions, 6868 flow [2022-12-05 22:39:43,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-05 22:39:43,468 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:43,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-05 22:39:43,468 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 345 transitions, 6868 flow [2022-12-05 22:39:43,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:43,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:43,469 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:43,473 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-05 22:39:43,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:43,670 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-05 22:39:43,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:43,670 INFO L85 PathProgramCache]: Analyzing trace with hash 736368882, now seen corresponding path program 2 times [2022-12-05 22:39:43,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:43,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520371341] [2022-12-05 22:39:43,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:43,801 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-05 22:39:43,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:43,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520371341] [2022-12-05 22:39:43,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520371341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:43,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987067317] [2022-12-05 22:39:43,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 22:39:43,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:43,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:43,803 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-05 22:39:43,804 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-05 22:39:43,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 22:39:43,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 22:39:43,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:39:43,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:43,956 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-05 22:39:43,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:44,103 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-05 22:39:44,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987067317] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:44,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:44,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:44,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266788066] [2022-12-05 22:39:44,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:44,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:44,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:44,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:44,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:44,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-05 22:39:44,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 345 transitions, 6868 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:44,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:44,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-05 22:39:44,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:44,998 INFO L130 PetriNetUnfolder]: 1548/2695 cut-off events. [2022-12-05 22:39:44,998 INFO L131 PetriNetUnfolder]: For 60796/60796 co-relation queries the response was YES. [2022-12-05 22:39:45,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18203 conditions, 2695 events. 1548/2695 cut-off events. For 60796/60796 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 17079 event pairs, 130 based on Foata normal form. 18/2694 useless extension candidates. Maximal degree in co-relation 18135. Up to 1299 conditions per place. [2022-12-05 22:39:45,016 INFO L137 encePairwiseOnDemand]: 10/35 looper letters, 223 selfloop transitions, 231 changer transitions 0/454 dead transitions. [2022-12-05 22:39:45,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 454 transitions, 9007 flow [2022-12-05 22:39:45,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-05 22:39:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-05 22:39:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 132 transitions. [2022-12-05 22:39:45,017 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25142857142857145 [2022-12-05 22:39:45,017 INFO L175 Difference]: Start difference. First operand has 166 places, 345 transitions, 6868 flow. Second operand 15 states and 132 transitions. [2022-12-05 22:39:45,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 454 transitions, 9007 flow [2022-12-05 22:39:45,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 454 transitions, 8815 flow, removed 64 selfloop flow, removed 6 redundant places. [2022-12-05 22:39:45,287 INFO L231 Difference]: Finished difference. Result has 179 places, 393 transitions, 8338 flow [2022-12-05 22:39:45,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=6702, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8338, PETRI_PLACES=179, PETRI_TRANSITIONS=393} [2022-12-05 22:39:45,287 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 161 predicate places. [2022-12-05 22:39:45,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:45,287 INFO L89 Accepts]: Start accepts. Operand has 179 places, 393 transitions, 8338 flow [2022-12-05 22:39:45,289 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:45,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:45,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 393 transitions, 8338 flow [2022-12-05 22:39:45,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 393 transitions, 8338 flow [2022-12-05 22:39:45,395 INFO L130 PetriNetUnfolder]: 256/671 cut-off events. [2022-12-05 22:39:45,396 INFO L131 PetriNetUnfolder]: For 13106/13126 co-relation queries the response was YES. [2022-12-05 22:39:45,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6049 conditions, 671 events. 256/671 cut-off events. For 13106/13126 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 4827 event pairs, 0 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 5979. Up to 323 conditions per place. [2022-12-05 22:39:45,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 393 transitions, 8338 flow [2022-12-05 22:39:45,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 1242 [2022-12-05 22:39:45,482 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:39:45,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-05 22:39:45,483 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 393 transitions, 8358 flow [2022-12-05 22:39:45,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:45,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:45,483 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:45,494 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-05 22:39:45,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:45,688 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-05 22:39:45,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:45,688 INFO L85 PathProgramCache]: Analyzing trace with hash 731749789, now seen corresponding path program 1 times [2022-12-05 22:39:45,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:45,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391453853] [2022-12-05 22:39:45,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:45,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:45,813 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-05 22:39:45,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:45,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391453853] [2022-12-05 22:39:45,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391453853] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:45,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721000522] [2022-12-05 22:39:45,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:45,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:45,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:45,816 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-05 22:39:45,842 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-05 22:39:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:45,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:39:45,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:46,004 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-05 22:39:46,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:46,144 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-05 22:39:46,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721000522] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:46,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:46,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244033732] [2022-12-05 22:39:46,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:46,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:46,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:46,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:46,145 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 22:39:46,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 393 transitions, 8358 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:46,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:46,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 22:39:46,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:49,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:39:51,131 INFO L130 PetriNetUnfolder]: 1630/2859 cut-off events. [2022-12-05 22:39:51,132 INFO L131 PetriNetUnfolder]: For 96874/96874 co-relation queries the response was YES. [2022-12-05 22:39:51,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20519 conditions, 2859 events. 1630/2859 cut-off events. For 96874/96874 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 18512 event pairs, 232 based on Foata normal form. 54/2902 useless extension candidates. Maximal degree in co-relation 20446. Up to 2077 conditions per place. [2022-12-05 22:39:51,152 INFO L137 encePairwiseOnDemand]: 10/37 looper letters, 297 selfloop transitions, 172 changer transitions 0/469 dead transitions. [2022-12-05 22:39:51,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 469 transitions, 10196 flow [2022-12-05 22:39:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 22:39:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 22:39:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 107 transitions. [2022-12-05 22:39:51,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22245322245322247 [2022-12-05 22:39:51,154 INFO L175 Difference]: Start difference. First operand has 179 places, 393 transitions, 8358 flow. Second operand 13 states and 107 transitions. [2022-12-05 22:39:51,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 469 transitions, 10196 flow [2022-12-05 22:39:51,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 469 transitions, 9995 flow, removed 70 selfloop flow, removed 5 redundant places. [2022-12-05 22:39:51,525 INFO L231 Difference]: Finished difference. Result has 191 places, 427 transitions, 9563 flow [2022-12-05 22:39:51,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8181, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9563, PETRI_PLACES=191, PETRI_TRANSITIONS=427} [2022-12-05 22:39:51,526 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 173 predicate places. [2022-12-05 22:39:51,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:51,526 INFO L89 Accepts]: Start accepts. Operand has 191 places, 427 transitions, 9563 flow [2022-12-05 22:39:51,528 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:51,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:51,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 427 transitions, 9563 flow [2022-12-05 22:39:51,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 427 transitions, 9563 flow [2022-12-05 22:39:51,631 INFO L130 PetriNetUnfolder]: 276/730 cut-off events. [2022-12-05 22:39:51,631 INFO L131 PetriNetUnfolder]: For 15611/15638 co-relation queries the response was YES. [2022-12-05 22:39:51,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6817 conditions, 730 events. 276/730 cut-off events. For 15611/15638 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 5305 event pairs, 0 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 6743. Up to 356 conditions per place. [2022-12-05 22:39:51,641 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 427 transitions, 9563 flow [2022-12-05 22:39:51,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 1324 [2022-12-05 22:39:51,643 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:51,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-05 22:39:51,643 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 427 transitions, 9563 flow [2022-12-05 22:39:51,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:51,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:51,644 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:51,655 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-05 22:39:51,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-05 22:39:51,849 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-05 22:39:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:51,849 INFO L85 PathProgramCache]: Analyzing trace with hash 738796802, now seen corresponding path program 1 times [2022-12-05 22:39:51,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:51,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656319301] [2022-12-05 22:39:51,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:51,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:51,984 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-05 22:39:51,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:51,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656319301] [2022-12-05 22:39:51,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656319301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:51,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129666267] [2022-12-05 22:39:51,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:51,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:51,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:51,988 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-05 22:39:52,014 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-05 22:39:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:52,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:39:52,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:52,220 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-05 22:39:52,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:52,358 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-05 22:39:52,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129666267] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:52,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:52,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:52,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406707920] [2022-12-05 22:39:52,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:52,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:52,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:52,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:52,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 22:39:52,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 427 transitions, 9563 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:52,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:52,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 22:39:52,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:39:54,619 INFO L130 PetriNetUnfolder]: 1862/3261 cut-off events. [2022-12-05 22:39:54,620 INFO L131 PetriNetUnfolder]: For 145519/145519 co-relation queries the response was YES. [2022-12-05 22:39:54,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24250 conditions, 3261 events. 1862/3261 cut-off events. For 145519/145519 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 21458 event pairs, 186 based on Foata normal form. 70/3314 useless extension candidates. Maximal degree in co-relation 24173. Up to 1795 conditions per place. [2022-12-05 22:39:54,642 INFO L137 encePairwiseOnDemand]: 10/37 looper letters, 277 selfloop transitions, 279 changer transitions 0/556 dead transitions. [2022-12-05 22:39:54,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 556 transitions, 12519 flow [2022-12-05 22:39:54,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 22:39:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 22:39:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 145 transitions. [2022-12-05 22:39:54,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21771771771771772 [2022-12-05 22:39:54,644 INFO L175 Difference]: Start difference. First operand has 191 places, 427 transitions, 9563 flow. Second operand 18 states and 145 transitions. [2022-12-05 22:39:54,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 556 transitions, 12519 flow [2022-12-05 22:39:55,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 556 transitions, 12350 flow, removed 54 selfloop flow, removed 4 redundant places. [2022-12-05 22:39:55,093 INFO L231 Difference]: Finished difference. Result has 211 places, 492 transitions, 11769 flow [2022-12-05 22:39:55,093 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9394, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=11769, PETRI_PLACES=211, PETRI_TRANSITIONS=492} [2022-12-05 22:39:55,094 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 193 predicate places. [2022-12-05 22:39:55,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:39:55,094 INFO L89 Accepts]: Start accepts. Operand has 211 places, 492 transitions, 11769 flow [2022-12-05 22:39:55,097 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:39:55,097 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:39:55,097 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 492 transitions, 11769 flow [2022-12-05 22:39:55,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 492 transitions, 11769 flow [2022-12-05 22:39:55,213 INFO L130 PetriNetUnfolder]: 304/805 cut-off events. [2022-12-05 22:39:55,213 INFO L131 PetriNetUnfolder]: For 23218/23245 co-relation queries the response was YES. [2022-12-05 22:39:55,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8073 conditions, 805 events. 304/805 cut-off events. For 23218/23245 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 5907 event pairs, 0 based on Foata normal form. 0/802 useless extension candidates. Maximal degree in co-relation 7991. Up to 402 conditions per place. [2022-12-05 22:39:55,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 492 transitions, 11769 flow [2022-12-05 22:39:55,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 1524 [2022-12-05 22:39:55,224 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:39:55,225 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-05 22:39:55,225 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 492 transitions, 11769 flow [2022-12-05 22:39:55,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:55,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:39:55,226 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:39:55,230 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-05 22:39:55,428 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,SelfDestructingSolverStorable27 [2022-12-05 22:39:55,428 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-05 22:39:55,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:39:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash -173017476, now seen corresponding path program 1 times [2022-12-05 22:39:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:39:55,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577541700] [2022-12-05 22:39:55,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:55,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:39:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:55,560 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-05 22:39:55,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:39:55,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577541700] [2022-12-05 22:39:55,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577541700] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:39:55,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997119648] [2022-12-05 22:39:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:39:55,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:39:55,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:39:55,565 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-05 22:39:55,590 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-05 22:39:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:39:55,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:39:55,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:39:55,743 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-05 22:39:55,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:39:55,867 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-05 22:39:55,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997119648] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:39:55,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:39:55,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:39:55,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294910806] [2022-12-05 22:39:55,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:39:55,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:39:55,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:39:55,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:39:55,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:39:55,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 22:39:55,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 492 transitions, 11769 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:39:55,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:39:55,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 22:39:55,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:06,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:40:08,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:40:10,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:40:12,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:40:19,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:40:21,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:40:27,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:40:29,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:40:34,716 INFO L130 PetriNetUnfolder]: 1938/3413 cut-off events. [2022-12-05 22:40:34,716 INFO L131 PetriNetUnfolder]: For 131093/131093 co-relation queries the response was YES. [2022-12-05 22:40:34,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26894 conditions, 3413 events. 1938/3413 cut-off events. For 131093/131093 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 22838 event pairs, 264 based on Foata normal form. 24/3420 useless extension candidates. Maximal degree in co-relation 26809. Up to 2520 conditions per place. [2022-12-05 22:40:34,737 INFO L137 encePairwiseOnDemand]: 9/37 looper letters, 393 selfloop transitions, 204 changer transitions 5/602 dead transitions. [2022-12-05 22:40:34,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 602 transitions, 14095 flow [2022-12-05 22:40:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-05 22:40:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-05 22:40:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 154 transitions. [2022-12-05 22:40:34,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17342342342342343 [2022-12-05 22:40:34,739 INFO L175 Difference]: Start difference. First operand has 211 places, 492 transitions, 11769 flow. Second operand 24 states and 154 transitions. [2022-12-05 22:40:34,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 602 transitions, 14095 flow [2022-12-05 22:40:35,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 602 transitions, 13721 flow, removed 170 selfloop flow, removed 3 redundant places. [2022-12-05 22:40:35,236 INFO L231 Difference]: Finished difference. Result has 235 places, 530 transitions, 13051 flow [2022-12-05 22:40:35,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11395, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=13051, PETRI_PLACES=235, PETRI_TRANSITIONS=530} [2022-12-05 22:40:35,237 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 217 predicate places. [2022-12-05 22:40:35,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:35,237 INFO L89 Accepts]: Start accepts. Operand has 235 places, 530 transitions, 13051 flow [2022-12-05 22:40:35,240 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:35,240 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:35,240 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 530 transitions, 13051 flow [2022-12-05 22:40:35,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 530 transitions, 13051 flow [2022-12-05 22:40:35,389 INFO L130 PetriNetUnfolder]: 325/864 cut-off events. [2022-12-05 22:40:35,389 INFO L131 PetriNetUnfolder]: For 27729/27764 co-relation queries the response was YES. [2022-12-05 22:40:35,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8871 conditions, 864 events. 325/864 cut-off events. For 27729/27764 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 6532 event pairs, 0 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 8784. Up to 433 conditions per place. [2022-12-05 22:40:35,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 530 transitions, 13051 flow [2022-12-05 22:40:35,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 1596 [2022-12-05 22:40:35,759 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 22:40:35,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 523 [2022-12-05 22:40:35,760 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 530 transitions, 13127 flow [2022-12-05 22:40:35,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:35,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:35,760 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:35,764 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-05 22:40:35,963 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,SelfDestructingSolverStorable28 [2022-12-05 22:40:35,963 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-05 22:40:35,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:35,964 INFO L85 PathProgramCache]: Analyzing trace with hash -102812985, now seen corresponding path program 1 times [2022-12-05 22:40:35,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:35,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018110402] [2022-12-05 22:40:35,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:35,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:36,088 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-05 22:40:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:36,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018110402] [2022-12-05 22:40:36,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018110402] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:36,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127440977] [2022-12-05 22:40:36,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:36,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:36,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:36,092 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-05 22:40:36,117 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-05 22:40:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:36,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:40:36,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:36,296 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-05 22:40:36,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:36,440 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-05 22:40:36,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127440977] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:36,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:36,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:40:36,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629784045] [2022-12-05 22:40:36,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:36,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:40:36,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:36,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:40:36,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:40:36,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-05 22:40:36,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 530 transitions, 13127 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:36,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:36,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-05 22:40:36,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:40:43,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:40:45,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:40:48,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:40:54,060 WARN L233 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 30 DAG size of output: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:40:54,943 INFO L130 PetriNetUnfolder]: 2272/4005 cut-off events. [2022-12-05 22:40:54,943 INFO L131 PetriNetUnfolder]: For 191089/191089 co-relation queries the response was YES. [2022-12-05 22:40:54,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32870 conditions, 4005 events. 2272/4005 cut-off events. For 191089/191089 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 27641 event pairs, 172 based on Foata normal form. 32/4020 useless extension candidates. Maximal degree in co-relation 32780. Up to 2143 conditions per place. [2022-12-05 22:40:54,979 INFO L137 encePairwiseOnDemand]: 8/43 looper letters, 358 selfloop transitions, 368 changer transitions 1/727 dead transitions. [2022-12-05 22:40:54,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 727 transitions, 17746 flow [2022-12-05 22:40:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-05 22:40:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-05 22:40:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 191 transitions. [2022-12-05 22:40:54,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1708407871198569 [2022-12-05 22:40:54,981 INFO L175 Difference]: Start difference. First operand has 235 places, 530 transitions, 13127 flow. Second operand 26 states and 191 transitions. [2022-12-05 22:40:54,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 727 transitions, 17746 flow [2022-12-05 22:40:55,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 727 transitions, 17513 flow, removed 53 selfloop flow, removed 14 redundant places. [2022-12-05 22:40:55,628 INFO L231 Difference]: Finished difference. Result has 256 places, 638 transitions, 16981 flow [2022-12-05 22:40:55,629 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=12894, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=279, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=16981, PETRI_PLACES=256, PETRI_TRANSITIONS=638} [2022-12-05 22:40:55,629 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 238 predicate places. [2022-12-05 22:40:55,629 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:40:55,629 INFO L89 Accepts]: Start accepts. Operand has 256 places, 638 transitions, 16981 flow [2022-12-05 22:40:55,631 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:40:55,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:40:55,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 638 transitions, 16981 flow [2022-12-05 22:40:55,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 638 transitions, 16981 flow [2022-12-05 22:40:55,808 INFO L130 PetriNetUnfolder]: 387/1026 cut-off events. [2022-12-05 22:40:55,808 INFO L131 PetriNetUnfolder]: For 40344/40373 co-relation queries the response was YES. [2022-12-05 22:40:55,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11447 conditions, 1026 events. 387/1026 cut-off events. For 40344/40373 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 8050 event pairs, 0 based on Foata normal form. 0/1023 useless extension candidates. Maximal degree in co-relation 11348. Up to 547 conditions per place. [2022-12-05 22:40:55,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 638 transitions, 16981 flow [2022-12-05 22:40:55,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 1872 [2022-12-05 22:40:55,866 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 10) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:40:55,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 10)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:40:56,081 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L687-5-->L687-5: Formula: (and (= v_~i~0_137 (+ (* v_~j~0_135 2) v_~i~0_139)) (< v_~p~0_72 9) (= v_~p~0_70 (+ v_~p~0_72 2))) InVars {~j~0=v_~j~0_135, ~i~0=v_~i~0_139, ~p~0=v_~p~0_72} OutVars{~j~0=v_~j~0_135, ~i~0=v_~i~0_137, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_47|, ~p~0=v_~p~0_70} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [392] L705-6-->L687-5: Formula: (and (= v_~i~0_263 (+ v_~j~0_333 v_~i~0_264)) (= (+ (* 17711 v_~cur~0_284) (* 10946 v_~prev~0_329)) v_~prev~0_328) (= v_~next~0_180 (+ (* v_~prev~0_329 17711) (* 28657 v_~cur~0_284))) (< v_~p~0_144 10) (= v_~next~0_180 v_~cur~0_283) (= (+ v_~p~0_144 1) v_~p~0_143) (= (+ 22 v_~x~0_323) v_~x~0_322) (< v_~x~0_322 23)) InVars {~j~0=v_~j~0_333, ~prev~0=v_~prev~0_329, ~i~0=v_~i~0_264, ~p~0=v_~p~0_144, ~cur~0=v_~cur~0_284, ~x~0=v_~x~0_323} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_205|, ~j~0=v_~j~0_333, ~next~0=v_~next~0_180, ~prev~0=v_~prev~0_328, ~i~0=v_~i~0_263, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_111|, ~p~0=v_~p~0_143, ~cur~0=v_~cur~0_283, ~x~0=v_~x~0_322} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-05 22:40:56,161 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [362] L687-5-->L687-5: Formula: (and (= v_~i~0_137 (+ (* v_~j~0_135 2) v_~i~0_139)) (< v_~p~0_72 9) (= v_~p~0_70 (+ v_~p~0_72 2))) InVars {~j~0=v_~j~0_135, ~i~0=v_~i~0_139, ~p~0=v_~p~0_72} OutVars{~j~0=v_~j~0_135, ~i~0=v_~i~0_137, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_47|, ~p~0=v_~p~0_70} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] and [393] L705-6-->L687-5: Formula: (and (< v_~x~0_326 23) (= v_~next~0_182 v_~cur~0_287) (= (+ v_~p~0_149 2) v_~p~0_147) (= (+ 22 v_~x~0_327) v_~x~0_326) (< v_~p~0_149 9) (= (+ v_~i~0_269 (* v_~j~0_335 2)) v_~i~0_267) (= (+ (* 17711 v_~cur~0_288) (* 10946 v_~prev~0_333)) v_~prev~0_332) (= (+ (* 28657 v_~cur~0_288) (* v_~prev~0_333 17711)) v_~next~0_182)) InVars {~j~0=v_~j~0_335, ~prev~0=v_~prev~0_333, ~i~0=v_~i~0_269, ~p~0=v_~p~0_149, ~cur~0=v_~cur~0_288, ~x~0=v_~x~0_327} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_207|, ~j~0=v_~j~0_335, ~next~0=v_~next~0_182, ~prev~0=v_~prev~0_332, ~i~0=v_~i~0_267, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_113|, ~p~0=v_~p~0_147, ~cur~0=v_~cur~0_287, ~x~0=v_~x~0_326} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0, ~cur~0, ~x~0] [2022-12-05 22:40:56,299 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:40:56,300 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 671 [2022-12-05 22:40:56,300 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 638 transitions, 17087 flow [2022-12-05 22:40:56,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:56,300 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:40:56,300 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:40:56,304 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-05 22:40:56,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:56,503 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-05 22:40:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:40:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash -118362926, now seen corresponding path program 1 times [2022-12-05 22:40:56,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:40:56,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708265717] [2022-12-05 22:40:56,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:56,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:40:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:56,631 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-05 22:40:56,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:40:56,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708265717] [2022-12-05 22:40:56,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708265717] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:40:56,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95716837] [2022-12-05 22:40:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:40:56,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:40:56,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:40:56,636 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-05 22:40:56,642 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-05 22:40:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:40:56,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:40:56,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:40:56,813 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-05 22:40:56,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:40:56,950 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-05 22:40:56,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95716837] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:40:56,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:40:56,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:40:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867005115] [2022-12-05 22:40:56,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:40:56,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:40:56,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:40:56,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:40:56,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:40:56,951 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-05 22:40:56,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 638 transitions, 17087 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:40:56,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:40:56,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-05 22:40:56,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:06,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:41:08,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:41:09,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:41:11,426 INFO L130 PetriNetUnfolder]: 2406/4273 cut-off events. [2022-12-05 22:41:11,426 INFO L131 PetriNetUnfolder]: For 245348/245348 co-relation queries the response was YES. [2022-12-05 22:41:11,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37399 conditions, 4273 events. 2406/4273 cut-off events. For 245348/245348 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 30101 event pairs, 347 based on Foata normal form. 38/4286 useless extension candidates. Maximal degree in co-relation 37297. Up to 2736 conditions per place. [2022-12-05 22:41:11,459 INFO L137 encePairwiseOnDemand]: 8/49 looper letters, 423 selfloop transitions, 350 changer transitions 4/777 dead transitions. [2022-12-05 22:41:11,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 777 transitions, 20498 flow [2022-12-05 22:41:11,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-05 22:41:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-05 22:41:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 175 transitions. [2022-12-05 22:41:11,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13736263736263737 [2022-12-05 22:41:11,461 INFO L175 Difference]: Start difference. First operand has 256 places, 638 transitions, 17087 flow. Second operand 26 states and 175 transitions. [2022-12-05 22:41:11,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 777 transitions, 20498 flow [2022-12-05 22:41:12,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 777 transitions, 19533 flow, removed 405 selfloop flow, removed 12 redundant places. [2022-12-05 22:41:12,387 INFO L231 Difference]: Finished difference. Result has 276 places, 701 transitions, 19038 flow [2022-12-05 22:41:12,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=16122, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=296, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=19038, PETRI_PLACES=276, PETRI_TRANSITIONS=701} [2022-12-05 22:41:12,388 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 258 predicate places. [2022-12-05 22:41:12,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:41:12,388 INFO L89 Accepts]: Start accepts. Operand has 276 places, 701 transitions, 19038 flow [2022-12-05 22:41:12,392 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:41:12,392 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:41:12,392 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 276 places, 701 transitions, 19038 flow [2022-12-05 22:41:12,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 701 transitions, 19038 flow [2022-12-05 22:41:12,629 INFO L130 PetriNetUnfolder]: 422/1122 cut-off events. [2022-12-05 22:41:12,629 INFO L131 PetriNetUnfolder]: For 47846/47949 co-relation queries the response was YES. [2022-12-05 22:41:12,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12684 conditions, 1122 events. 422/1122 cut-off events. For 47846/47949 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 8924 event pairs, 0 based on Foata normal form. 0/1119 useless extension candidates. Maximal degree in co-relation 12579. Up to 601 conditions per place. [2022-12-05 22:41:12,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 701 transitions, 19038 flow [2022-12-05 22:41:12,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 1996 [2022-12-05 22:41:13,100 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-05 22:41:13,101 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 713 [2022-12-05 22:41:13,101 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 701 transitions, 19141 flow [2022-12-05 22:41:13,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:13,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:41:13,101 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:41:13,107 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-05 22:41:13,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:13,303 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-05 22:41:13,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:41:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash -117397121, now seen corresponding path program 1 times [2022-12-05 22:41:13,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:41:13,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866275878] [2022-12-05 22:41:13,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:13,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:41:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:13,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-05 22:41:13,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:41:13,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866275878] [2022-12-05 22:41:13,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866275878] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:41:13,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116143205] [2022-12-05 22:41:13,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:41:13,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:41:13,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:41:13,428 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-05 22:41:13,475 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-05 22:41:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:41:13,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:41:13,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:41:13,647 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-05 22:41:13,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:41:13,807 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-05 22:41:13,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116143205] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:41:13,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:41:13,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:41:13,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376365566] [2022-12-05 22:41:13,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:41:13,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:41:13,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:41:13,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:41:13,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:41:13,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-05 22:41:13,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 701 transitions, 19141 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:41:13,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:41:13,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-05 22:41:13,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:41:24,012 WARN L233 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 36 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:41:30,106 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 36 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:41:38,096 WARN L233 SmtUtils]: Spent 7.98s on a formula simplification. DAG size of input: 40 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:41:39,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:41:41,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:41:43,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:41:54,412 WARN L233 SmtUtils]: Spent 7.94s on a formula simplification. DAG size of input: 34 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:41:56,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:42:00,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:42:02,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:42:04,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:42:06,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:42:08,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:42:09,971 INFO L130 PetriNetUnfolder]: 2521/4504 cut-off events. [2022-12-05 22:42:09,971 INFO L131 PetriNetUnfolder]: For 285451/285451 co-relation queries the response was YES. [2022-12-05 22:42:09,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40061 conditions, 4504 events. 2521/4504 cut-off events. For 285451/285451 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 32247 event pairs, 328 based on Foata normal form. 38/4525 useless extension candidates. Maximal degree in co-relation 39953. Up to 2871 conditions per place. [2022-12-05 22:42:10,004 INFO L137 encePairwiseOnDemand]: 8/55 looper letters, 446 selfloop transitions, 392 changer transitions 4/842 dead transitions. [2022-12-05 22:42:10,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 842 transitions, 22795 flow [2022-12-05 22:42:10,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-05 22:42:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-05 22:42:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 189 transitions. [2022-12-05 22:42:10,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12727272727272726 [2022-12-05 22:42:10,006 INFO L175 Difference]: Start difference. First operand has 275 places, 701 transitions, 19141 flow. Second operand 27 states and 189 transitions. [2022-12-05 22:42:10,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 842 transitions, 22795 flow [2022-12-05 22:42:11,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 842 transitions, 21556 flow, removed 570 selfloop flow, removed 8 redundant places. [2022-12-05 22:42:11,267 INFO L231 Difference]: Finished difference. Result has 299 places, 761 transitions, 20960 flow [2022-12-05 22:42:11,267 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=18110, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=20960, PETRI_PLACES=299, PETRI_TRANSITIONS=761} [2022-12-05 22:42:11,267 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 281 predicate places. [2022-12-05 22:42:11,268 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:11,268 INFO L89 Accepts]: Start accepts. Operand has 299 places, 761 transitions, 20960 flow [2022-12-05 22:42:11,269 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:11,269 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:11,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 761 transitions, 20960 flow [2022-12-05 22:42:11,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 761 transitions, 20960 flow [2022-12-05 22:42:11,480 INFO L130 PetriNetUnfolder]: 451/1210 cut-off events. [2022-12-05 22:42:11,480 INFO L131 PetriNetUnfolder]: For 56008/56088 co-relation queries the response was YES. [2022-12-05 22:42:11,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13924 conditions, 1210 events. 451/1210 cut-off events. For 56008/56088 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 9836 event pairs, 0 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 13813. Up to 658 conditions per place. [2022-12-05 22:42:11,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 761 transitions, 20960 flow [2022-12-05 22:42:11,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 2118 [2022-12-05 22:42:11,499 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:42:11,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-05 22:42:11,500 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 761 transitions, 20960 flow [2022-12-05 22:42:11,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:11,500 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:11,500 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:11,510 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-05 22:42:11,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:11,705 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-05 22:42:11,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash 68073323, now seen corresponding path program 1 times [2022-12-05 22:42:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:11,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978574604] [2022-12-05 22:42:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:11,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:11,801 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-05 22:42:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:11,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978574604] [2022-12-05 22:42:11,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978574604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:11,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797738777] [2022-12-05 22:42:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:11,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:11,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:11,804 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-05 22:42:11,804 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-05 22:42:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:11,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:42:11,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:11,940 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-05 22:42:11,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:12,076 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-05 22:42:12,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797738777] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:12,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:12,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:42:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565962194] [2022-12-05 22:42:12,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:12,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:42:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:12,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:42:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:42:12,078 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-05 22:42:12,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 761 transitions, 20960 flow. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:12,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:12,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-05 22:42:12,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:15,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:42:17,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:42:18,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:42:20,289 INFO L130 PetriNetUnfolder]: 2597/4656 cut-off events. [2022-12-05 22:42:20,289 INFO L131 PetriNetUnfolder]: For 293298/293298 co-relation queries the response was YES. [2022-12-05 22:42:20,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41898 conditions, 4656 events. 2597/4656 cut-off events. For 293298/293298 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 33925 event pairs, 456 based on Foata normal form. 28/4667 useless extension candidates. Maximal degree in co-relation 41784. Up to 3570 conditions per place. [2022-12-05 22:42:20,326 INFO L137 encePairwiseOnDemand]: 8/55 looper letters, 576 selfloop transitions, 261 changer transitions 2/839 dead transitions. [2022-12-05 22:42:20,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 839 transitions, 23690 flow [2022-12-05 22:42:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 22:42:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 22:42:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 126 transitions. [2022-12-05 22:42:20,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16363636363636364 [2022-12-05 22:42:20,328 INFO L175 Difference]: Start difference. First operand has 299 places, 761 transitions, 20960 flow. Second operand 14 states and 126 transitions. [2022-12-05 22:42:20,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 839 transitions, 23690 flow [2022-12-05 22:42:21,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 839 transitions, 23122 flow, removed 218 selfloop flow, removed 11 redundant places. [2022-12-05 22:42:21,766 INFO L231 Difference]: Finished difference. Result has 305 places, 795 transitions, 22218 flow [2022-12-05 22:42:21,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=20416, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=22218, PETRI_PLACES=305, PETRI_TRANSITIONS=795} [2022-12-05 22:42:21,767 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 287 predicate places. [2022-12-05 22:42:21,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:21,767 INFO L89 Accepts]: Start accepts. Operand has 305 places, 795 transitions, 22218 flow [2022-12-05 22:42:21,772 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:21,772 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:21,772 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 795 transitions, 22218 flow [2022-12-05 22:42:21,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 795 transitions, 22218 flow [2022-12-05 22:42:22,051 INFO L130 PetriNetUnfolder]: 471/1270 cut-off events. [2022-12-05 22:42:22,051 INFO L131 PetriNetUnfolder]: For 63021/63122 co-relation queries the response was YES. [2022-12-05 22:42:22,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14869 conditions, 1270 events. 471/1270 cut-off events. For 63021/63122 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 10545 event pairs, 1 based on Foata normal form. 0/1267 useless extension candidates. Maximal degree in co-relation 14753. Up to 690 conditions per place. [2022-12-05 22:42:22,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 305 places, 795 transitions, 22218 flow [2022-12-05 22:42:22,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 2194 [2022-12-05 22:42:22,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:42:22,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 385 [2022-12-05 22:42:22,152 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 795 transitions, 22235 flow [2022-12-05 22:42:22,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:22,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:22,153 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:22,158 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-05 22:42:22,357 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,SelfDestructingSolverStorable32 [2022-12-05 22:42:22,357 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-05 22:42:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash -85802882, now seen corresponding path program 1 times [2022-12-05 22:42:22,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:22,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128863498] [2022-12-05 22:42:22,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:22,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:22,496 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-05 22:42:22,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:22,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128863498] [2022-12-05 22:42:22,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128863498] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:22,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025401977] [2022-12-05 22:42:22,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:22,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:22,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:22,498 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-05 22:42:22,501 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-05 22:42:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:22,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:42:22,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:22,665 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-05 22:42:22,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:22,801 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-05 22:42:22,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025401977] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:22,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:22,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:42:22,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743639381] [2022-12-05 22:42:22,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:22,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:42:22,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:22,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:42:22,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:42:22,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-05 22:42:22,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 795 transitions, 22235 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:22,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:22,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-05 22:42:22,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:29,285 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 37 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:42:35,652 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 31 DAG size of output: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:42:37,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:42:39,168 INFO L130 PetriNetUnfolder]: 2929/5244 cut-off events. [2022-12-05 22:42:39,169 INFO L131 PetriNetUnfolder]: For 378891/378891 co-relation queries the response was YES. [2022-12-05 22:42:39,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48749 conditions, 5244 events. 2929/5244 cut-off events. For 378891/378891 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 38777 event pairs, 309 based on Foata normal form. 32/5259 useless extension candidates. Maximal degree in co-relation 48630. Up to 2854 conditions per place. [2022-12-05 22:42:39,272 INFO L137 encePairwiseOnDemand]: 8/56 looper letters, 495 selfloop transitions, 493 changer transitions 1/989 dead transitions. [2022-12-05 22:42:39,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 989 transitions, 27746 flow [2022-12-05 22:42:39,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-05 22:42:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-05 22:42:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 202 transitions. [2022-12-05 22:42:39,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13873626373626374 [2022-12-05 22:42:39,273 INFO L175 Difference]: Start difference. First operand has 305 places, 795 transitions, 22235 flow. Second operand 26 states and 202 transitions. [2022-12-05 22:42:39,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 989 transitions, 27746 flow [2022-12-05 22:42:40,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 989 transitions, 27515 flow, removed 44 selfloop flow, removed 9 redundant places. [2022-12-05 22:42:40,902 INFO L231 Difference]: Finished difference. Result has 331 places, 901 transitions, 26783 flow [2022-12-05 22:42:40,902 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=22012, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=26783, PETRI_PLACES=331, PETRI_TRANSITIONS=901} [2022-12-05 22:42:40,903 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 313 predicate places. [2022-12-05 22:42:40,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:40,903 INFO L89 Accepts]: Start accepts. Operand has 331 places, 901 transitions, 26783 flow [2022-12-05 22:42:40,909 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:40,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:40,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 331 places, 901 transitions, 26783 flow [2022-12-05 22:42:40,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 901 transitions, 26783 flow [2022-12-05 22:42:41,368 INFO L130 PetriNetUnfolder]: 531/1428 cut-off events. [2022-12-05 22:42:41,368 INFO L131 PetriNetUnfolder]: For 81512/81623 co-relation queries the response was YES. [2022-12-05 22:42:41,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17796 conditions, 1428 events. 531/1428 cut-off events. For 81512/81623 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 12148 event pairs, 1 based on Foata normal form. 0/1425 useless extension candidates. Maximal degree in co-relation 17670. Up to 801 conditions per place. [2022-12-05 22:42:41,388 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 331 places, 901 transitions, 26783 flow [2022-12-05 22:42:41,389 INFO L188 LiptonReduction]: Number of co-enabled transitions 2470 [2022-12-05 22:42:41,558 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [321] L687-5-->L687-5: Formula: (and (= v_~p~0_33 (+ v_~p~0_34 1)) (= v_~i~0_89 (+ v_~j~0_105 v_~i~0_90)) (< v_~p~0_34 10)) InVars {~j~0=v_~j~0_105, ~i~0=v_~i~0_90, ~p~0=v_~p~0_34} OutVars{~j~0=v_~j~0_105, ~i~0=v_~i~0_89, t1Thread1of1ForFork1_#t~post1=|v_t1Thread1of1ForFork1_#t~post1_23|, ~p~0=v_~p~0_33} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post1, ~p~0] [2022-12-05 22:42:41,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L705-6-->L705-6: Formula: (and (= v_~next~0_109 v_~cur~0_166) (= (+ 22 v_~x~0_188) v_~x~0_186) (< v_~x~0_186 23) (= v_~next~0_109 (+ (* v_~prev~0_196 17711) (* 28657 v_~cur~0_168))) (= (+ (* 10946 v_~prev~0_196) (* 17711 v_~cur~0_168)) v_~prev~0_194)) InVars {~prev~0=v_~prev~0_196, ~cur~0=v_~cur~0_168, ~x~0=v_~x~0_188} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_117|, ~next~0=v_~next~0_109, ~prev~0=v_~prev~0_194, ~cur~0=v_~cur~0_166, ~x~0=v_~x~0_186} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~next~0, ~prev~0, ~cur~0, ~x~0] and [303] L695-5-->L695-5: Formula: (and (= v_~q~0_31 (+ v_~q~0_32 1)) (< v_~q~0_32 10) (= v_~j~0_73 (+ v_~i~0_59 v_~j~0_74))) InVars {~j~0=v_~j~0_74, ~i~0=v_~i~0_59, ~q~0=v_~q~0_32} OutVars{~j~0=v_~j~0_73, ~i~0=v_~i~0_59, ~q~0=v_~q~0_31, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_25|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] [2022-12-05 22:42:41,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] L695-5-->L695-5: Formula: (and (= v_~q~0_154 (+ 2 v_~q~0_156)) (< v_~q~0_156 9) (= v_~j~0_241 (+ v_~j~0_243 (* 2 v_~i~0_211)))) InVars {~j~0=v_~j~0_243, ~i~0=v_~i~0_211, ~q~0=v_~q~0_156} OutVars{~j~0=v_~j~0_241, ~i~0=v_~i~0_211, ~q~0=v_~q~0_154, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_111|} AuxVars[] AssignedVars[~j~0, ~q~0, t2Thread1of1ForFork0_#t~post2] and [413] L705-6-->L695-5: Formula: (and (= v_~prev~0_380 (+ (* 17711 v_~cur~0_332) (* 10946 v_~prev~0_381))) (= (+ v_~q~0_263 1) v_~q~0_262) (= v_~j~0_401 (+ v_~j~0_402 v_~i~0_387)) (= v_~next~0_206 v_~cur~0_331) (< v_~x~0_374 23) (= (+ 22 v_~x~0_375) v_~x~0_374) (< v_~q~0_263 10) (= v_~next~0_206 (+ (* 28657 v_~cur~0_332) (* v_~prev~0_381 17711)))) InVars {~j~0=v_~j~0_402, ~prev~0=v_~prev~0_381, ~i~0=v_~i~0_387, ~q~0=v_~q~0_263, ~cur~0=v_~cur~0_332, ~x~0=v_~x~0_375} OutVars{ULTIMATE.start_fib_#t~post3#1=|v_ULTIMATE.start_fib_#t~post3#1_235|, ~j~0=v_~j~0_401, ~next~0=v_~next~0_206, ~prev~0=v_~prev~0_380, ~i~0=v_~i~0_387, ~q~0=v_~q~0_262, t2Thread1of1ForFork0_#t~post2=|v_t2Thread1of1ForFork0_#t~post2_195|, ~cur~0=v_~cur~0_331, ~x~0=v_~x~0_374} AuxVars[] AssignedVars[ULTIMATE.start_fib_#t~post3#1, ~j~0, ~next~0, ~prev~0, ~q~0, t2Thread1of1ForFork0_#t~post2, ~cur~0, ~x~0] [2022-12-05 22:42:41,749 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 22:42:41,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 847 [2022-12-05 22:42:41,750 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 901 transitions, 26825 flow [2022-12-05 22:42:41,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:41,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:41,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:41,756 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-05 22:42:41,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:41,956 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-05 22:42:41,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:41,956 INFO L85 PathProgramCache]: Analyzing trace with hash 551658907, now seen corresponding path program 1 times [2022-12-05 22:42:41,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:41,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540636910] [2022-12-05 22:42:41,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:41,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:42,053 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-05 22:42:42,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:42,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540636910] [2022-12-05 22:42:42,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540636910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:42,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206282973] [2022-12-05 22:42:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:42,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:42,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:42,056 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-05 22:42:42,091 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-05 22:42:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:42,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:42:42,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:42,255 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-05 22:42:42,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:42,378 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-05 22:42:42,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206282973] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:42,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:42,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-05 22:42:42,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044226558] [2022-12-05 22:42:42,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:42,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 22:42:42,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:42,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 22:42:42,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-12-05 22:42:42,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-05 22:42:42,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 901 transitions, 26825 flow. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:42,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:42,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-05 22:42:42,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:42:47,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:42:49,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:42:51,214 INFO L130 PetriNetUnfolder]: 3053/5492 cut-off events. [2022-12-05 22:42:51,215 INFO L131 PetriNetUnfolder]: For 457155/457155 co-relation queries the response was YES. [2022-12-05 22:42:51,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54032 conditions, 5492 events. 3053/5492 cut-off events. For 457155/457155 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 41382 event pairs, 476 based on Foata normal form. 38/5507 useless extension candidates. Maximal degree in co-relation 53903. Up to 3825 conditions per place. [2022-12-05 22:42:51,264 INFO L137 encePairwiseOnDemand]: 8/61 looper letters, 596 selfloop transitions, 409 changer transitions 3/1008 dead transitions. [2022-12-05 22:42:51,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1008 transitions, 30839 flow [2022-12-05 22:42:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 22:42:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 22:42:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 141 transitions. [2022-12-05 22:42:51,265 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1444672131147541 [2022-12-05 22:42:51,265 INFO L175 Difference]: Start difference. First operand has 331 places, 901 transitions, 26825 flow. Second operand 16 states and 141 transitions. [2022-12-05 22:42:51,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 1008 transitions, 30839 flow [2022-12-05 22:42:53,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 1008 transitions, 30180 flow, removed 280 selfloop flow, removed 11 redundant places. [2022-12-05 22:42:53,588 INFO L231 Difference]: Finished difference. Result has 339 places, 958 transitions, 29413 flow [2022-12-05 22:42:53,589 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=26178, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=357, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=29413, PETRI_PLACES=339, PETRI_TRANSITIONS=958} [2022-12-05 22:42:53,590 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 321 predicate places. [2022-12-05 22:42:53,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:42:53,590 INFO L89 Accepts]: Start accepts. Operand has 339 places, 958 transitions, 29413 flow [2022-12-05 22:42:53,596 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:42:53,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:42:53,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 339 places, 958 transitions, 29413 flow [2022-12-05 22:42:53,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 338 places, 958 transitions, 29413 flow [2022-12-05 22:42:53,915 INFO L130 PetriNetUnfolder]: 568/1527 cut-off events. [2022-12-05 22:42:53,916 INFO L131 PetriNetUnfolder]: For 93038/93140 co-relation queries the response was YES. [2022-12-05 22:42:53,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19598 conditions, 1527 events. 568/1527 cut-off events. For 93038/93140 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 13286 event pairs, 1 based on Foata normal form. 0/1523 useless extension candidates. Maximal degree in co-relation 19469. Up to 862 conditions per place. [2022-12-05 22:42:53,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 338 places, 958 transitions, 29413 flow [2022-12-05 22:42:53,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 2580 [2022-12-05 22:42:53,944 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:42:53,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 354 [2022-12-05 22:42:53,944 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 958 transitions, 29413 flow [2022-12-05 22:42:53,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:53,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:42:53,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:42:53,949 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-05 22:42:54,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:54,147 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-05 22:42:54,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:42:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash -85342005, now seen corresponding path program 1 times [2022-12-05 22:42:54,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:42:54,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493396086] [2022-12-05 22:42:54,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:54,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:42:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:54,299 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-05 22:42:54,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:42:54,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493396086] [2022-12-05 22:42:54,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493396086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:42:54,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82714439] [2022-12-05 22:42:54,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:42:54,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:42:54,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:42:54,304 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-05 22:42:54,333 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-05 22:42:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:42:54,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:42:54,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:42:54,511 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-05 22:42:54,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:42:54,656 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-05 22:42:54,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82714439] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:42:54,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:42:54,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:42:54,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025278174] [2022-12-05 22:42:54,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:42:54,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:42:54,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:42:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:42:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:42:54,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-05 22:42:54,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 958 transitions, 29413 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:42:54,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:42:54,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-05 22:42:54,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:43:01,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:43:03,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:43:05,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:43:08,174 INFO L130 PetriNetUnfolder]: 3182/5743 cut-off events. [2022-12-05 22:43:08,174 INFO L131 PetriNetUnfolder]: For 498865/498865 co-relation queries the response was YES. [2022-12-05 22:43:08,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57357 conditions, 5743 events. 3182/5743 cut-off events. For 498865/498865 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 43575 event pairs, 298 based on Foata normal form. 38/5758 useless extension candidates. Maximal degree in co-relation 57225. Up to 3112 conditions per place. [2022-12-05 22:43:08,224 INFO L137 encePairwiseOnDemand]: 8/61 looper letters, 479 selfloop transitions, 615 changer transitions 0/1094 dead transitions. [2022-12-05 22:43:08,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 1094 transitions, 33843 flow [2022-12-05 22:43:08,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-05 22:43:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-05 22:43:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 183 transitions. [2022-12-05 22:43:08,225 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13636363636363635 [2022-12-05 22:43:08,225 INFO L175 Difference]: Start difference. First operand has 338 places, 958 transitions, 29413 flow. Second operand 22 states and 183 transitions. [2022-12-05 22:43:08,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 1094 transitions, 33843 flow [2022-12-05 22:43:10,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 1094 transitions, 33656 flow, removed 40 selfloop flow, removed 7 redundant places. [2022-12-05 22:43:10,564 INFO L231 Difference]: Finished difference. Result has 359 places, 1019 transitions, 33196 flow [2022-12-05 22:43:10,565 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=29238, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=564, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=33196, PETRI_PLACES=359, PETRI_TRANSITIONS=1019} [2022-12-05 22:43:10,565 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 341 predicate places. [2022-12-05 22:43:10,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:43:10,565 INFO L89 Accepts]: Start accepts. Operand has 359 places, 1019 transitions, 33196 flow [2022-12-05 22:43:10,570 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:43:10,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:43:10,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 359 places, 1019 transitions, 33196 flow [2022-12-05 22:43:10,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 359 places, 1019 transitions, 33196 flow [2022-12-05 22:43:10,950 INFO L130 PetriNetUnfolder]: 593/1599 cut-off events. [2022-12-05 22:43:10,951 INFO L131 PetriNetUnfolder]: For 96908/97016 co-relation queries the response was YES. [2022-12-05 22:43:10,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21537 conditions, 1599 events. 593/1599 cut-off events. For 96908/97016 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 14062 event pairs, 1 based on Foata normal form. 0/1595 useless extension candidates. Maximal degree in co-relation 21402. Up to 913 conditions per place. [2022-12-05 22:43:10,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 359 places, 1019 transitions, 33196 flow [2022-12-05 22:43:10,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 2716 [2022-12-05 22:43:10,986 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:43:10,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 421 [2022-12-05 22:43:10,986 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 1019 transitions, 33196 flow [2022-12-05 22:43:10,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:43:10,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:43:10,987 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:43:10,991 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-05 22:43:11,191 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,SelfDestructingSolverStorable35 [2022-12-05 22:43:11,191 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-05 22:43:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:43:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2038755755, now seen corresponding path program 1 times [2022-12-05 22:43:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:43:11,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089858316] [2022-12-05 22:43:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:43:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:11,328 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-05 22:43:11,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:43:11,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089858316] [2022-12-05 22:43:11,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089858316] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:43:11,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163356938] [2022-12-05 22:43:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:11,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:43:11,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:43:11,332 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-05 22:43:11,334 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-05 22:43:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:11,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:43:11,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:43:11,545 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-05 22:43:11,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:43:11,703 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-05 22:43:11,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163356938] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:43:11,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:43:11,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:43:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024663152] [2022-12-05 22:43:11,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:43:11,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:43:11,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:43:11,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:43:11,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:43:11,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-05 22:43:11,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1019 transitions, 33196 flow. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:43:11,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:43:11,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-05 22:43:11,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:43:17,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:43:19,336 INFO L130 PetriNetUnfolder]: 3536/6361 cut-off events. [2022-12-05 22:43:19,336 INFO L131 PetriNetUnfolder]: For 702480/702480 co-relation queries the response was YES. [2022-12-05 22:43:19,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67054 conditions, 6361 events. 3536/6361 cut-off events. For 702480/702480 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 49107 event pairs, 468 based on Foata normal form. 70/6408 useless extension candidates. Maximal degree in co-relation 66916. Up to 3511 conditions per place. [2022-12-05 22:43:19,398 INFO L137 encePairwiseOnDemand]: 8/61 looper letters, 631 selfloop transitions, 571 changer transitions 0/1202 dead transitions. [2022-12-05 22:43:19,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 1202 transitions, 39690 flow [2022-12-05 22:43:19,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 22:43:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 22:43:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 199 transitions. [2022-12-05 22:43:19,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15534738485558158 [2022-12-05 22:43:19,399 INFO L175 Difference]: Start difference. First operand has 359 places, 1019 transitions, 33196 flow. Second operand 21 states and 199 transitions. [2022-12-05 22:43:19,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 1202 transitions, 39690 flow [2022-12-05 22:43:22,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 1202 transitions, 38952 flow, removed 322 selfloop flow, removed 7 redundant places. [2022-12-05 22:43:22,385 INFO L231 Difference]: Finished difference. Result has 383 places, 1116 transitions, 37840 flow [2022-12-05 22:43:22,386 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=32566, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=486, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=37840, PETRI_PLACES=383, PETRI_TRANSITIONS=1116} [2022-12-05 22:43:22,386 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 365 predicate places. [2022-12-05 22:43:22,386 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:43:22,386 INFO L89 Accepts]: Start accepts. Operand has 383 places, 1116 transitions, 37840 flow [2022-12-05 22:43:22,395 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:43:22,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:43:22,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 383 places, 1116 transitions, 37840 flow [2022-12-05 22:43:22,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 383 places, 1116 transitions, 37840 flow [2022-12-05 22:43:22,829 INFO L130 PetriNetUnfolder]: 648/1743 cut-off events. [2022-12-05 22:43:22,830 INFO L131 PetriNetUnfolder]: For 130710/130789 co-relation queries the response was YES. [2022-12-05 22:43:22,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24826 conditions, 1743 events. 648/1743 cut-off events. For 130710/130789 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 15610 event pairs, 0 based on Foata normal form. 0/1739 useless extension candidates. Maximal degree in co-relation 24680. Up to 1013 conditions per place. [2022-12-05 22:43:22,859 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 383 places, 1116 transitions, 37840 flow [2022-12-05 22:43:22,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 3002 [2022-12-05 22:43:22,894 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:43:22,895 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 509 [2022-12-05 22:43:22,895 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 1116 transitions, 37847 flow [2022-12-05 22:43:22,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:43:22,895 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:43:22,895 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:43:22,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-05 22:43:23,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-05 22:43:23,096 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-05 22:43:23,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:43:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash -74229032, now seen corresponding path program 1 times [2022-12-05 22:43:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:43:23,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075276902] [2022-12-05 22:43:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:43:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:23,215 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-05 22:43:23,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:43:23,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075276902] [2022-12-05 22:43:23,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075276902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:43:23,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708534600] [2022-12-05 22:43:23,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:23,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:43:23,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:43:23,217 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-05 22:43:23,220 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-05 22:43:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:23,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 22:43:23,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:43:23,417 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-05 22:43:23,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:43:23,581 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-05 22:43:23,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708534600] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:43:23,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:43:23,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:43:23,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416867601] [2022-12-05 22:43:23,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:43:23,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:43:23,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:43:23,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:43:23,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:43:23,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-05 22:43:23,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 1116 transitions, 37847 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:43:23,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:43:23,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-05 22:43:23,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:43:27,310 INFO L130 PetriNetUnfolder]: 4126/7367 cut-off events. [2022-12-05 22:43:27,311 INFO L131 PetriNetUnfolder]: For 808005/808005 co-relation queries the response was YES. [2022-12-05 22:43:27,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82144 conditions, 7367 events. 4126/7367 cut-off events. For 808005/808005 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 58128 event pairs, 206 based on Foata normal form. 42/7386 useless extension candidates. Maximal degree in co-relation 81995. Up to 2903 conditions per place. [2022-12-05 22:43:27,385 INFO L137 encePairwiseOnDemand]: 8/62 looper letters, 310 selfloop transitions, 1053 changer transitions 0/1363 dead transitions. [2022-12-05 22:43:27,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 1363 transitions, 46996 flow [2022-12-05 22:43:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-05 22:43:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-05 22:43:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 185 transitions. [2022-12-05 22:43:27,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.16577060931899643 [2022-12-05 22:43:27,387 INFO L175 Difference]: Start difference. First operand has 383 places, 1116 transitions, 37847 flow. Second operand 18 states and 185 transitions. [2022-12-05 22:43:27,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 1363 transitions, 46996 flow [2022-12-05 22:43:31,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 1363 transitions, 44961 flow, removed 942 selfloop flow, removed 7 redundant places. [2022-12-05 22:43:31,243 INFO L231 Difference]: Finished difference. Result has 399 places, 1284 transitions, 45311 flow [2022-12-05 22:43:31,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=36164, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=916, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=45311, PETRI_PLACES=399, PETRI_TRANSITIONS=1284} [2022-12-05 22:43:31,244 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 381 predicate places. [2022-12-05 22:43:31,245 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:43:31,245 INFO L89 Accepts]: Start accepts. Operand has 399 places, 1284 transitions, 45311 flow [2022-12-05 22:43:31,255 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:43:31,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:43:31,255 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 399 places, 1284 transitions, 45311 flow [2022-12-05 22:43:31,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 399 places, 1284 transitions, 45311 flow [2022-12-05 22:43:31,825 INFO L130 PetriNetUnfolder]: 754/2009 cut-off events. [2022-12-05 22:43:31,826 INFO L131 PetriNetUnfolder]: For 149084/149153 co-relation queries the response was YES. [2022-12-05 22:43:31,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29530 conditions, 2009 events. 754/2009 cut-off events. For 149084/149153 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 18542 event pairs, 0 based on Foata normal form. 0/2001 useless extension candidates. Maximal degree in co-relation 29381. Up to 1134 conditions per place. [2022-12-05 22:43:31,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 399 places, 1284 transitions, 45311 flow [2022-12-05 22:43:31,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 3474 [2022-12-05 22:43:31,865 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:43:31,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 621 [2022-12-05 22:43:31,866 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 1284 transitions, 45311 flow [2022-12-05 22:43:31,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:43:31,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:43:31,866 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:43:31,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-05 22:43:32,070 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,SelfDestructingSolverStorable37 [2022-12-05 22:43:32,071 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-05 22:43:32,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:43:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash -171599443, now seen corresponding path program 1 times [2022-12-05 22:43:32,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:43:32,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561048682] [2022-12-05 22:43:32,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:32,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:43:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:32,184 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-05 22:43:32,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:43:32,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561048682] [2022-12-05 22:43:32,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561048682] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:43:32,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508962693] [2022-12-05 22:43:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:43:32,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:43:32,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:43:32,186 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-05 22:43:32,188 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-05 22:43:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:43:32,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:43:32,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:43:32,386 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-05 22:43:32,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:43:32,519 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-05 22:43:32,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508962693] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:43:32,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:43:32,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:43:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703818158] [2022-12-05 22:43:32,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:43:32,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:43:32,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:43:32,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:43:32,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:43:32,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-05 22:43:32,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 1284 transitions, 45311 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:43:32,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:43:32,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-05 22:43:32,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:43:47,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:43:49,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:43:54,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:43:56,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:43:58,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:44:00,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:44:03,322 INFO L130 PetriNetUnfolder]: 4186/7487 cut-off events. [2022-12-05 22:44:03,322 INFO L131 PetriNetUnfolder]: For 741418/741418 co-relation queries the response was YES. [2022-12-05 22:44:03,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85268 conditions, 7487 events. 4186/7487 cut-off events. For 741418/741418 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 59366 event pairs, 726 based on Foata normal form. 24/7488 useless extension candidates. Maximal degree in co-relation 85116. Up to 5809 conditions per place. [2022-12-05 22:44:03,404 INFO L137 encePairwiseOnDemand]: 9/62 looper letters, 980 selfloop transitions, 404 changer transitions 4/1388 dead transitions. [2022-12-05 22:44:03,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 1388 transitions, 49312 flow [2022-12-05 22:44:03,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-05 22:44:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-05 22:44:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 182 transitions. [2022-12-05 22:44:03,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12231182795698925 [2022-12-05 22:44:03,406 INFO L175 Difference]: Start difference. First operand has 399 places, 1284 transitions, 45311 flow. Second operand 24 states and 182 transitions. [2022-12-05 22:44:03,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 1388 transitions, 49312 flow [2022-12-05 22:44:07,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 1388 transitions, 47671 flow, removed 764 selfloop flow, removed 5 redundant places. [2022-12-05 22:44:08,027 INFO L231 Difference]: Finished difference. Result has 421 places, 1314 transitions, 45982 flow [2022-12-05 22:44:08,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=43722, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=378, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=45982, PETRI_PLACES=421, PETRI_TRANSITIONS=1314} [2022-12-05 22:44:08,028 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 403 predicate places. [2022-12-05 22:44:08,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:44:08,028 INFO L89 Accepts]: Start accepts. Operand has 421 places, 1314 transitions, 45982 flow [2022-12-05 22:44:08,035 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:44:08,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:44:08,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 421 places, 1314 transitions, 45982 flow [2022-12-05 22:44:08,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 421 places, 1314 transitions, 45982 flow [2022-12-05 22:44:08,674 INFO L130 PetriNetUnfolder]: 771/2056 cut-off events. [2022-12-05 22:44:08,674 INFO L131 PetriNetUnfolder]: For 155122/155215 co-relation queries the response was YES. [2022-12-05 22:44:08,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29970 conditions, 2056 events. 771/2056 cut-off events. For 155122/155215 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 19067 event pairs, 0 based on Foata normal form. 0/2047 useless extension candidates. Maximal degree in co-relation 29818. Up to 1164 conditions per place. [2022-12-05 22:44:08,710 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 421 places, 1314 transitions, 45982 flow [2022-12-05 22:44:08,710 INFO L188 LiptonReduction]: Number of co-enabled transitions 3530 [2022-12-05 22:44:08,961 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:44:08,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 934 [2022-12-05 22:44:08,962 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 1314 transitions, 46079 flow [2022-12-05 22:44:08,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:08,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:44:08,963 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:44:08,975 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-05 22:44:09,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-05 22:44:09,167 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-05 22:44:09,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:44:09,168 INFO L85 PathProgramCache]: Analyzing trace with hash -97300689, now seen corresponding path program 1 times [2022-12-05 22:44:09,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:44:09,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183793363] [2022-12-05 22:44:09,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:09,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:44:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:09,278 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-05 22:44:09,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:44:09,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183793363] [2022-12-05 22:44:09,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183793363] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:44:09,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510668173] [2022-12-05 22:44:09,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:09,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:44:09,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:44:09,284 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-05 22:44:09,286 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-05 22:44:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:09,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:44:09,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:44:09,462 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-05 22:44:09,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:44:09,591 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-05 22:44:09,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510668173] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:44:09,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:44:09,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:44:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758566486] [2022-12-05 22:44:09,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:44:09,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:44:09,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:44:09,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:44:09,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:44:09,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-05 22:44:09,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 1314 transitions, 46079 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:09,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:44:09,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-05 22:44:09,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:44:18,593 INFO L130 PetriNetUnfolder]: 4326/7771 cut-off events. [2022-12-05 22:44:18,594 INFO L131 PetriNetUnfolder]: For 919609/919609 co-relation queries the response was YES. [2022-12-05 22:44:18,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87431 conditions, 7771 events. 4326/7771 cut-off events. For 919609/919609 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 62142 event pairs, 853 based on Foata normal form. 64/7804 useless extension candidates. Maximal degree in co-relation 87276. Up to 5784 conditions per place. [2022-12-05 22:44:18,676 INFO L137 encePairwiseOnDemand]: 9/66 looper letters, 955 selfloop transitions, 493 changer transitions 6/1454 dead transitions. [2022-12-05 22:44:18,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1454 transitions, 51803 flow [2022-12-05 22:44:18,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 22:44:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 22:44:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 168 transitions. [2022-12-05 22:44:18,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12121212121212122 [2022-12-05 22:44:18,677 INFO L175 Difference]: Start difference. First operand has 421 places, 1314 transitions, 46079 flow. Second operand 21 states and 168 transitions. [2022-12-05 22:44:18,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1454 transitions, 51803 flow [2022-12-05 22:44:23,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 1454 transitions, 51045 flow, removed 323 selfloop flow, removed 9 redundant places. [2022-12-05 22:44:23,760 INFO L231 Difference]: Finished difference. Result has 437 places, 1390 transitions, 49706 flow [2022-12-05 22:44:23,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=45385, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=429, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=857, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=49706, PETRI_PLACES=437, PETRI_TRANSITIONS=1390} [2022-12-05 22:44:23,761 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 419 predicate places. [2022-12-05 22:44:23,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:44:23,761 INFO L89 Accepts]: Start accepts. Operand has 437 places, 1390 transitions, 49706 flow [2022-12-05 22:44:23,766 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:44:23,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:44:23,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 437 places, 1390 transitions, 49706 flow [2022-12-05 22:44:23,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 437 places, 1390 transitions, 49706 flow [2022-12-05 22:44:24,446 INFO L130 PetriNetUnfolder]: 811/2166 cut-off events. [2022-12-05 22:44:24,446 INFO L131 PetriNetUnfolder]: For 161837/161942 co-relation queries the response was YES. [2022-12-05 22:44:24,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31917 conditions, 2166 events. 811/2166 cut-off events. For 161837/161942 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 20171 event pairs, 0 based on Foata normal form. 0/2157 useless extension candidates. Maximal degree in co-relation 31759. Up to 1230 conditions per place. [2022-12-05 22:44:24,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 437 places, 1390 transitions, 49706 flow [2022-12-05 22:44:24,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 3670 [2022-12-05 22:44:24,489 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:44:24,490 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 729 [2022-12-05 22:44:24,490 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 1390 transitions, 49706 flow [2022-12-05 22:44:24,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:24,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:44:24,490 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:44:24,495 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-05 22:44:24,694 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,SelfDestructingSolverStorable39 [2022-12-05 22:44:24,694 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-05 22:44:24,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:44:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash 69467052, now seen corresponding path program 1 times [2022-12-05 22:44:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:44:24,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008082163] [2022-12-05 22:44:24,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:24,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:44:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:24,723 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-05 22:44:24,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:44:24,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008082163] [2022-12-05 22:44:24,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008082163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:44:24,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798317633] [2022-12-05 22:44:24,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:24,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:44:24,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:44:24,725 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-05 22:44:24,727 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-05 22:44:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:24,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 22:44:24,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:44:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:44:24,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:44:24,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798317633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:44:24,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:44:24,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-12-05 22:44:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888147343] [2022-12-05 22:44:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:44:24,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:44:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:44:24,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:44:24,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:44:24,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-05 22:44:24,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 1390 transitions, 49706 flow. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:24,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:44:24,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-05 22:44:24,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:44:28,607 INFO L130 PetriNetUnfolder]: 4335/7782 cut-off events. [2022-12-05 22:44:28,607 INFO L131 PetriNetUnfolder]: For 745665/745665 co-relation queries the response was YES. [2022-12-05 22:44:28,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89253 conditions, 7782 events. 4335/7782 cut-off events. For 745665/745665 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 65080 event pairs, 882 based on Foata normal form. 3/7754 useless extension candidates. Maximal degree in co-relation 89092. Up to 4035 conditions per place. [2022-12-05 22:44:28,698 INFO L137 encePairwiseOnDemand]: 62/66 looper letters, 2098 selfloop transitions, 3 changer transitions 16/2117 dead transitions. [2022-12-05 22:44:28,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 2117 transitions, 79448 flow [2022-12-05 22:44:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:44:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:44:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-12-05 22:44:28,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-05 22:44:28,795 INFO L175 Difference]: Start difference. First operand has 437 places, 1390 transitions, 49706 flow. Second operand 4 states and 99 transitions. [2022-12-05 22:44:28,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 2117 transitions, 79448 flow [2022-12-05 22:44:33,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 2117 transitions, 78926 flow, removed 134 selfloop flow, removed 11 redundant places. [2022-12-05 22:44:34,022 INFO L231 Difference]: Finished difference. Result has 430 places, 1388 transitions, 49283 flow [2022-12-05 22:44:34,023 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=49270, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=49283, PETRI_PLACES=430, PETRI_TRANSITIONS=1388} [2022-12-05 22:44:34,023 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 412 predicate places. [2022-12-05 22:44:34,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:44:34,024 INFO L89 Accepts]: Start accepts. Operand has 430 places, 1388 transitions, 49283 flow [2022-12-05 22:44:34,031 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:44:34,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:44:34,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 430 places, 1388 transitions, 49283 flow [2022-12-05 22:44:34,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 430 places, 1388 transitions, 49283 flow [2022-12-05 22:44:34,672 INFO L130 PetriNetUnfolder]: 814/2172 cut-off events. [2022-12-05 22:44:34,672 INFO L131 PetriNetUnfolder]: For 166492/166561 co-relation queries the response was YES. [2022-12-05 22:44:34,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32602 conditions, 2172 events. 814/2172 cut-off events. For 166492/166561 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 20239 event pairs, 0 based on Foata normal form. 0/2163 useless extension candidates. Maximal degree in co-relation 32442. Up to 1235 conditions per place. [2022-12-05 22:44:34,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 430 places, 1388 transitions, 49283 flow [2022-12-05 22:44:34,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 3672 [2022-12-05 22:44:34,732 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:44:34,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 708 [2022-12-05 22:44:34,733 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 1388 transitions, 49283 flow [2022-12-05 22:44:34,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:34,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:44:34,733 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:44:34,739 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-05 22:44:34,937 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,SelfDestructingSolverStorable40 [2022-12-05 22:44:34,937 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-05 22:44:34,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:44:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash -77519465, now seen corresponding path program 1 times [2022-12-05 22:44:34,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:44:34,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411222896] [2022-12-05 22:44:34,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:34,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:44:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:35,052 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-05 22:44:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:44:35,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411222896] [2022-12-05 22:44:35,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411222896] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:44:35,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138612871] [2022-12-05 22:44:35,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:35,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:44:35,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:44:35,054 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-05 22:44:35,056 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-05 22:44:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:35,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:44:35,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:44:35,216 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-05 22:44:35,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:44:35,364 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-05 22:44:35,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138612871] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:44:35,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:44:35,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:44:35,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687533858] [2022-12-05 22:44:35,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:44:35,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:44:35,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:44:35,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:44:35,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:44:35,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-05 22:44:35,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1388 transitions, 49283 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:35,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:44:35,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-05 22:44:35,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:44:38,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:44:41,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:44:45,096 INFO L130 PetriNetUnfolder]: 4467/8046 cut-off events. [2022-12-05 22:44:45,096 INFO L131 PetriNetUnfolder]: For 962532/962532 co-relation queries the response was YES. [2022-12-05 22:44:45,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95345 conditions, 8046 events. 4467/8046 cut-off events. For 962532/962532 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 64834 event pairs, 780 based on Foata normal form. 54/8069 useless extension candidates. Maximal degree in co-relation 95182. Up to 5595 conditions per place. [2022-12-05 22:44:45,187 INFO L137 encePairwiseOnDemand]: 9/65 looper letters, 886 selfloop transitions, 619 changer transitions 4/1509 dead transitions. [2022-12-05 22:44:45,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 1509 transitions, 55041 flow [2022-12-05 22:44:45,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 22:44:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 22:44:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 151 transitions. [2022-12-05 22:44:45,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13665158371040723 [2022-12-05 22:44:45,189 INFO L175 Difference]: Start difference. First operand has 430 places, 1388 transitions, 49283 flow. Second operand 17 states and 151 transitions. [2022-12-05 22:44:45,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 1509 transitions, 55041 flow [2022-12-05 22:44:50,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 1509 transitions, 55040 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:44:50,826 INFO L231 Difference]: Finished difference. Result has 450 places, 1452 transitions, 54013 flow [2022-12-05 22:44:50,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=49282, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=569, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=807, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=54013, PETRI_PLACES=450, PETRI_TRANSITIONS=1452} [2022-12-05 22:44:50,829 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 432 predicate places. [2022-12-05 22:44:50,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:44:50,829 INFO L89 Accepts]: Start accepts. Operand has 450 places, 1452 transitions, 54013 flow [2022-12-05 22:44:50,845 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:44:50,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:44:50,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 450 places, 1452 transitions, 54013 flow [2022-12-05 22:44:50,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 450 places, 1452 transitions, 54013 flow [2022-12-05 22:44:51,643 INFO L130 PetriNetUnfolder]: 847/2273 cut-off events. [2022-12-05 22:44:51,643 INFO L131 PetriNetUnfolder]: For 196431/196524 co-relation queries the response was YES. [2022-12-05 22:44:51,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35537 conditions, 2273 events. 847/2273 cut-off events. For 196431/196524 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 21478 event pairs, 0 based on Foata normal form. 0/2268 useless extension candidates. Maximal degree in co-relation 35371. Up to 1301 conditions per place. [2022-12-05 22:44:51,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 450 places, 1452 transitions, 54013 flow [2022-12-05 22:44:51,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 3804 [2022-12-05 22:44:51,701 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:44:51,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 873 [2022-12-05 22:44:51,702 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 1452 transitions, 54013 flow [2022-12-05 22:44:51,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:51,702 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:44:51,702 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:44:51,710 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-05 22:44:51,906 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,SelfDestructingSolverStorable41 [2022-12-05 22:44:51,907 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-05 22:44:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:44:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2053481390, now seen corresponding path program 1 times [2022-12-05 22:44:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:44:51,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851543521] [2022-12-05 22:44:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:44:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:52,042 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-05 22:44:52,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:44:52,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851543521] [2022-12-05 22:44:52,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851543521] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:44:52,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969287632] [2022-12-05 22:44:52,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:44:52,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:44:52,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:44:52,048 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-05 22:44:52,052 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-05 22:44:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:44:52,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:44:52,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:44:52,276 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-05 22:44:52,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:44:52,426 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-05 22:44:52,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969287632] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:44:52,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:44:52,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:44:52,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534196845] [2022-12-05 22:44:52,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:44:52,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:44:52,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:44:52,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:44:52,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:44:52,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-05 22:44:52,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 1452 transitions, 54013 flow. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:44:52,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:44:52,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-05 22:44:52,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:45:00,254 INFO L130 PetriNetUnfolder]: 4685/8462 cut-off events. [2022-12-05 22:45:00,254 INFO L131 PetriNetUnfolder]: For 1193583/1193583 co-relation queries the response was YES. [2022-12-05 22:45:00,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102251 conditions, 8462 events. 4685/8462 cut-off events. For 1193583/1193583 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 69084 event pairs, 724 based on Foata normal form. 88/8519 useless extension candidates. Maximal degree in co-relation 102082. Up to 5561 conditions per place. [2022-12-05 22:45:00,348 INFO L137 encePairwiseOnDemand]: 12/65 looper letters, 968 selfloop transitions, 666 changer transitions 0/1634 dead transitions. [2022-12-05 22:45:00,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 1634 transitions, 61334 flow [2022-12-05 22:45:00,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-05 22:45:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-05 22:45:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 211 transitions. [2022-12-05 22:45:00,349 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12485207100591716 [2022-12-05 22:45:00,349 INFO L175 Difference]: Start difference. First operand has 450 places, 1452 transitions, 54013 flow. Second operand 26 states and 211 transitions. [2022-12-05 22:45:00,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 1634 transitions, 61334 flow [2022-12-05 22:45:07,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 1634 transitions, 60641 flow, removed 272 selfloop flow, removed 9 redundant places. [2022-12-05 22:45:07,282 INFO L231 Difference]: Finished difference. Result has 478 places, 1545 transitions, 59398 flow [2022-12-05 22:45:07,283 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=53350, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=590, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=831, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=59398, PETRI_PLACES=478, PETRI_TRANSITIONS=1545} [2022-12-05 22:45:07,283 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 460 predicate places. [2022-12-05 22:45:07,283 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:45:07,284 INFO L89 Accepts]: Start accepts. Operand has 478 places, 1545 transitions, 59398 flow [2022-12-05 22:45:07,294 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:45:07,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:45:07,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 478 places, 1545 transitions, 59398 flow [2022-12-05 22:45:07,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 478 places, 1545 transitions, 59398 flow [2022-12-05 22:45:08,146 INFO L130 PetriNetUnfolder]: 894/2399 cut-off events. [2022-12-05 22:45:08,146 INFO L131 PetriNetUnfolder]: For 199236/199329 co-relation queries the response was YES. [2022-12-05 22:45:08,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38270 conditions, 2399 events. 894/2399 cut-off events. For 199236/199329 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 22804 event pairs, 0 based on Foata normal form. 0/2394 useless extension candidates. Maximal degree in co-relation 38092. Up to 1390 conditions per place. [2022-12-05 22:45:08,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 478 places, 1545 transitions, 59398 flow [2022-12-05 22:45:08,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 4030 [2022-12-05 22:45:08,312 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:45:08,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1029 [2022-12-05 22:45:08,312 INFO L495 AbstractCegarLoop]: Abstraction has has 478 places, 1545 transitions, 59484 flow [2022-12-05 22:45:08,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:45:08,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:45:08,313 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:45:08,317 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-05 22:45:08,515 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,SelfDestructingSolverStorable42 [2022-12-05 22:45:08,515 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-05 22:45:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:45:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1633694195, now seen corresponding path program 1 times [2022-12-05 22:45:08,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:45:08,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878430057] [2022-12-05 22:45:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:08,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:45:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:08,631 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-05 22:45:08,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:45:08,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878430057] [2022-12-05 22:45:08,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878430057] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:45:08,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640302421] [2022-12-05 22:45:08,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:08,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:08,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:45:08,633 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-05 22:45:08,635 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-05 22:45:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:08,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:45:08,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:45:08,823 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-05 22:45:08,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:45:08,993 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-05 22:45:08,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640302421] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:45:08,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:45:08,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:45:08,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976654974] [2022-12-05 22:45:08,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:45:08,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:45:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:45:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:45:08,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:45:08,994 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 68 [2022-12-05 22:45:08,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 1545 transitions, 59484 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:45:08,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:45:08,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 68 [2022-12-05 22:45:08,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:45:12,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:45:14,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:45:18,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:45:22,969 INFO L130 PetriNetUnfolder]: 5113/9226 cut-off events. [2022-12-05 22:45:22,969 INFO L131 PetriNetUnfolder]: For 1206579/1206579 co-relation queries the response was YES. [2022-12-05 22:45:23,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115837 conditions, 9226 events. 5113/9226 cut-off events. For 1206579/1206579 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 76043 event pairs, 478 based on Foata normal form. 48/9243 useless extension candidates. Maximal degree in co-relation 115656. Up to 4740 conditions per place. [2022-12-05 22:45:23,077 INFO L137 encePairwiseOnDemand]: 8/68 looper letters, 821 selfloop transitions, 996 changer transitions 1/1818 dead transitions. [2022-12-05 22:45:23,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 1818 transitions, 69659 flow [2022-12-05 22:45:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-05 22:45:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-05 22:45:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 275 transitions. [2022-12-05 22:45:23,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11233660130718955 [2022-12-05 22:45:23,078 INFO L175 Difference]: Start difference. First operand has 478 places, 1545 transitions, 59484 flow. Second operand 36 states and 275 transitions. [2022-12-05 22:45:23,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 1818 transitions, 69659 flow [2022-12-05 22:45:32,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 1818 transitions, 68128 flow, removed 704 selfloop flow, removed 5 redundant places. [2022-12-05 22:45:32,627 INFO L231 Difference]: Finished difference. Result has 519 places, 1687 transitions, 66798 flow [2022-12-05 22:45:32,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=57953, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=877, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=66798, PETRI_PLACES=519, PETRI_TRANSITIONS=1687} [2022-12-05 22:45:32,628 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 501 predicate places. [2022-12-05 22:45:32,628 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:45:32,628 INFO L89 Accepts]: Start accepts. Operand has 519 places, 1687 transitions, 66798 flow [2022-12-05 22:45:32,639 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:45:32,639 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:45:32,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 519 places, 1687 transitions, 66798 flow [2022-12-05 22:45:32,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 519 places, 1687 transitions, 66798 flow [2022-12-05 22:45:33,647 INFO L130 PetriNetUnfolder]: 970/2609 cut-off events. [2022-12-05 22:45:33,647 INFO L131 PetriNetUnfolder]: For 236118/236208 co-relation queries the response was YES. [2022-12-05 22:45:33,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42905 conditions, 2609 events. 970/2609 cut-off events. For 236118/236208 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 25286 event pairs, 0 based on Foata normal form. 0/2604 useless extension candidates. Maximal degree in co-relation 42715. Up to 1498 conditions per place. [2022-12-05 22:45:33,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 519 places, 1687 transitions, 66798 flow [2022-12-05 22:45:33,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 4392 [2022-12-05 22:45:33,869 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:45:33,870 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1242 [2022-12-05 22:45:33,870 INFO L495 AbstractCegarLoop]: Abstraction has has 519 places, 1687 transitions, 66873 flow [2022-12-05 22:45:33,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:45:33,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:45:33,871 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:45:33,875 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-05 22:45:34,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:34,074 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-05 22:45:34,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:45:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash 739108166, now seen corresponding path program 1 times [2022-12-05 22:45:34,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:45:34,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447514357] [2022-12-05 22:45:34,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:34,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:45:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:45:34,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:45:34,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447514357] [2022-12-05 22:45:34,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447514357] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:45:34,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556157764] [2022-12-05 22:45:34,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:34,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:34,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:45:34,110 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-05 22:45:34,141 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-05 22:45:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:34,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-05 22:45:34,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:45:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:45:34,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 22:45:34,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556157764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:45:34,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 22:45:34,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-05 22:45:34,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022000819] [2022-12-05 22:45:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:45:34,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:45:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:45:34,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:45:34,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:45:34,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-05 22:45:34,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 1687 transitions, 66873 flow. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:45:34,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:45:34,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-05 22:45:34,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:45:40,539 INFO L130 PetriNetUnfolder]: 5405/9640 cut-off events. [2022-12-05 22:45:40,540 INFO L131 PetriNetUnfolder]: For 1175323/1175323 co-relation queries the response was YES. [2022-12-05 22:45:40,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125860 conditions, 9640 events. 5405/9640 cut-off events. For 1175323/1175323 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 79920 event pairs, 896 based on Foata normal form. 28/9637 useless extension candidates. Maximal degree in co-relation 125667. Up to 4542 conditions per place. [2022-12-05 22:45:40,693 INFO L137 encePairwiseOnDemand]: 53/69 looper letters, 2608 selfloop transitions, 26 changer transitions 23/2657 dead transitions. [2022-12-05 22:45:40,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 2657 transitions, 110170 flow [2022-12-05 22:45:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:45:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:45:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-05 22:45:40,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2898550724637681 [2022-12-05 22:45:40,694 INFO L175 Difference]: Start difference. First operand has 519 places, 1687 transitions, 66873 flow. Second operand 6 states and 120 transitions. [2022-12-05 22:45:40,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 2657 transitions, 110170 flow [2022-12-05 22:45:50,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 2657 transitions, 107324 flow, removed 1262 selfloop flow, removed 12 redundant places. [2022-12-05 22:45:50,838 INFO L231 Difference]: Finished difference. Result has 514 places, 1682 transitions, 64852 flow [2022-12-05 22:45:50,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=64509, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=64852, PETRI_PLACES=514, PETRI_TRANSITIONS=1682} [2022-12-05 22:45:50,839 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 496 predicate places. [2022-12-05 22:45:50,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:45:50,840 INFO L89 Accepts]: Start accepts. Operand has 514 places, 1682 transitions, 64852 flow [2022-12-05 22:45:50,849 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:45:50,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:45:50,849 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 514 places, 1682 transitions, 64852 flow [2022-12-05 22:45:50,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 514 places, 1682 transitions, 64852 flow [2022-12-05 22:45:51,911 INFO L130 PetriNetUnfolder]: 1040/2756 cut-off events. [2022-12-05 22:45:51,912 INFO L131 PetriNetUnfolder]: For 292392/292471 co-relation queries the response was YES. [2022-12-05 22:45:51,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45516 conditions, 2756 events. 1040/2756 cut-off events. For 292392/292471 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 26578 event pairs, 0 based on Foata normal form. 5/2757 useless extension candidates. Maximal degree in co-relation 45324. Up to 1502 conditions per place. [2022-12-05 22:45:51,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 514 places, 1682 transitions, 64852 flow [2022-12-05 22:45:51,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 4504 [2022-12-05 22:45:51,980 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:45:51,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1140 [2022-12-05 22:45:51,980 INFO L495 AbstractCegarLoop]: Abstraction has has 514 places, 1682 transitions, 64852 flow [2022-12-05 22:45:51,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:45:51,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:45:51,981 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:45:51,986 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-05 22:45:52,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:52,185 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-05 22:45:52,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:45:52,186 INFO L85 PathProgramCache]: Analyzing trace with hash -100608048, now seen corresponding path program 1 times [2022-12-05 22:45:52,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:45:52,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519061218] [2022-12-05 22:45:52,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:52,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:45:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:52,291 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-05 22:45:52,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:45:52,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519061218] [2022-12-05 22:45:52,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519061218] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:45:52,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644380532] [2022-12-05 22:45:52,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:45:52,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:45:52,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:45:52,293 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-05 22:45:52,294 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-05 22:45:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:45:52,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:45:52,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:45:52,457 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-05 22:45:52,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:45:52,597 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-05 22:45:52,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644380532] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:45:52,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:45:52,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:45:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741281810] [2022-12-05 22:45:52,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:45:52,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:45:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:45:52,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:45:52,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:45:52,598 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-05 22:45:52,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 1682 transitions, 64852 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:45:52,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:45:52,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-05 22:45:52,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:45:55,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:45:58,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:46:05,546 INFO L130 PetriNetUnfolder]: 5623/10074 cut-off events. [2022-12-05 22:46:05,546 INFO L131 PetriNetUnfolder]: For 1431216/1431216 co-relation queries the response was YES. [2022-12-05 22:46:05,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131157 conditions, 10074 events. 5623/10074 cut-off events. For 1431216/1431216 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 83446 event pairs, 1083 based on Foata normal form. 46/10095 useless extension candidates. Maximal degree in co-relation 130962. Up to 7117 conditions per place. [2022-12-05 22:46:05,674 INFO L137 encePairwiseOnDemand]: 9/69 looper letters, 1119 selfloop transitions, 737 changer transitions 2/1858 dead transitions. [2022-12-05 22:46:05,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 1858 transitions, 73114 flow [2022-12-05 22:46:05,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 22:46:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 22:46:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 156 transitions. [2022-12-05 22:46:05,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1329923273657289 [2022-12-05 22:46:05,676 INFO L175 Difference]: Start difference. First operand has 514 places, 1682 transitions, 64852 flow. Second operand 17 states and 156 transitions. [2022-12-05 22:46:05,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 1858 transitions, 73114 flow [2022-12-05 22:46:18,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 1858 transitions, 73091 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-05 22:46:18,408 INFO L231 Difference]: Finished difference. Result has 534 places, 1780 transitions, 71645 flow [2022-12-05 22:46:18,409 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=64833, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=654, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=71645, PETRI_PLACES=534, PETRI_TRANSITIONS=1780} [2022-12-05 22:46:18,409 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 516 predicate places. [2022-12-05 22:46:18,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:46:18,409 INFO L89 Accepts]: Start accepts. Operand has 534 places, 1780 transitions, 71645 flow [2022-12-05 22:46:18,421 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:46:18,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:46:18,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 534 places, 1780 transitions, 71645 flow [2022-12-05 22:46:18,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 534 places, 1780 transitions, 71645 flow [2022-12-05 22:46:19,779 INFO L130 PetriNetUnfolder]: 1099/2928 cut-off events. [2022-12-05 22:46:19,779 INFO L131 PetriNetUnfolder]: For 325236/325339 co-relation queries the response was YES. [2022-12-05 22:46:19,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50008 conditions, 2928 events. 1099/2928 cut-off events. For 325236/325339 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 28779 event pairs, 0 based on Foata normal form. 5/2929 useless extension candidates. Maximal degree in co-relation 49810. Up to 1618 conditions per place. [2022-12-05 22:46:19,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 534 places, 1780 transitions, 71645 flow [2022-12-05 22:46:19,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 4704 [2022-12-05 22:46:19,863 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:46:19,863 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1454 [2022-12-05 22:46:19,863 INFO L495 AbstractCegarLoop]: Abstraction has has 534 places, 1780 transitions, 71645 flow [2022-12-05 22:46:19,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:46:19,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:46:19,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:46:19,868 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-05 22:46:20,067 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,SelfDestructingSolverStorable45 [2022-12-05 22:46:20,067 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-05 22:46:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:46:20,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1680465507, now seen corresponding path program 1 times [2022-12-05 22:46:20,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:46:20,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092698799] [2022-12-05 22:46:20,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:46:20,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:46:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:46:20,180 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-05 22:46:20,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:46:20,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092698799] [2022-12-05 22:46:20,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092698799] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:46:20,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706080071] [2022-12-05 22:46:20,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:46:20,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:46:20,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:46:20,182 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-05 22:46:20,187 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-05 22:46:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:46:20,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:46:20,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:46:20,501 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-05 22:46:20,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:46:20,653 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-05 22:46:20,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706080071] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:46:20,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:46:20,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:46:20,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084344303] [2022-12-05 22:46:20,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:46:20,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:46:20,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:46:20,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:46:20,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:46:20,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-05 22:46:20,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 1780 transitions, 71645 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:46:20,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:46:20,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-05 22:46:20,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:46:24,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:46:26,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:46:28,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:46:34,646 INFO L130 PetriNetUnfolder]: 5827/10438 cut-off events. [2022-12-05 22:46:34,647 INFO L131 PetriNetUnfolder]: For 1603713/1603713 co-relation queries the response was YES. [2022-12-05 22:46:34,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139566 conditions, 10438 events. 5827/10438 cut-off events. For 1603713/1603713 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 86594 event pairs, 956 based on Foata normal form. 52/10465 useless extension candidates. Maximal degree in co-relation 139365. Up to 6764 conditions per place. [2022-12-05 22:46:34,899 INFO L137 encePairwiseOnDemand]: 8/69 looper letters, 1191 selfloop transitions, 774 changer transitions 1/1966 dead transitions. [2022-12-05 22:46:34,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 1966 transitions, 79797 flow [2022-12-05 22:46:34,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-05 22:46:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-05 22:46:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 223 transitions. [2022-12-05 22:46:34,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12927536231884057 [2022-12-05 22:46:34,912 INFO L175 Difference]: Start difference. First operand has 534 places, 1780 transitions, 71645 flow. Second operand 25 states and 223 transitions. [2022-12-05 22:46:34,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 1966 transitions, 79797 flow [2022-12-05 22:46:47,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 1966 transitions, 78842 flow, removed 421 selfloop flow, removed 6 redundant places. [2022-12-05 22:46:47,495 INFO L231 Difference]: Finished difference. Result has 560 places, 1849 transitions, 76110 flow [2022-12-05 22:46:47,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=70706, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=708, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=76110, PETRI_PLACES=560, PETRI_TRANSITIONS=1849} [2022-12-05 22:46:47,497 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 542 predicate places. [2022-12-05 22:46:47,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:46:47,497 INFO L89 Accepts]: Start accepts. Operand has 560 places, 1849 transitions, 76110 flow [2022-12-05 22:46:47,510 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:46:47,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:46:47,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 560 places, 1849 transitions, 76110 flow [2022-12-05 22:46:47,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 560 places, 1849 transitions, 76110 flow [2022-12-05 22:46:48,736 INFO L130 PetriNetUnfolder]: 1129/3020 cut-off events. [2022-12-05 22:46:48,736 INFO L131 PetriNetUnfolder]: For 361878/361987 co-relation queries the response was YES. [2022-12-05 22:46:48,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52913 conditions, 3020 events. 1129/3020 cut-off events. For 361878/361987 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 29777 event pairs, 0 based on Foata normal form. 5/3021 useless extension candidates. Maximal degree in co-relation 52706. Up to 1684 conditions per place. [2022-12-05 22:46:48,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 560 places, 1849 transitions, 76110 flow [2022-12-05 22:46:48,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 4892 [2022-12-05 22:46:48,814 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:46:48,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1317 [2022-12-05 22:46:48,814 INFO L495 AbstractCegarLoop]: Abstraction has has 560 places, 1849 transitions, 76110 flow [2022-12-05 22:46:48,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:46:48,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:46:48,815 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:46:48,819 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-05 22:46:49,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-05 22:46:49,016 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-05 22:46:49,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:46:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1605064486, now seen corresponding path program 1 times [2022-12-05 22:46:49,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:46:49,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521192910] [2022-12-05 22:46:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:46:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:46:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:46:49,139 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-05 22:46:49,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:46:49,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521192910] [2022-12-05 22:46:49,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521192910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:46:49,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238867631] [2022-12-05 22:46:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:46:49,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:46:49,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:46:49,144 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-05 22:46:49,173 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-05 22:46:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:46:49,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:46:49,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:46:49,388 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-05 22:46:49,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:46:49,546 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-05 22:46:49,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238867631] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:46:49,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:46:49,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:46:49,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966866375] [2022-12-05 22:46:49,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:46:49,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:46:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:46:49,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:46:49,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:46:49,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-05 22:46:49,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 1849 transitions, 76110 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:46:49,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:46:49,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-05 22:46:49,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:46:53,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:46:55,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:46:57,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:46:58,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:47:00,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:47:03,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:47:16,139 INFO L130 PetriNetUnfolder]: 6103/10928 cut-off events. [2022-12-05 22:47:16,140 INFO L131 PetriNetUnfolder]: For 1788107/1788107 co-relation queries the response was YES. [2022-12-05 22:47:16,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149458 conditions, 10928 events. 6103/10928 cut-off events. For 1788107/1788107 co-relation queries the response was YES. Maximal size of possible extension queue 1191. Compared 91447 event pairs, 538 based on Foata normal form. 64/10967 useless extension candidates. Maximal degree in co-relation 149248. Up to 6013 conditions per place. [2022-12-05 22:47:16,283 INFO L137 encePairwiseOnDemand]: 8/69 looper letters, 1027 selfloop transitions, 1071 changer transitions 4/2102 dead transitions. [2022-12-05 22:47:16,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 2102 transitions, 86582 flow [2022-12-05 22:47:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-05 22:47:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-05 22:47:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 269 transitions. [2022-12-05 22:47:16,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10829307568438003 [2022-12-05 22:47:16,284 INFO L175 Difference]: Start difference. First operand has 560 places, 1849 transitions, 76110 flow. Second operand 36 states and 269 transitions. [2022-12-05 22:47:16,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 2102 transitions, 86582 flow [2022-12-05 22:47:31,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 2102 transitions, 85722 flow, removed 339 selfloop flow, removed 11 redundant places. [2022-12-05 22:47:31,201 INFO L231 Difference]: Finished difference. Result has 596 places, 1960 transitions, 83845 flow [2022-12-05 22:47:31,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=75180, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1846, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=981, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=832, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=83845, PETRI_PLACES=596, PETRI_TRANSITIONS=1960} [2022-12-05 22:47:31,203 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 578 predicate places. [2022-12-05 22:47:31,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:47:31,203 INFO L89 Accepts]: Start accepts. Operand has 596 places, 1960 transitions, 83845 flow [2022-12-05 22:47:31,222 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:47:31,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:47:31,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 596 places, 1960 transitions, 83845 flow [2022-12-05 22:47:31,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 596 places, 1960 transitions, 83845 flow [2022-12-05 22:47:32,609 INFO L130 PetriNetUnfolder]: 1170/3133 cut-off events. [2022-12-05 22:47:32,609 INFO L131 PetriNetUnfolder]: For 395451/395554 co-relation queries the response was YES. [2022-12-05 22:47:32,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56677 conditions, 3133 events. 1170/3133 cut-off events. For 395451/395554 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 31160 event pairs, 0 based on Foata normal form. 5/3134 useless extension candidates. Maximal degree in co-relation 56458. Up to 1766 conditions per place. [2022-12-05 22:47:32,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 596 places, 1960 transitions, 83845 flow [2022-12-05 22:47:32,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 5164 [2022-12-05 22:47:32,780 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:47:32,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1578 [2022-12-05 22:47:32,781 INFO L495 AbstractCegarLoop]: Abstraction has has 596 places, 1960 transitions, 83881 flow [2022-12-05 22:47:32,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:47:32,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:47:32,782 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:47:32,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-05 22:47:32,982 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,SelfDestructingSolverStorable47 [2022-12-05 22:47:32,982 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-05 22:47:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:47:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1136239259, now seen corresponding path program 1 times [2022-12-05 22:47:32,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:47:32,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048851990] [2022-12-05 22:47:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:47:32,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:47:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:47:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:47:33,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:47:33,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048851990] [2022-12-05 22:47:33,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048851990] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:47:33,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587149982] [2022-12-05 22:47:33,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:47:33,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:47:33,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:47:33,112 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-05 22:47:33,114 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-05 22:47:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:47:33,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 22:47:33,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:47:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:47:33,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:47:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:47:33,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587149982] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:47:33,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:47:33,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-05 22:47:33,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389700612] [2022-12-05 22:47:33,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:47:33,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-05 22:47:33,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:47:33,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-05 22:47:33,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2022-12-05 22:47:33,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-05 22:47:33,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 1960 transitions, 83881 flow. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:47:33,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:47:33,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-05 22:47:33,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:47:43,307 INFO L130 PetriNetUnfolder]: 6623/11792 cut-off events. [2022-12-05 22:47:43,307 INFO L131 PetriNetUnfolder]: For 2125899/2125899 co-relation queries the response was YES. [2022-12-05 22:47:43,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169446 conditions, 11792 events. 6623/11792 cut-off events. For 2125899/2125899 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 98572 event pairs, 664 based on Foata normal form. 42/11809 useless extension candidates. Maximal degree in co-relation 169224. Up to 6607 conditions per place. [2022-12-05 22:47:43,470 INFO L137 encePairwiseOnDemand]: 8/71 looper letters, 1194 selfloop transitions, 993 changer transitions 0/2187 dead transitions. [2022-12-05 22:47:43,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 2187 transitions, 94535 flow [2022-12-05 22:47:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-05 22:47:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-05 22:47:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 226 transitions. [2022-12-05 22:47:43,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15157612340710933 [2022-12-05 22:47:43,471 INFO L175 Difference]: Start difference. First operand has 596 places, 1960 transitions, 83881 flow. Second operand 21 states and 226 transitions. [2022-12-05 22:47:43,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 2187 transitions, 94535 flow [2022-12-05 22:48:01,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 2187 transitions, 92471 flow, removed 870 selfloop flow, removed 14 redundant places. [2022-12-05 22:48:01,612 INFO L231 Difference]: Finished difference. Result has 608 places, 2060 transitions, 89541 flow [2022-12-05 22:48:01,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=81833, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1960, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=907, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=89541, PETRI_PLACES=608, PETRI_TRANSITIONS=2060} [2022-12-05 22:48:01,614 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 590 predicate places. [2022-12-05 22:48:01,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:48:01,614 INFO L89 Accepts]: Start accepts. Operand has 608 places, 2060 transitions, 89541 flow [2022-12-05 22:48:01,624 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:48:01,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:48:01,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 608 places, 2060 transitions, 89541 flow [2022-12-05 22:48:01,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 608 places, 2060 transitions, 89541 flow [2022-12-05 22:48:03,255 INFO L130 PetriNetUnfolder]: 1245/3330 cut-off events. [2022-12-05 22:48:03,255 INFO L131 PetriNetUnfolder]: For 453001/453110 co-relation queries the response was YES. [2022-12-05 22:48:03,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61858 conditions, 3330 events. 1245/3330 cut-off events. For 453001/453110 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 33460 event pairs, 0 based on Foata normal form. 5/3331 useless extension candidates. Maximal degree in co-relation 61634. Up to 1852 conditions per place. [2022-12-05 22:48:03,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 608 places, 2060 transitions, 89541 flow [2022-12-05 22:48:03,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 5526 [2022-12-05 22:48:03,419 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:48:03,419 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1805 [2022-12-05 22:48:03,419 INFO L495 AbstractCegarLoop]: Abstraction has has 608 places, 2060 transitions, 89565 flow [2022-12-05 22:48:03,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:48:03,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:48:03,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:48:03,426 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-05 22:48:03,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:48:03,620 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-05 22:48:03,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:48:03,620 INFO L85 PathProgramCache]: Analyzing trace with hash -118121250, now seen corresponding path program 1 times [2022-12-05 22:48:03,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:48:03,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000122137] [2022-12-05 22:48:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:48:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:03,721 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-05 22:48:03,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:48:03,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000122137] [2022-12-05 22:48:03,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000122137] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:48:03,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316740994] [2022-12-05 22:48:03,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:03,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:48:03,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:48:03,723 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-05 22:48:03,724 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-05 22:48:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:03,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:48:03,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:48:03,896 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-05 22:48:03,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:48:04,005 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-05 22:48:04,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316740994] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:48:04,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:48:04,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-05 22:48:04,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320751970] [2022-12-05 22:48:04,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:48:04,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-05 22:48:04,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:48:04,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-05 22:48:04,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-12-05 22:48:04,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-05 22:48:04,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 2060 transitions, 89565 flow. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:48:04,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:48:04,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-05 22:48:04,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:48:08,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:48:09,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:48:12,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:48:22,528 INFO L130 PetriNetUnfolder]: 6721/11988 cut-off events. [2022-12-05 22:48:22,529 INFO L131 PetriNetUnfolder]: For 2408660/2408660 co-relation queries the response was YES. [2022-12-05 22:48:22,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174748 conditions, 11988 events. 6721/11988 cut-off events. For 2408660/2408660 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 101113 event pairs, 1494 based on Foata normal form. 66/12029 useless extension candidates. Maximal degree in co-relation 174521. Up to 9875 conditions per place. [2022-12-05 22:48:22,706 INFO L137 encePairwiseOnDemand]: 11/73 looper letters, 1638 selfloop transitions, 532 changer transitions 5/2175 dead transitions. [2022-12-05 22:48:22,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 2175 transitions, 96850 flow [2022-12-05 22:48:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 22:48:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 22:48:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 157 transitions. [2022-12-05 22:48:22,708 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12651087832393232 [2022-12-05 22:48:22,708 INFO L175 Difference]: Start difference. First operand has 608 places, 2060 transitions, 89565 flow. Second operand 17 states and 157 transitions. [2022-12-05 22:48:22,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 2175 transitions, 96850 flow [2022-12-05 22:48:43,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 2175 transitions, 95244 flow, removed 619 selfloop flow, removed 9 redundant places. [2022-12-05 22:48:43,430 INFO L231 Difference]: Finished difference. Result has 620 places, 2108 transitions, 92468 flow [2022-12-05 22:48:43,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=88147, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=496, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=92468, PETRI_PLACES=620, PETRI_TRANSITIONS=2108} [2022-12-05 22:48:43,431 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 602 predicate places. [2022-12-05 22:48:43,431 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:48:43,431 INFO L89 Accepts]: Start accepts. Operand has 620 places, 2108 transitions, 92468 flow [2022-12-05 22:48:43,450 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:48:43,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:48:43,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 620 places, 2108 transitions, 92468 flow [2022-12-05 22:48:43,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 620 places, 2108 transitions, 92468 flow [2022-12-05 22:48:44,947 INFO L130 PetriNetUnfolder]: 1296/3429 cut-off events. [2022-12-05 22:48:44,947 INFO L131 PetriNetUnfolder]: For 484424/484555 co-relation queries the response was YES. [2022-12-05 22:48:44,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63908 conditions, 3429 events. 1296/3429 cut-off events. For 484424/484555 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 34389 event pairs, 1 based on Foata normal form. 5/3430 useless extension candidates. Maximal degree in co-relation 63681. Up to 1874 conditions per place. [2022-12-05 22:48:45,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 620 places, 2108 transitions, 92468 flow [2022-12-05 22:48:45,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 5606 [2022-12-05 22:48:45,042 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:48:45,043 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1612 [2022-12-05 22:48:45,043 INFO L495 AbstractCegarLoop]: Abstraction has has 620 places, 2108 transitions, 92468 flow [2022-12-05 22:48:45,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:48:45,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:48:45,043 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:48:45,050 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-05 22:48:45,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-05 22:48:45,249 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-05 22:48:45,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:48:45,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1938009663, now seen corresponding path program 1 times [2022-12-05 22:48:45,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:48:45,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972426418] [2022-12-05 22:48:45,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:45,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:48:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:45,502 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-05 22:48:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:48:45,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972426418] [2022-12-05 22:48:45,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972426418] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:48:45,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904667095] [2022-12-05 22:48:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:48:45,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:48:45,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:48:45,504 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-05 22:48:45,505 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-05 22:48:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:48:45,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:48:45,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:48:45,692 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-05 22:48:45,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:48:45,866 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-05 22:48:45,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904667095] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:48:45,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:48:45,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:48:45,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533188136] [2022-12-05 22:48:45,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:48:45,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:48:45,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:48:45,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:48:45,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:48:45,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-05 22:48:45,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 2108 transitions, 92468 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:48:45,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:48:45,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-05 22:48:45,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:48:53,354 WARN L233 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 44 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:49:01,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:49:11,828 INFO L130 PetriNetUnfolder]: 6999/12536 cut-off events. [2022-12-05 22:49:11,828 INFO L131 PetriNetUnfolder]: For 2441967/2441967 co-relation queries the response was YES. [2022-12-05 22:49:11,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179702 conditions, 12536 events. 6999/12536 cut-off events. For 2441967/2441967 co-relation queries the response was YES. Maximal size of possible extension queue 1391. Compared 107282 event pairs, 1136 based on Foata normal form. 70/12581 useless extension candidates. Maximal degree in co-relation 179472. Up to 8415 conditions per place. [2022-12-05 22:49:12,090 INFO L137 encePairwiseOnDemand]: 12/73 looper letters, 1432 selfloop transitions, 979 changer transitions 5/2416 dead transitions. [2022-12-05 22:49:12,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 2416 transitions, 104242 flow [2022-12-05 22:49:12,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-05 22:49:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-12-05 22:49:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 291 transitions. [2022-12-05 22:49:12,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.0949119373776908 [2022-12-05 22:49:12,091 INFO L175 Difference]: Start difference. First operand has 620 places, 2108 transitions, 92468 flow. Second operand 42 states and 291 transitions. [2022-12-05 22:49:12,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 2416 transitions, 104242 flow [2022-12-05 22:49:31,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 2416 transitions, 103706 flow, removed 177 selfloop flow, removed 12 redundant places. [2022-12-05 22:49:31,620 INFO L231 Difference]: Finished difference. Result has 662 places, 2248 transitions, 101249 flow [2022-12-05 22:49:31,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=91936, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=848, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=101249, PETRI_PLACES=662, PETRI_TRANSITIONS=2248} [2022-12-05 22:49:31,621 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 644 predicate places. [2022-12-05 22:49:31,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:49:31,621 INFO L89 Accepts]: Start accepts. Operand has 662 places, 2248 transitions, 101249 flow [2022-12-05 22:49:31,637 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:49:31,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:49:31,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 662 places, 2248 transitions, 101249 flow [2022-12-05 22:49:31,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 662 places, 2248 transitions, 101249 flow [2022-12-05 22:49:33,532 INFO L130 PetriNetUnfolder]: 1361/3627 cut-off events. [2022-12-05 22:49:33,532 INFO L131 PetriNetUnfolder]: For 483314/483430 co-relation queries the response was YES. [2022-12-05 22:49:33,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68481 conditions, 3627 events. 1361/3627 cut-off events. For 483314/483430 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 36975 event pairs, 1 based on Foata normal form. 5/3628 useless extension candidates. Maximal degree in co-relation 68240. Up to 2009 conditions per place. [2022-12-05 22:49:33,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 662 places, 2248 transitions, 101249 flow [2022-12-05 22:49:33,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 5908 [2022-12-05 22:49:33,773 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:49:33,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2153 [2022-12-05 22:49:33,774 INFO L495 AbstractCegarLoop]: Abstraction has has 662 places, 2248 transitions, 101298 flow [2022-12-05 22:49:33,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:49:33,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:49:33,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:49:33,787 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-05 22:49:33,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:49:33,980 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-05 22:49:33,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:49:33,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2087143006, now seen corresponding path program 1 times [2022-12-05 22:49:33,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:49:33,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146858647] [2022-12-05 22:49:33,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:49:33,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:49:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:49:34,150 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-05 22:49:34,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:49:34,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146858647] [2022-12-05 22:49:34,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146858647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:49:34,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274939260] [2022-12-05 22:49:34,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:49:34,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:49:34,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:49:34,152 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-05 22:49:34,154 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-05 22:49:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:49:34,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:49:34,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:49:34,344 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-05 22:49:34,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:49:34,508 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-05 22:49:34,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274939260] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:49:34,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:49:34,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:49:34,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78566346] [2022-12-05 22:49:34,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:49:34,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:49:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:49:34,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:49:34,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:49:34,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 76 [2022-12-05 22:49:34,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 2248 transitions, 101298 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:49:34,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:49:34,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 76 [2022-12-05 22:49:34,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:49:38,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:49:49,008 INFO L130 PetriNetUnfolder]: 7349/13154 cut-off events. [2022-12-05 22:49:49,008 INFO L131 PetriNetUnfolder]: For 2829388/2829388 co-relation queries the response was YES. [2022-12-05 22:49:49,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197498 conditions, 13154 events. 7349/13154 cut-off events. For 2829388/2829388 co-relation queries the response was YES. Maximal size of possible extension queue 1450. Compared 113365 event pairs, 1307 based on Foata normal form. 56/13185 useless extension candidates. Maximal degree in co-relation 197254. Up to 9369 conditions per place. [2022-12-05 22:49:49,209 INFO L137 encePairwiseOnDemand]: 16/76 looper letters, 1600 selfloop transitions, 849 changer transitions 0/2449 dead transitions. [2022-12-05 22:49:49,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 2449 transitions, 112451 flow [2022-12-05 22:49:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-05 22:49:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-05 22:49:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 219 transitions. [2022-12-05 22:49:49,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11526315789473685 [2022-12-05 22:49:49,211 INFO L175 Difference]: Start difference. First operand has 662 places, 2248 transitions, 101298 flow. Second operand 25 states and 219 transitions. [2022-12-05 22:49:49,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 2449 transitions, 112451 flow [2022-12-05 22:50:14,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 2449 transitions, 110856 flow, removed 731 selfloop flow, removed 9 redundant places. [2022-12-05 22:50:14,501 INFO L231 Difference]: Finished difference. Result has 688 places, 2343 transitions, 107572 flow [2022-12-05 22:50:14,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=99829, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=769, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=107572, PETRI_PLACES=688, PETRI_TRANSITIONS=2343} [2022-12-05 22:50:14,502 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 670 predicate places. [2022-12-05 22:50:14,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:50:14,503 INFO L89 Accepts]: Start accepts. Operand has 688 places, 2343 transitions, 107572 flow [2022-12-05 22:50:14,523 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:50:14,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:50:14,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 688 places, 2343 transitions, 107572 flow [2022-12-05 22:50:14,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 688 places, 2343 transitions, 107572 flow [2022-12-05 22:50:16,704 INFO L130 PetriNetUnfolder]: 1427/3799 cut-off events. [2022-12-05 22:50:16,704 INFO L131 PetriNetUnfolder]: For 603145/603296 co-relation queries the response was YES. [2022-12-05 22:50:16,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74113 conditions, 3799 events. 1427/3799 cut-off events. For 603145/603296 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 39000 event pairs, 2 based on Foata normal form. 5/3800 useless extension candidates. Maximal degree in co-relation 73860. Up to 2124 conditions per place. [2022-12-05 22:50:16,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 688 places, 2343 transitions, 107572 flow [2022-12-05 22:50:16,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 6160 [2022-12-05 22:50:16,855 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:50:16,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2353 [2022-12-05 22:50:16,856 INFO L495 AbstractCegarLoop]: Abstraction has has 688 places, 2343 transitions, 107580 flow [2022-12-05 22:50:16,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:50:16,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:50:16,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:50:16,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-05 22:50:17,061 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,SelfDestructingSolverStorable51 [2022-12-05 22:50:17,061 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-05 22:50:17,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:50:17,061 INFO L85 PathProgramCache]: Analyzing trace with hash 659499107, now seen corresponding path program 1 times [2022-12-05 22:50:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:50:17,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856588252] [2022-12-05 22:50:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:50:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:17,158 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-05 22:50:17,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:50:17,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856588252] [2022-12-05 22:50:17,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856588252] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:50:17,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78660943] [2022-12-05 22:50:17,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:50:17,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:50:17,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:50:17,160 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-05 22:50:17,161 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-05 22:50:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:50:17,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 22:50:17,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:50:17,349 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-05 22:50:17,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:50:17,638 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-05 22:50:17,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78660943] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:50:17,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:50:17,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:50:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99176813] [2022-12-05 22:50:17,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:50:17,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:50:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:50:17,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:50:17,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:50:17,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 77 [2022-12-05 22:50:17,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 2343 transitions, 107580 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:50:17,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:50:17,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 77 [2022-12-05 22:50:17,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:50:33,931 WARN L233 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 41 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:50:40,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:50:47,349 WARN L233 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 34 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:50:58,263 WARN L233 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 33 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 22:51:14,265 INFO L130 PetriNetUnfolder]: 7551/13554 cut-off events. [2022-12-05 22:51:14,265 INFO L131 PetriNetUnfolder]: For 2847879/2847879 co-relation queries the response was YES. [2022-12-05 22:51:14,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206825 conditions, 13554 events. 7551/13554 cut-off events. For 2847879/2847879 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 117441 event pairs, 1492 based on Foata normal form. 38/13567 useless extension candidates. Maximal degree in co-relation 206569. Up to 10425 conditions per place. [2022-12-05 22:51:14,480 INFO L137 encePairwiseOnDemand]: 11/77 looper letters, 1766 selfloop transitions, 809 changer transitions 10/2585 dead transitions. [2022-12-05 22:51:14,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 2585 transitions, 118160 flow [2022-12-05 22:51:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-05 22:51:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-05 22:51:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 266 transitions. [2022-12-05 22:51:14,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.08636363636363636 [2022-12-05 22:51:14,481 INFO L175 Difference]: Start difference. First operand has 688 places, 2343 transitions, 107580 flow. Second operand 40 states and 266 transitions. [2022-12-05 22:51:14,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 727 places, 2585 transitions, 118160 flow [2022-12-05 22:51:41,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 2585 transitions, 116711 flow, removed 599 selfloop flow, removed 8 redundant places. [2022-12-05 22:51:42,065 INFO L231 Difference]: Finished difference. Result has 724 places, 2438 transitions, 113514 flow [2022-12-05 22:51:42,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=106151, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=728, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=113514, PETRI_PLACES=724, PETRI_TRANSITIONS=2438} [2022-12-05 22:51:42,067 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 706 predicate places. [2022-12-05 22:51:42,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:51:42,067 INFO L89 Accepts]: Start accepts. Operand has 724 places, 2438 transitions, 113514 flow [2022-12-05 22:51:42,093 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:51:42,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:51:42,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 724 places, 2438 transitions, 113514 flow [2022-12-05 22:51:42,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 724 places, 2438 transitions, 113514 flow [2022-12-05 22:51:45,006 INFO L130 PetriNetUnfolder]: 1484/3950 cut-off events. [2022-12-05 22:51:45,006 INFO L131 PetriNetUnfolder]: For 637550/637711 co-relation queries the response was YES. [2022-12-05 22:51:45,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77533 conditions, 3950 events. 1484/3950 cut-off events. For 637550/637711 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 40799 event pairs, 2 based on Foata normal form. 5/3951 useless extension candidates. Maximal degree in co-relation 77276. Up to 2113 conditions per place. [2022-12-05 22:51:45,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 724 places, 2438 transitions, 113514 flow [2022-12-05 22:51:45,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 6356 [2022-12-05 22:51:45,404 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:51:45,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3338 [2022-12-05 22:51:45,405 INFO L495 AbstractCegarLoop]: Abstraction has has 724 places, 2438 transitions, 113689 flow [2022-12-05 22:51:45,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:51:45,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:51:45,405 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:51:45,412 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-05 22:51:45,605 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,SelfDestructingSolverStorable52 [2022-12-05 22:51:45,606 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-05 22:51:45,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:51:45,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1995268523, now seen corresponding path program 1 times [2022-12-05 22:51:45,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:51:45,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088512977] [2022-12-05 22:51:45,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:51:45,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:51:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:51:45,777 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-05 22:51:45,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:51:45,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088512977] [2022-12-05 22:51:45,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088512977] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 22:51:45,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149022935] [2022-12-05 22:51:45,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:51:45,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 22:51:45,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:51:45,780 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-05 22:51:45,781 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-05 22:51:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:51:45,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 22:51:45,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 22:51:45,985 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-05 22:51:45,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 22:51:46,119 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-05 22:51:46,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149022935] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 22:51:46,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 22:51:46,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-05 22:51:46,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932734996] [2022-12-05 22:51:46,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 22:51:46,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-05 22:51:46,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:51:46,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-05 22:51:46,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-05 22:51:46,120 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-05 22:51:46,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 724 places, 2438 transitions, 113689 flow. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:51:46,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:51:46,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-05 22:51:46,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:51:56,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:51:59,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:52:01,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:52:12,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:52:13,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:52:22,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:52:23,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 22:52:26,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2022-12-05 22:52:29,829 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-05 22:52:29,845 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-05 22:52:30,853 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-05 22:52:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-05 22:52:30,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-05 22:52:30,883 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:500) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:238) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-05 22:52:30,886 INFO L158 Benchmark]: Toolchain (without parser) took 838249.52ms. Allocated memory was 188.7MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 163.8MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-05 22:52:30,886 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 188.7MB. Free memory was 166.5MB in the beginning and 166.5MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:52:30,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.89ms. Allocated memory is still 188.7MB. Free memory was 163.8MB in the beginning and 143.4MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-05 22:52:30,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.19ms. Allocated memory is still 188.7MB. Free memory was 143.4MB in the beginning and 141.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:52:30,887 INFO L158 Benchmark]: Boogie Preprocessor took 24.71ms. Allocated memory is still 188.7MB. Free memory was 141.7MB in the beginning and 139.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:52:30,887 INFO L158 Benchmark]: RCFGBuilder took 463.61ms. Allocated memory is still 188.7MB. Free memory was 139.7MB in the beginning and 126.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-05 22:52:30,887 INFO L158 Benchmark]: TraceAbstraction took 837293.71ms. Allocated memory was 188.7MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 125.6MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-05 22:52:30,888 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.14ms. Allocated memory is still 188.7MB. Free memory was 166.5MB in the beginning and 166.5MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 401.89ms. Allocated memory is still 188.7MB. Free memory was 163.8MB in the beginning and 143.4MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.19ms. Allocated memory is still 188.7MB. Free memory was 143.4MB in the beginning and 141.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.71ms. Allocated memory is still 188.7MB. Free memory was 141.7MB in the beginning and 139.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 463.61ms. Allocated memory is still 188.7MB. Free memory was 139.7MB in the beginning and 126.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 837293.71ms. Allocated memory was 188.7MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 125.6MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 91 PlacesBefore, 18 PlacesAfterwards, 91 TransitionsBefore, 14 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 47 ConcurrentYvCompositions, 4 ChoiceCompositions, 77 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 1109, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1122, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1096, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1096, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1122, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1096, unknown conditional: 0, unknown unconditional: 1096] , Statistics on independence cache: Total cache size (in pairs): 1947, Positive cache size: 1936, Positive conditional cache size: 0, Positive unconditional cache size: 1936, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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, 18 PlacesBefore, 18 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 78 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 [2022-12-05 22:52:30,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Lipton Reduction Statistics: ReductionTime: 0.3s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 42, Positive conditional cache size: 42, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 102, Positive conditional cache size: 102, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 180, Positive conditional cache size: 180, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 22 PlacesAfterwards, 17 TransitionsBefore, 14 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 282, Positive conditional cache size: 282, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 354, Positive conditional cache size: 354, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 390, Positive conditional cache size: 390, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 468, Positive cache size: 468, Positive conditional cache size: 468, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 504, Positive cache size: 504, Positive conditional cache size: 504, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 21 PlacesBefore, 20 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 522, Positive cache size: 522, Positive conditional cache size: 522, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 27 PlacesBefore, 26 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 16, independent conditional: 16, 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): 554, Positive cache size: 554, Positive conditional cache size: 554, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 132 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): 554, Positive cache size: 554, Positive conditional cache size: 554, 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.4s, 37 PlacesBefore, 37 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 20, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 760, Positive cache size: 760, Positive conditional cache size: 760, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 232 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): 760, Positive cache size: 760, Positive conditional cache size: 760, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 380 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): 760, Positive cache size: 760, Positive conditional cache size: 760, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 284 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): 760, Positive cache size: 760, Positive conditional cache size: 760, 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.2s, 56 PlacesBefore, 56 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 6, independent: 2, independent conditional: 2, 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): 857, Positive cache size: 857, Positive conditional cache size: 857, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 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): 959, Positive cache size: 959, Positive conditional cache size: 959, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 78 PlacesBefore, 78 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 1151, Positive cache size: 1151, Positive conditional cache size: 1151, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 93 PlacesBefore, 93 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1354, Positive cache size: 1354, Positive conditional cache size: 1354, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 5, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 5, independent: 0, independent conditional: 0, 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): 1465, Positive cache size: 1465, Positive conditional cache size: 1465, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 121 PlacesBefore, 121 PlacesAfterwards, 234 TransitionsBefore, 234 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 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: 11, independent: 6, independent conditional: 6, 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): 1669, Positive cache size: 1669, Positive conditional cache size: 1669, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 136 PlacesBefore, 136 PlacesAfterwards, 281 TransitionsBefore, 281 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 5, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 5, independent: 0, independent conditional: 0, 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): 1785, Positive cache size: 1785, Positive conditional cache size: 1785, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 152 PlacesBefore, 152 PlacesAfterwards, 319 TransitionsBefore, 319 TransitionsAfterwards, 1026 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): 1785, Positive cache size: 1785, Positive conditional cache size: 1785, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 166 PlacesBefore, 166 PlacesAfterwards, 345 TransitionsBefore, 345 TransitionsAfterwards, 1078 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): 1785, Positive cache size: 1785, Positive conditional cache size: 1785, 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, 179 PlacesBefore, 179 PlacesAfterwards, 393 TransitionsBefore, 393 TransitionsAfterwards, 1242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1996, Positive cache size: 1996, Positive conditional cache size: 1996, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 191 PlacesBefore, 191 PlacesAfterwards, 427 TransitionsBefore, 427 TransitionsAfterwards, 1324 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): 1996, Positive cache size: 1996, Positive conditional cache size: 1996, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 211 PlacesBefore, 211 PlacesAfterwards, 492 TransitionsBefore, 492 TransitionsAfterwards, 1524 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): 1996, Positive cache size: 1996, Positive conditional cache size: 1996, 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.4s, 235 PlacesBefore, 235 PlacesAfterwards, 530 TransitionsBefore, 530 TransitionsAfterwards, 1596 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 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: 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: 8, independent: 1, independent conditional: 1, 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): 2325, Positive cache size: 2325, Positive conditional cache size: 2325, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 256 PlacesBefore, 256 PlacesAfterwards, 638 TransitionsBefore, 638 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 34, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2819, Positive cache size: 2819, Positive conditional cache size: 2819, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 275 PlacesBefore, 275 PlacesAfterwards, 701 TransitionsBefore, 701 TransitionsAfterwards, 1996 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3169, Positive cache size: 3169, Positive conditional cache size: 3169, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 299 PlacesBefore, 299 PlacesAfterwards, 761 TransitionsBefore, 761 TransitionsAfterwards, 2118 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): 3169, Positive cache size: 3169, Positive conditional cache size: 3169, 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, 305 PlacesBefore, 305 PlacesAfterwards, 795 TransitionsBefore, 795 TransitionsAfterwards, 2194 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 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): 3171, Positive cache size: 3171, Positive conditional cache size: 3171, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 331 PlacesBefore, 331 PlacesAfterwards, 901 TransitionsBefore, 901 TransitionsAfterwards, 2470 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 22, 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: 22, independent: 22, independent conditional: 22, 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: 22, independent: 14, independent conditional: 14, 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): 3597, Positive cache size: 3597, Positive conditional cache size: 3597, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 338 PlacesBefore, 338 PlacesAfterwards, 958 TransitionsBefore, 958 TransitionsAfterwards, 2580 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): 3597, Positive cache size: 3597, Positive conditional cache size: 3597, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 359 PlacesBefore, 359 PlacesAfterwards, 1019 TransitionsBefore, 1019 TransitionsAfterwards, 2716 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): 3597, Positive cache size: 3597, Positive conditional cache size: 3597, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 383 PlacesBefore, 383 PlacesAfterwards, 1116 TransitionsBefore, 1116 TransitionsAfterwards, 3002 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 5, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 5, independent: 0, independent conditional: 0, 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): 3722, Positive cache size: 3722, Positive conditional cache size: 3722, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 399 PlacesBefore, 399 PlacesAfterwards, 1284 TransitionsBefore, 1284 TransitionsAfterwards, 3474 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): 3722, Positive cache size: 3722, Positive conditional cache size: 3722, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 421 PlacesBefore, 421 PlacesAfterwards, 1314 TransitionsBefore, 1314 TransitionsAfterwards, 3530 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 4095, Positive cache size: 4095, Positive conditional cache size: 4095, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 437 PlacesBefore, 437 PlacesAfterwards, 1390 TransitionsBefore, 1390 TransitionsAfterwards, 3670 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): 4095, Positive cache size: 4095, Positive conditional cache size: 4095, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 430 PlacesBefore, 430 PlacesAfterwards, 1388 TransitionsBefore, 1388 TransitionsAfterwards, 3672 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): 4095, Positive cache size: 4095, Positive conditional cache size: 4095, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 450 PlacesBefore, 450 PlacesAfterwards, 1452 TransitionsBefore, 1452 TransitionsAfterwards, 3804 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): 4095, Positive cache size: 4095, Positive conditional cache size: 4095, 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, 478 PlacesBefore, 478 PlacesAfterwards, 1545 TransitionsBefore, 1545 TransitionsAfterwards, 4030 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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): 4431, Positive cache size: 4431, Positive conditional cache size: 4431, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 519 PlacesBefore, 519 PlacesAfterwards, 1687 TransitionsBefore, 1687 TransitionsAfterwards, 4392 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 6, independent: 4, independent conditional: 4, 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): 4727, Positive cache size: 4727, Positive conditional cache size: 4727, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 514 PlacesBefore, 514 PlacesAfterwards, 1682 TransitionsBefore, 1682 TransitionsAfterwards, 4504 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): 4727, Positive cache size: 4727, Positive conditional cache size: 4727, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 534 PlacesBefore, 534 PlacesAfterwards, 1780 TransitionsBefore, 1780 TransitionsAfterwards, 4704 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): 4727, Positive cache size: 4727, Positive conditional cache size: 4727, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 560 PlacesBefore, 560 PlacesAfterwards, 1849 TransitionsBefore, 1849 TransitionsAfterwards, 4892 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): 4727, Positive cache size: 4727, Positive conditional cache size: 4727, 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, 596 PlacesBefore, 596 PlacesAfterwards, 1960 TransitionsBefore, 1960 TransitionsAfterwards, 5164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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): 4953, Positive cache size: 4953, Positive conditional cache size: 4953, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 608 PlacesBefore, 608 PlacesAfterwards, 2060 TransitionsBefore, 2060 TransitionsAfterwards, 5526 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 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: 10, independent: 5, independent conditional: 5, 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): 5214, Positive cache size: 5214, Positive conditional cache size: 5214, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 620 PlacesBefore, 620 PlacesAfterwards, 2108 TransitionsBefore, 2108 TransitionsAfterwards, 5606 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): 5214, Positive cache size: 5214, Positive conditional cache size: 5214, 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, 662 PlacesBefore, 662 PlacesAfterwards, 2248 TransitionsBefore, 2248 TransitionsAfterwards, 5908 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 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): 5454, Positive cache size: 5454, Positive conditional cache size: 5454, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 688 PlacesBefore, 688 PlacesAfterwards, 2343 TransitionsBefore, 2343 TransitionsAfterwards, 6160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 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): 5569, Positive cache size: 5569, Positive conditional cache size: 5569, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 724 PlacesBefore, 724 PlacesAfterwards, 2438 TransitionsBefore, 2438 TransitionsAfterwards, 6356 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 9, independent conditional: 9, 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): 6393, Positive cache size: 6393, Positive conditional cache size: 6393, 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: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown