/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 04:32:15,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 04:32:15,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 04:32:15,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 04:32:15,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 04:32:15,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 04:32:15,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 04:32:15,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 04:32:15,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 04:32:15,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 04:32:15,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 04:32:15,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 04:32:15,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 04:32:15,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 04:32:15,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 04:32:15,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 04:32:15,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 04:32:15,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 04:32:15,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 04:32:15,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 04:32:15,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 04:32:15,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 04:32:15,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 04:32:15,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 04:32:15,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 04:32:15,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 04:32:15,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 04:32:15,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 04:32:15,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 04:32:15,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 04:32:15,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 04:32:15,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 04:32:15,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 04:32:15,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 04:32:15,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 04:32:15,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 04:32:15,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 04:32:15,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 04:32:15,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 04:32:15,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 04:32:15,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 04:32:15,257 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 04:32:15,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 04:32:15,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 04:32:15,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 04:32:15,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 04:32:15,287 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 04:32:15,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 04:32:15,288 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 04:32:15,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 04:32:15,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 04:32:15,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 04:32:15,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 04:32:15,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 04:32:15,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 04:32:15,289 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 04:32:15,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 04:32:15,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 04:32:15,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 04:32:15,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 04:32:15,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 04:32:15,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 04:32:15,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 04:32:15,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:32:15,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 04:32:15,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 04:32:15,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 04:32:15,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 04:32:15,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 04:32:15,291 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 04:32:15,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 04:32:15,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 04:32:15,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 04:32:15,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 04:32:15,553 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 04:32:15,564 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 04:32:15,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2022-12-13 04:32:16,610 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 04:32:16,817 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 04:32:16,818 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2022-12-13 04:32:16,822 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236155900/28d09927ec3d4fe089b03505672ce29f/FLAG32783680e [2022-12-13 04:32:16,833 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236155900/28d09927ec3d4fe089b03505672ce29f [2022-12-13 04:32:16,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 04:32:16,835 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 04:32:16,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 04:32:16,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 04:32:16,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 04:32:16,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:32:16" (1/1) ... [2022-12-13 04:32:16,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3d4511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:16, skipping insertion in model container [2022-12-13 04:32:16,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:32:16" (1/1) ... [2022-12-13 04:32:16,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 04:32:16,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 04:32:16,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:16,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:16,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:16,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:16,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:16,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:16,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:16,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:16,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:16,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:16,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:16,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:16,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:16,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:16,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:16,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:16,988 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c[4085,4098] [2022-12-13 04:32:16,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:32:17,006 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 04:32:17,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:17,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:17,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:17,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:17,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:17,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:17,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:17,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:17,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:17,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:17,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:17,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:17,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:17,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:17,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 04:32:17,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 04:32:17,027 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c[4085,4098] [2022-12-13 04:32:17,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:32:17,039 INFO L208 MainTranslator]: Completed translation [2022-12-13 04:32:17,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17 WrapperNode [2022-12-13 04:32:17,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 04:32:17,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 04:32:17,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 04:32:17,040 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 04:32:17,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17" (1/1) ... [2022-12-13 04:32:17,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17" (1/1) ... [2022-12-13 04:32:17,070 INFO L138 Inliner]: procedures = 25, calls = 63, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 317 [2022-12-13 04:32:17,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 04:32:17,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 04:32:17,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 04:32:17,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 04:32:17,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17" (1/1) ... [2022-12-13 04:32:17,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17" (1/1) ... [2022-12-13 04:32:17,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17" (1/1) ... [2022-12-13 04:32:17,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17" (1/1) ... [2022-12-13 04:32:17,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17" (1/1) ... [2022-12-13 04:32:17,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17" (1/1) ... [2022-12-13 04:32:17,111 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17" (1/1) ... [2022-12-13 04:32:17,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17" (1/1) ... [2022-12-13 04:32:17,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 04:32:17,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 04:32:17,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 04:32:17,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 04:32:17,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17" (1/1) ... [2022-12-13 04:32:17,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:32:17,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:32:17,151 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 04:32:17,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 04:32:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 04:32:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 04:32:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 04:32:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 04:32:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 04:32:17,204 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 04:32:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 04:32:17,204 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 04:32:17,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 04:32:17,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 04:32:17,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 04:32:17,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 04:32:17,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 04:32:17,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 04:32:17,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 04:32:17,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 04:32:17,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 04:32:17,206 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 04:32:17,345 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 04:32:17,346 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 04:32:17,778 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 04:32:17,907 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 04:32:17,908 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 04:32:17,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:32:17 BoogieIcfgContainer [2022-12-13 04:32:17,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 04:32:17,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 04:32:17,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 04:32:17,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 04:32:17,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:32:16" (1/3) ... [2022-12-13 04:32:17,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294da34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:32:17, skipping insertion in model container [2022-12-13 04:32:17,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:32:17" (2/3) ... [2022-12-13 04:32:17,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294da34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:32:17, skipping insertion in model container [2022-12-13 04:32:17,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:32:17" (3/3) ... [2022-12-13 04:32:17,916 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring-nondet.wvr.c [2022-12-13 04:32:17,931 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 04:32:17,932 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 04:32:17,932 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 04:32:18,012 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 04:32:18,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 256 transitions, 536 flow [2022-12-13 04:32:18,169 INFO L130 PetriNetUnfolder]: 25/253 cut-off events. [2022-12-13 04:32:18,169 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:32:18,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 253 events. 25/253 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 206 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 215. Up to 4 conditions per place. [2022-12-13 04:32:18,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 256 transitions, 536 flow [2022-12-13 04:32:18,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 243 transitions, 504 flow [2022-12-13 04:32:18,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:18,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 243 transitions, 504 flow [2022-12-13 04:32:18,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 243 transitions, 504 flow [2022-12-13 04:32:18,242 INFO L130 PetriNetUnfolder]: 25/243 cut-off events. [2022-12-13 04:32:18,242 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:32:18,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 243 events. 25/243 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 215. Up to 4 conditions per place. [2022-12-13 04:32:18,250 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 243 transitions, 504 flow [2022-12-13 04:32:18,251 INFO L226 LiptonReduction]: Number of co-enabled transitions 2820 [2022-12-13 04:32:25,654 INFO L241 LiptonReduction]: Total number of compositions: 210 [2022-12-13 04:32:25,665 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 04:32:25,670 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;@3d1e275c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 04:32:25,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 04:32:25,680 INFO L130 PetriNetUnfolder]: 8/32 cut-off events. [2022-12-13 04:32:25,680 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 04:32:25,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:25,681 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:25,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:32:25,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1935456720, now seen corresponding path program 1 times [2022-12-13 04:32:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:25,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624733601] [2022-12-13 04:32:25,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:25,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:26,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:26,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624733601] [2022-12-13 04:32:26,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624733601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:32:26,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:32:26,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:32:26,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150563766] [2022-12-13 04:32:26,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:32:26,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:32:26,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:32:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:32:26,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-13 04:32:26,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:26,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:26,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-13 04:32:26,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:26,309 INFO L130 PetriNetUnfolder]: 472/693 cut-off events. [2022-12-13 04:32:26,309 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-13 04:32:26,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 693 events. 472/693 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2150 event pairs, 135 based on Foata normal form. 30/576 useless extension candidates. Maximal degree in co-relation 1219. Up to 449 conditions per place. [2022-12-13 04:32:26,319 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 40 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2022-12-13 04:32:26,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 198 flow [2022-12-13 04:32:26,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:32:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:32:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 04:32:26,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2022-12-13 04:32:26,332 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-13 04:32:26,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 44 transitions, 198 flow [2022-12-13 04:32:26,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 44 transitions, 198 flow [2022-12-13 04:32:26,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:26,340 INFO L89 Accepts]: Start accepts. Operand has 37 places, 44 transitions, 198 flow [2022-12-13 04:32:26,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:26,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:26,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 44 transitions, 198 flow [2022-12-13 04:32:26,348 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 44 transitions, 198 flow [2022-12-13 04:32:26,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 04:32:26,356 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:32:26,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 04:32:26,375 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 44 transitions, 198 flow [2022-12-13 04:32:26,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:26,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:26,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:26,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 04:32:26,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:32:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1141673692, now seen corresponding path program 1 times [2022-12-13 04:32:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:26,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610138116] [2022-12-13 04:32:26,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:26,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:26,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:26,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610138116] [2022-12-13 04:32:26,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610138116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:32:26,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:32:26,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:32:26,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382410972] [2022-12-13 04:32:26,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:32:26,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:32:26,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:26,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:32:26,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:32:26,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 04:32:26,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 44 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:26,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:26,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 04:32:26,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:26,688 INFO L130 PetriNetUnfolder]: 501/754 cut-off events. [2022-12-13 04:32:26,688 INFO L131 PetriNetUnfolder]: For 76/82 co-relation queries the response was YES. [2022-12-13 04:32:26,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 754 events. 501/754 cut-off events. For 76/82 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2361 event pairs, 162 based on Foata normal form. 26/630 useless extension candidates. Maximal degree in co-relation 1799. Up to 691 conditions per place. [2022-12-13 04:32:26,692 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 42 selfloop transitions, 2 changer transitions 14/59 dead transitions. [2022-12-13 04:32:26,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 383 flow [2022-12-13 04:32:26,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:32:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:32:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-13 04:32:26,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2022-12-13 04:32:26,694 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-13 04:32:26,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 59 transitions, 383 flow [2022-12-13 04:32:26,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 45 transitions, 290 flow [2022-12-13 04:32:26,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:26,699 INFO L89 Accepts]: Start accepts. Operand has 39 places, 45 transitions, 290 flow [2022-12-13 04:32:26,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:26,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:26,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 45 transitions, 290 flow [2022-12-13 04:32:26,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 45 transitions, 290 flow [2022-12-13 04:32:26,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 04:32:28,169 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:32:28,170 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1471 [2022-12-13 04:32:28,170 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 44 transitions, 284 flow [2022-12-13 04:32:28,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:28,171 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:28,171 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:28,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 04:32:28,171 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:32:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:28,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1023776594, now seen corresponding path program 1 times [2022-12-13 04:32:28,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:28,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261813945] [2022-12-13 04:32:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:28,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:28,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261813945] [2022-12-13 04:32:28,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261813945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:32:28,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:32:28,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:32:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576475669] [2022-12-13 04:32:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:32:28,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:32:28,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:28,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:32:28,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:32:28,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 04:32:28,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 44 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:28,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:28,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 04:32:28,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:28,433 INFO L130 PetriNetUnfolder]: 759/1172 cut-off events. [2022-12-13 04:32:28,433 INFO L131 PetriNetUnfolder]: For 114/118 co-relation queries the response was YES. [2022-12-13 04:32:28,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4834 conditions, 1172 events. 759/1172 cut-off events. For 114/118 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4422 event pairs, 381 based on Foata normal form. 56/1039 useless extension candidates. Maximal degree in co-relation 2378. Up to 1167 conditions per place. [2022-12-13 04:32:28,439 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 42 selfloop transitions, 2 changer transitions 35/80 dead transitions. [2022-12-13 04:32:28,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 80 transitions, 682 flow [2022-12-13 04:32:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:32:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:32:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-13 04:32:28,441 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-12-13 04:32:28,442 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2022-12-13 04:32:28,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 80 transitions, 682 flow [2022-12-13 04:32:28,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 45 transitions, 378 flow [2022-12-13 04:32:28,450 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:28,450 INFO L89 Accepts]: Start accepts. Operand has 40 places, 45 transitions, 378 flow [2022-12-13 04:32:28,452 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:28,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:28,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 45 transitions, 378 flow [2022-12-13 04:32:28,454 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 45 transitions, 378 flow [2022-12-13 04:32:28,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 04:32:28,712 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:32:28,713 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-13 04:32:28,713 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 44 transitions, 370 flow [2022-12-13 04:32:28,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:28,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:28,713 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:28,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 04:32:28,714 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:32:28,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash -187727500, now seen corresponding path program 1 times [2022-12-13 04:32:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:28,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438242559] [2022-12-13 04:32:28,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:28,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:28,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:28,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438242559] [2022-12-13 04:32:28,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438242559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:32:28,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:32:28,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:32:28,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141944994] [2022-12-13 04:32:28,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:32:28,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:32:28,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:28,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:32:28,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:32:28,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 04:32:28,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 44 transitions, 370 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:28,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:28,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 04:32:28,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:29,053 INFO L130 PetriNetUnfolder]: 835/1239 cut-off events. [2022-12-13 04:32:29,053 INFO L131 PetriNetUnfolder]: For 157/169 co-relation queries the response was YES. [2022-12-13 04:32:29,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6336 conditions, 1239 events. 835/1239 cut-off events. For 157/169 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4527 event pairs, 258 based on Foata normal form. 32/1029 useless extension candidates. Maximal degree in co-relation 2958. Up to 1236 conditions per place. [2022-12-13 04:32:29,061 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 42 selfloop transitions, 2 changer transitions 33/78 dead transitions. [2022-12-13 04:32:29,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 78 transitions, 817 flow [2022-12-13 04:32:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:32:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:32:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 04:32:29,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4596774193548387 [2022-12-13 04:32:29,063 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2022-12-13 04:32:29,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 78 transitions, 817 flow [2022-12-13 04:32:29,069 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 45 transitions, 466 flow [2022-12-13 04:32:29,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:29,077 INFO L89 Accepts]: Start accepts. Operand has 41 places, 45 transitions, 466 flow [2022-12-13 04:32:29,078 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:29,078 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:29,079 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 45 transitions, 466 flow [2022-12-13 04:32:29,080 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 45 transitions, 466 flow [2022-12-13 04:32:29,080 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 04:32:29,374 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:32:29,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 298 [2022-12-13 04:32:29,376 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 44 transitions, 456 flow [2022-12-13 04:32:29,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:29,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:29,376 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:29,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 04:32:29,376 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:32:29,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:29,377 INFO L85 PathProgramCache]: Analyzing trace with hash -412783452, now seen corresponding path program 1 times [2022-12-13 04:32:29,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:29,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185183203] [2022-12-13 04:32:29,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:29,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:29,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:29,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185183203] [2022-12-13 04:32:29,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185183203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:32:29,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:32:29,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 04:32:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734998689] [2022-12-13 04:32:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:32:29,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:32:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:29,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:32:29,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 04:32:29,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 04:32:29,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 44 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:29,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:29,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 04:32:29,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:29,720 INFO L130 PetriNetUnfolder]: 839/1249 cut-off events. [2022-12-13 04:32:29,721 INFO L131 PetriNetUnfolder]: For 374/398 co-relation queries the response was YES. [2022-12-13 04:32:29,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7526 conditions, 1249 events. 839/1249 cut-off events. For 374/398 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4706 event pairs, 145 based on Foata normal form. 1/981 useless extension candidates. Maximal degree in co-relation 6253. Up to 1227 conditions per place. [2022-12-13 04:32:29,734 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 63 selfloop transitions, 3 changer transitions 9/76 dead transitions. [2022-12-13 04:32:29,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 76 transitions, 947 flow [2022-12-13 04:32:29,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:32:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:32:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-13 04:32:29,738 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2022-12-13 04:32:29,740 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2022-12-13 04:32:29,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 76 transitions, 947 flow [2022-12-13 04:32:29,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 67 transitions, 827 flow [2022-12-13 04:32:29,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:29,753 INFO L89 Accepts]: Start accepts. Operand has 42 places, 67 transitions, 827 flow [2022-12-13 04:32:29,754 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:29,754 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:29,754 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 67 transitions, 827 flow [2022-12-13 04:32:29,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 67 transitions, 827 flow [2022-12-13 04:32:29,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 04:32:29,759 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:32:29,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 04:32:29,760 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 67 transitions, 827 flow [2022-12-13 04:32:29,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:29,761 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:29,761 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:29,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 04:32:29,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:32:29,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:29,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1653091245, now seen corresponding path program 1 times [2022-12-13 04:32:29,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:29,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740096821] [2022-12-13 04:32:29,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:29,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:30,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:30,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:30,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740096821] [2022-12-13 04:32:30,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740096821] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:32:30,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133982863] [2022-12-13 04:32:30,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:30,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:32:30,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:32:30,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:32:30,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 04:32:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:30,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 04:32:30,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:32:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:30,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:32:30,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133982863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:32:30,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 04:32:30,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-12-13 04:32:30,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103739158] [2022-12-13 04:32:30,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:32:30,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 04:32:30,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:30,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 04:32:30,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:32:30,350 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 04:32:30,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 67 transitions, 827 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:30,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:30,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 04:32:30,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:30,492 INFO L130 PetriNetUnfolder]: 552/826 cut-off events. [2022-12-13 04:32:30,492 INFO L131 PetriNetUnfolder]: For 717/717 co-relation queries the response was YES. [2022-12-13 04:32:30,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5603 conditions, 826 events. 552/826 cut-off events. For 717/717 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2650 event pairs, 125 based on Foata normal form. 24/705 useless extension candidates. Maximal degree in co-relation 4802. Up to 769 conditions per place. [2022-12-13 04:32:30,496 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 51 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2022-12-13 04:32:30,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 752 flow [2022-12-13 04:32:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 04:32:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 04:32:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-13 04:32:30,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2022-12-13 04:32:30,498 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2022-12-13 04:32:30,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 53 transitions, 752 flow [2022-12-13 04:32:30,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 53 transitions, 752 flow [2022-12-13 04:32:30,504 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:30,504 INFO L89 Accepts]: Start accepts. Operand has 44 places, 53 transitions, 752 flow [2022-12-13 04:32:30,505 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:30,505 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:30,505 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 53 transitions, 752 flow [2022-12-13 04:32:30,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 53 transitions, 752 flow [2022-12-13 04:32:30,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:32:30,506 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:32:30,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 04:32:30,506 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 53 transitions, 752 flow [2022-12-13 04:32:30,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:30,507 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:30,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:30,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 04:32:30,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 04:32:30,713 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:32:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2012905785, now seen corresponding path program 2 times [2022-12-13 04:32:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:30,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319621031] [2022-12-13 04:32:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:31,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:31,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319621031] [2022-12-13 04:32:31,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319621031] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:32:31,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766874860] [2022-12-13 04:32:31,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 04:32:31,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:32:31,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:32:31,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:32:31,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 04:32:31,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:32:31,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:32:31,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 04:32:31,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:32:31,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-12-13 04:32:31,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-13 04:32:31,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:32:31,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-12-13 04:32:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:31,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766874860] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:32:31,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:32:31,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2022-12-13 04:32:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912770663] [2022-12-13 04:32:31,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:32:31,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 04:32:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:31,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 04:32:31,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-13 04:32:31,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 04:32:31,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 53 transitions, 752 flow. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:31,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:31,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 04:32:31,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:32,460 INFO L130 PetriNetUnfolder]: 1503/2219 cut-off events. [2022-12-13 04:32:32,461 INFO L131 PetriNetUnfolder]: For 2839/2839 co-relation queries the response was YES. [2022-12-13 04:32:32,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17327 conditions, 2219 events. 1503/2219 cut-off events. For 2839/2839 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8517 event pairs, 108 based on Foata normal form. 2/1779 useless extension candidates. Maximal degree in co-relation 8740. Up to 2086 conditions per place. [2022-12-13 04:32:32,481 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 169 selfloop transitions, 25 changer transitions 40/234 dead transitions. [2022-12-13 04:32:32,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 234 transitions, 3807 flow [2022-12-13 04:32:32,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 04:32:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 04:32:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 183 transitions. [2022-12-13 04:32:32,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34724857685009486 [2022-12-13 04:32:32,483 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2022-12-13 04:32:32,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 234 transitions, 3807 flow [2022-12-13 04:32:32,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 194 transitions, 3137 flow [2022-12-13 04:32:32,510 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:32,511 INFO L89 Accepts]: Start accepts. Operand has 58 places, 194 transitions, 3137 flow [2022-12-13 04:32:32,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:32,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:32,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 194 transitions, 3137 flow [2022-12-13 04:32:32,516 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 194 transitions, 3137 flow [2022-12-13 04:32:32,516 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:32:36,343 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:32:36,344 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3834 [2022-12-13 04:32:36,344 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 193 transitions, 3121 flow [2022-12-13 04:32:36,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:36,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:36,344 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:36,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 04:32:36,545 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,SelfDestructingSolverStorable6 [2022-12-13 04:32:36,545 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:32:36,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash -286079439, now seen corresponding path program 1 times [2022-12-13 04:32:36,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:36,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571222347] [2022-12-13 04:32:36,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:36,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:37,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:37,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571222347] [2022-12-13 04:32:37,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571222347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:32:37,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979887890] [2022-12-13 04:32:37,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:37,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:32:37,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:32:37,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:32:37,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 04:32:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:37,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 04:32:37,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:32:37,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-12-13 04:32:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:37,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:32:37,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-12-13 04:32:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:38,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979887890] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:32:38,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:32:38,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-12-13 04:32:38,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703225310] [2022-12-13 04:32:38,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:32:38,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 04:32:38,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:38,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 04:32:38,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-12-13 04:32:38,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:32:38,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 193 transitions, 3121 flow. Second operand has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:38,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:38,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:32:38,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:41,120 INFO L130 PetriNetUnfolder]: 8106/11619 cut-off events. [2022-12-13 04:32:41,121 INFO L131 PetriNetUnfolder]: For 17204/17204 co-relation queries the response was YES. [2022-12-13 04:32:41,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100949 conditions, 11619 events. 8106/11619 cut-off events. For 17204/17204 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 58267 event pairs, 294 based on Foata normal form. 234/9156 useless extension candidates. Maximal degree in co-relation 32274. Up to 11233 conditions per place. [2022-12-13 04:32:41,204 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 865 selfloop transitions, 218 changer transitions 162/1245 dead transitions. [2022-12-13 04:32:41,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 1245 transitions, 22449 flow [2022-12-13 04:32:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-13 04:32:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-12-13 04:32:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 578 transitions. [2022-12-13 04:32:41,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36862244897959184 [2022-12-13 04:32:41,207 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2022-12-13 04:32:41,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 1245 transitions, 22449 flow [2022-12-13 04:32:41,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 1083 transitions, 19386 flow [2022-12-13 04:32:41,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:41,428 INFO L89 Accepts]: Start accepts. Operand has 102 places, 1083 transitions, 19386 flow [2022-12-13 04:32:41,435 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:41,435 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:41,435 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 1083 transitions, 19386 flow [2022-12-13 04:32:41,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 1083 transitions, 19386 flow [2022-12-13 04:32:41,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:32:44,990 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:32:44,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3571 [2022-12-13 04:32:44,999 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 1082 transitions, 19368 flow [2022-12-13 04:32:44,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:44,999 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:45,000 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:45,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 04:32:45,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:32:45,207 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:32:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash -178655097, now seen corresponding path program 1 times [2022-12-13 04:32:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:45,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224444900] [2022-12-13 04:32:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:45,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 04:32:45,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:45,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224444900] [2022-12-13 04:32:45,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224444900] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:32:45,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67420807] [2022-12-13 04:32:45,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:45,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:32:45,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:32:45,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:32:45,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 04:32:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:45,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 04:32:45,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:32:46,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:32:46,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 272 treesize of output 434 [2022-12-13 04:32:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:47,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:32:47,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:32:47,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 9 [2022-12-13 04:32:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:47,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67420807] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:32:47,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:32:47,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2022-12-13 04:32:47,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46600018] [2022-12-13 04:32:47,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:32:47,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 04:32:47,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:32:47,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 04:32:47,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-12-13 04:32:47,726 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 04:32:47,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 1082 transitions, 19368 flow. Second operand has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:47,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:32:47,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 04:32:47,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:32:57,886 INFO L130 PetriNetUnfolder]: 24876/35170 cut-off events. [2022-12-13 04:32:57,886 INFO L131 PetriNetUnfolder]: For 57865/57865 co-relation queries the response was YES. [2022-12-13 04:32:57,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340727 conditions, 35170 events. 24876/35170 cut-off events. For 57865/57865 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 206227 event pairs, 287 based on Foata normal form. 10/27603 useless extension candidates. Maximal degree in co-relation 116971. Up to 34575 conditions per place. [2022-12-13 04:32:58,014 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 1487 selfloop transitions, 470 changer transitions 3195/5152 dead transitions. [2022-12-13 04:32:58,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 5152 transitions, 102688 flow [2022-12-13 04:32:58,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 04:32:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-13 04:32:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 329 transitions. [2022-12-13 04:32:58,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3115530303030303 [2022-12-13 04:32:58,016 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 97 predicate places. [2022-12-13 04:32:58,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 5152 transitions, 102688 flow [2022-12-13 04:32:58,115 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 1957 transitions, 38977 flow [2022-12-13 04:32:58,320 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:32:58,321 INFO L89 Accepts]: Start accepts. Operand has 115 places, 1957 transitions, 38977 flow [2022-12-13 04:32:58,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:32:58,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:32:58,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 1957 transitions, 38977 flow [2022-12-13 04:32:58,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 1957 transitions, 38977 flow [2022-12-13 04:32:58,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:32:58,489 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:32:58,490 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 04:32:58,490 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 1957 transitions, 38977 flow [2022-12-13 04:32:58,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:32:58,490 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:32:58,490 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:32:58,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 04:32:58,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:32:58,699 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:32:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:32:58,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1571321623, now seen corresponding path program 2 times [2022-12-13 04:32:58,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:32:58,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14583622] [2022-12-13 04:32:58,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:32:58,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:32:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:32:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:59,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:32:59,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14583622] [2022-12-13 04:32:59,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14583622] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:32:59,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496002004] [2022-12-13 04:32:59,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 04:32:59,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:32:59,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:32:59,185 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:32:59,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 04:32:59,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 04:32:59,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:32:59,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 04:32:59,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:32:59,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-12-13 04:32:59,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-12-13 04:32:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:32:59,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:32:59,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-12-13 04:33:00,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-12-13 04:33:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:33:00,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496002004] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:33:00,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:33:00,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2022-12-13 04:33:00,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728189537] [2022-12-13 04:33:00,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:33:00,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 04:33:00,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:33:00,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 04:33:00,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-12-13 04:33:00,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 04:33:00,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 1957 transitions, 38977 flow. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:00,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:33:00,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 04:33:00,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:33:06,155 INFO L130 PetriNetUnfolder]: 10224/16117 cut-off events. [2022-12-13 04:33:06,155 INFO L131 PetriNetUnfolder]: For 21108/21108 co-relation queries the response was YES. [2022-12-13 04:33:06,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172031 conditions, 16117 events. 10224/16117 cut-off events. For 21108/21108 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 105833 event pairs, 169 based on Foata normal form. 264/12824 useless extension candidates. Maximal degree in co-relation 69286. Up to 15999 conditions per place. [2022-12-13 04:33:06,227 INFO L137 encePairwiseOnDemand]: 23/33 looper letters, 1649 selfloop transitions, 481 changer transitions 187/2317 dead transitions. [2022-12-13 04:33:06,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 2317 transitions, 50709 flow [2022-12-13 04:33:06,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 04:33:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 04:33:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 215 transitions. [2022-12-13 04:33:06,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29614325068870523 [2022-12-13 04:33:06,229 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 100 predicate places. [2022-12-13 04:33:06,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 2317 transitions, 50709 flow [2022-12-13 04:33:06,303 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 2130 transitions, 46665 flow [2022-12-13 04:33:06,383 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:33:06,383 INFO L89 Accepts]: Start accepts. Operand has 131 places, 2130 transitions, 46665 flow [2022-12-13 04:33:06,398 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:33:06,398 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:33:06,399 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 2130 transitions, 46665 flow [2022-12-13 04:33:06,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 2130 transitions, 46665 flow [2022-12-13 04:33:06,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:33:06,444 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:33:06,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 04:33:06,445 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 2130 transitions, 46665 flow [2022-12-13 04:33:06,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:06,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:33:06,446 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:33:06,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 04:33:06,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 04:33:06,652 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:33:06,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:33:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash -51326082, now seen corresponding path program 1 times [2022-12-13 04:33:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:33:06,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941584606] [2022-12-13 04:33:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:33:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:33:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:33:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 04:33:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:33:07,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941584606] [2022-12-13 04:33:07,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941584606] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:33:07,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210809834] [2022-12-13 04:33:07,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:33:07,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:33:07,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:33:07,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:33:07,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 04:33:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:33:07,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 04:33:07,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:33:07,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 146 [2022-12-13 04:33:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 04:33:07,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:33:07,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210809834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:33:07,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 04:33:07,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-12-13 04:33:07,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429272157] [2022-12-13 04:33:07,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:33:07,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:33:07,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:33:07,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:33:07,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 04:33:07,341 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 04:33:07,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 2130 transitions, 46665 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:07,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:33:07,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 04:33:07,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:33:11,855 INFO L130 PetriNetUnfolder]: 7586/12172 cut-off events. [2022-12-13 04:33:11,855 INFO L131 PetriNetUnfolder]: For 16783/16783 co-relation queries the response was YES. [2022-12-13 04:33:11,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142481 conditions, 12172 events. 7586/12172 cut-off events. For 16783/16783 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 77979 event pairs, 135 based on Foata normal form. 150/9689 useless extension candidates. Maximal degree in co-relation 61102. Up to 12054 conditions per place. [2022-12-13 04:33:11,914 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 1486 selfloop transitions, 0 changer transitions 397/1883 dead transitions. [2022-12-13 04:33:11,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 1883 transitions, 45022 flow [2022-12-13 04:33:11,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:33:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:33:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-13 04:33:11,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2022-12-13 04:33:11,916 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 100 predicate places. [2022-12-13 04:33:11,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 1883 transitions, 45022 flow [2022-12-13 04:33:11,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 1486 transitions, 35518 flow [2022-12-13 04:33:12,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:33:12,045 INFO L89 Accepts]: Start accepts. Operand has 124 places, 1486 transitions, 35518 flow [2022-12-13 04:33:12,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:33:12,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:33:12,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 1486 transitions, 35518 flow [2022-12-13 04:33:12,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 1486 transitions, 35518 flow [2022-12-13 04:33:12,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:33:12,083 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:33:12,084 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 04:33:12,084 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 1486 transitions, 35518 flow [2022-12-13 04:33:12,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:12,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:33:12,084 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:33:12,090 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-13 04:33:12,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:33:12,290 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:33:12,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:33:12,290 INFO L85 PathProgramCache]: Analyzing trace with hash 515692446, now seen corresponding path program 1 times [2022-12-13 04:33:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:33:12,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612507384] [2022-12-13 04:33:12,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:33:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:33:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:33:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 04:33:12,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:33:12,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612507384] [2022-12-13 04:33:12,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612507384] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:33:12,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607097838] [2022-12-13 04:33:12,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:33:12,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:33:12,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:33:12,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:33:12,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 04:33:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:33:13,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 04:33:13,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:33:13,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-12-13 04:33:13,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:33:13,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 191 [2022-12-13 04:33:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:33:13,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:33:14,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-12-13 04:33:14,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-12-13 04:33:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:33:14,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607097838] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:33:14,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:33:14,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-12-13 04:33:14,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871662576] [2022-12-13 04:33:14,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:33:14,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 04:33:14,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:33:14,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 04:33:14,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2022-12-13 04:33:14,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 04:33:14,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 1486 transitions, 35518 flow. Second operand has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:14,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:33:14,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 04:33:14,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:33:30,445 INFO L130 PetriNetUnfolder]: 20471/31934 cut-off events. [2022-12-13 04:33:30,445 INFO L131 PetriNetUnfolder]: For 45064/45064 co-relation queries the response was YES. [2022-12-13 04:33:30,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404524 conditions, 31934 events. 20471/31934 cut-off events. For 45064/45064 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 219149 event pairs, 210 based on Foata normal form. 274/24892 useless extension candidates. Maximal degree in co-relation 119285. Up to 31935 conditions per place. [2022-12-13 04:33:30,570 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 1592 selfloop transitions, 345 changer transitions 2587/4524 dead transitions. [2022-12-13 04:33:30,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 4524 transitions, 116682 flow [2022-12-13 04:33:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-12-13 04:33:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2022-12-13 04:33:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 828 transitions. [2022-12-13 04:33:30,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2512135922330097 [2022-12-13 04:33:30,574 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 191 predicate places. [2022-12-13 04:33:30,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 4524 transitions, 116682 flow [2022-12-13 04:33:30,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 1937 transitions, 50034 flow [2022-12-13 04:33:30,869 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:33:30,869 INFO L89 Accepts]: Start accepts. Operand has 115 places, 1937 transitions, 50034 flow [2022-12-13 04:33:30,886 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:33:30,886 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:33:30,886 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 1937 transitions, 50034 flow [2022-12-13 04:33:30,938 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 1937 transitions, 50034 flow [2022-12-13 04:33:30,938 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:33:30,948 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:33:30,949 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-13 04:33:30,949 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 1937 transitions, 50034 flow [2022-12-13 04:33:30,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:30,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:33:30,949 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:33:30,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 04:33:31,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:33:31,155 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:33:31,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:33:31,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1007180063, now seen corresponding path program 3 times [2022-12-13 04:33:31,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:33:31,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89792294] [2022-12-13 04:33:31,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:33:31,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:33:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:33:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 04:33:31,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:33:31,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89792294] [2022-12-13 04:33:31,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89792294] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:33:31,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118307145] [2022-12-13 04:33:31,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 04:33:31,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:33:31,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:33:31,792 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:33:31,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 04:33:32,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 04:33:32,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 04:33:32,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 04:33:32,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:33:32,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:33:32,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 203 treesize of output 232 [2022-12-13 04:33:32,716 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 04:33:32,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:33:33,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:33:33,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 222 [2022-12-13 04:33:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 04:33:33,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118307145] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:33:33,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:33:33,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 26 [2022-12-13 04:33:33,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611270601] [2022-12-13 04:33:33,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:33:33,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 04:33:33,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:33:33,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 04:33:33,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-12-13 04:33:33,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 04:33:33,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 1937 transitions, 50034 flow. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:33,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:33:33,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 04:33:33,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:33:48,905 INFO L130 PetriNetUnfolder]: 22339/35347 cut-off events. [2022-12-13 04:33:48,905 INFO L131 PetriNetUnfolder]: For 49570/49570 co-relation queries the response was YES. [2022-12-13 04:33:48,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484067 conditions, 35347 events. 22339/35347 cut-off events. For 49570/49570 co-relation queries the response was YES. Maximal size of possible extension queue 1647. Compared 261169 event pairs, 370 based on Foata normal form. 0/27917 useless extension candidates. Maximal degree in co-relation 149788. Up to 35348 conditions per place. [2022-12-13 04:33:49,055 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 1843 selfloop transitions, 383 changer transitions 4471/6697 dead transitions. [2022-12-13 04:33:49,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 6697 transitions, 186272 flow [2022-12-13 04:33:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 04:33:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-13 04:33:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 301 transitions. [2022-12-13 04:33:49,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25551782682512736 [2022-12-13 04:33:49,062 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 117 predicate places. [2022-12-13 04:33:49,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 6697 transitions, 186272 flow [2022-12-13 04:33:49,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 2226 transitions, 61874 flow [2022-12-13 04:33:49,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:33:49,419 INFO L89 Accepts]: Start accepts. Operand has 127 places, 2226 transitions, 61874 flow [2022-12-13 04:33:49,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:33:49,440 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:33:49,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 2226 transitions, 61874 flow [2022-12-13 04:33:49,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 2226 transitions, 61874 flow [2022-12-13 04:33:49,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:33:51,542 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:33:51,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2126 [2022-12-13 04:33:51,546 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 2225 transitions, 61846 flow [2022-12-13 04:33:51,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:51,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:33:51,546 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:33:51,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 04:33:51,760 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,SelfDestructingSolverStorable12 [2022-12-13 04:33:51,762 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:33:51,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:33:51,762 INFO L85 PathProgramCache]: Analyzing trace with hash -551166257, now seen corresponding path program 1 times [2022-12-13 04:33:51,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:33:51,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074048828] [2022-12-13 04:33:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:33:51,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:33:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:33:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 04:33:52,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:33:52,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074048828] [2022-12-13 04:33:52,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074048828] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:33:52,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377655425] [2022-12-13 04:33:52,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:33:52,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:33:52,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:33:52,413 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:33:52,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 04:33:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:33:52,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 04:33:52,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:33:52,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:33:52,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 04:33:52,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:33:52,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 04:33:52,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-13 04:33:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 04:33:52,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:33:53,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:33:53,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 146 [2022-12-13 04:33:53,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2022-12-13 04:33:53,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 94 [2022-12-13 04:33:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 04:33:53,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377655425] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:33:53,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:33:53,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2022-12-13 04:33:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151897588] [2022-12-13 04:33:53,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:33:53,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 04:33:53,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:33:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 04:33:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=470, Unknown=1, NotChecked=0, Total=600 [2022-12-13 04:33:53,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 04:33:53,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 2225 transitions, 61846 flow. Second operand has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:33:53,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:33:53,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 04:33:53,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:34:03,647 INFO L130 PetriNetUnfolder]: 13716/21415 cut-off events. [2022-12-13 04:34:03,647 INFO L131 PetriNetUnfolder]: For 40896/40896 co-relation queries the response was YES. [2022-12-13 04:34:03,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314185 conditions, 21415 events. 13716/21415 cut-off events. For 40896/40896 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 141968 event pairs, 211 based on Foata normal form. 0/17860 useless extension candidates. Maximal degree in co-relation 155375. Up to 21416 conditions per place. [2022-12-13 04:34:03,793 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 3971 selfloop transitions, 966 changer transitions 160/5097 dead transitions. [2022-12-13 04:34:03,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 5097 transitions, 151170 flow [2022-12-13 04:34:03,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 04:34:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 04:34:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 238 transitions. [2022-12-13 04:34:03,801 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29528535980148884 [2022-12-13 04:34:03,801 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 116 predicate places. [2022-12-13 04:34:03,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 5097 transitions, 151170 flow [2022-12-13 04:34:04,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 4937 transitions, 146440 flow [2022-12-13 04:34:04,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:34:04,152 INFO L89 Accepts]: Start accepts. Operand has 151 places, 4937 transitions, 146440 flow [2022-12-13 04:34:04,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:34:04,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:34:04,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 4937 transitions, 146440 flow [2022-12-13 04:34:04,324 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 4937 transitions, 146440 flow [2022-12-13 04:34:04,324 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:34:04,334 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:34:04,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 04:34:04,335 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 4937 transitions, 146440 flow [2022-12-13 04:34:04,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.72) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:04,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:34:04,336 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:34:04,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 04:34:04,541 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,SelfDestructingSolverStorable13 [2022-12-13 04:34:04,541 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:34:04,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:34:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2031009997, now seen corresponding path program 1 times [2022-12-13 04:34:04,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:34:04,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838278359] [2022-12-13 04:34:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:34:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:34:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:34:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 04:34:04,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:34:04,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838278359] [2022-12-13 04:34:04,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838278359] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:34:04,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116063190] [2022-12-13 04:34:04,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:34:04,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:34:04,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:34:04,636 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:34:04,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 04:34:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:34:04,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 04:34:04,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:34:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 04:34:04,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:34:04,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116063190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:34:04,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 04:34:04,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-13 04:34:04,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969800117] [2022-12-13 04:34:04,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:34:04,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:34:04,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:34:04,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:34:04,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:34:04,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 04:34:04,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 4937 transitions, 146440 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:04,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:34:04,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 04:34:04,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:34:34,342 INFO L130 PetriNetUnfolder]: 17694/28129 cut-off events. [2022-12-13 04:34:34,343 INFO L131 PetriNetUnfolder]: For 82017/82017 co-relation queries the response was YES. [2022-12-13 04:34:34,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439497 conditions, 28129 events. 17694/28129 cut-off events. For 82017/82017 co-relation queries the response was YES. Maximal size of possible extension queue 1094. Compared 199278 event pairs, 374 based on Foata normal form. 1650/25290 useless extension candidates. Maximal degree in co-relation 144704. Up to 28130 conditions per place. [2022-12-13 04:34:34,526 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 4692 selfloop transitions, 2 changer transitions 3173/8109 dead transitions. [2022-12-13 04:34:34,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 8109 transitions, 258018 flow [2022-12-13 04:34:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 04:34:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 04:34:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-12-13 04:34:34,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4470046082949309 [2022-12-13 04:34:34,528 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 122 predicate places. [2022-12-13 04:34:34,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 8109 transitions, 258018 flow [2022-12-13 04:34:34,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 4936 transitions, 155798 flow [2022-12-13 04:34:34,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:34:34,946 INFO L89 Accepts]: Start accepts. Operand has 153 places, 4936 transitions, 155798 flow [2022-12-13 04:34:35,013 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:34:35,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:34:35,013 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 4936 transitions, 155798 flow [2022-12-13 04:34:35,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 4936 transitions, 155798 flow [2022-12-13 04:34:35,203 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:34:35,535 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:34:35,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 590 [2022-12-13 04:34:35,536 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 4935 transitions, 155766 flow [2022-12-13 04:34:35,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:35,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:34:35,536 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:34:35,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 04:34:35,744 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,SelfDestructingSolverStorable14 [2022-12-13 04:34:35,745 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:34:35,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:34:35,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2065075966, now seen corresponding path program 1 times [2022-12-13 04:34:35,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:34:35,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873793882] [2022-12-13 04:34:35,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:34:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:34:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:34:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:34:39,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:34:39,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873793882] [2022-12-13 04:34:39,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873793882] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:34:39,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795763520] [2022-12-13 04:34:39,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:34:39,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:34:39,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:34:39,745 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:34:39,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 04:34:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:34:39,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 04:34:39,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:34:41,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:34:41,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 294 treesize of output 456 [2022-12-13 04:34:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:34:56,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:34:57,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:34:57,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 222 [2022-12-13 04:34:57,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-12-13 04:34:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:34:58,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795763520] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:34:58,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:34:58,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 16] total 56 [2022-12-13 04:34:58,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275749172] [2022-12-13 04:34:58,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:34:58,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-13 04:34:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:34:58,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-13 04:34:58,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=2665, Unknown=0, NotChecked=0, Total=3080 [2022-12-13 04:34:58,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 04:34:58,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 4935 transitions, 155766 flow. Second operand has 56 states, 56 states have (on average 1.875) internal successors, (105), 56 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:34:58,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:34:58,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 04:34:58,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:40:06,784 INFO L130 PetriNetUnfolder]: 102779/154784 cut-off events. [2022-12-13 04:40:06,784 INFO L131 PetriNetUnfolder]: For 407317/407317 co-relation queries the response was YES. [2022-12-13 04:40:07,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2568698 conditions, 154784 events. 102779/154784 cut-off events. For 407317/407317 co-relation queries the response was YES. Maximal size of possible extension queue 4934. Compared 1245560 event pairs, 979 based on Foata normal form. 14/125288 useless extension candidates. Maximal degree in co-relation 918666. Up to 154785 conditions per place. [2022-12-13 04:40:07,830 INFO L137 encePairwiseOnDemand]: 11/31 looper letters, 14699 selfloop transitions, 6800 changer transitions 21888/43387 dead transitions. [2022-12-13 04:40:07,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 687 places, 43387 transitions, 1452340 flow [2022-12-13 04:40:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 536 states. [2022-12-13 04:40:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2022-12-13 04:40:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 3761 transitions. [2022-12-13 04:40:07,843 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2263480982185845 [2022-12-13 04:40:07,843 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 652 predicate places. [2022-12-13 04:40:07,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 687 places, 43387 transitions, 1452340 flow [2022-12-13 04:40:09,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 422 places, 21499 transitions, 722029 flow [2022-12-13 04:40:10,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:40:10,818 INFO L89 Accepts]: Start accepts. Operand has 422 places, 21499 transitions, 722029 flow [2022-12-13 04:40:11,085 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:40:11,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:40:11,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 422 places, 21499 transitions, 722029 flow [2022-12-13 04:40:14,839 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 422 places, 21499 transitions, 722029 flow [2022-12-13 04:40:14,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 04:40:14,888 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [908] L87-->L82-2: Formula: (and (< v_~q2_back~0_59 v_~n2~0_28) (not (<= |v_thread2Thread1of1ForFork2_~j~0#1_25| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite |v_thread2_#t~short12#1_66| 1 0)) (<= 0 v_~q2_back~0_59) (= (+ |v_thread2Thread1of1ForFork2_~s~0#1_22| |v_thread2Thread1of1ForFork2_~j~0#1_25|) |v_thread2Thread1of1ForFork2_~s~0#1_21|) (= (+ v_~q2_back~0_59 1) v_~q2_back~0_58) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) |v_thread2_#t~short12#1_65| (= (+ (select (select |v_#memory_int_107| v_~q2~0.base_39) (+ v_~q2~0.offset_39 (* v_~q2_back~0_59 4))) 1) |v_thread2Thread1of1ForFork2_~j~0#1_25|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17| 0))) InVars {~n2~0=v_~n2~0_28, ~q2~0.offset=v_~q2~0.offset_39, #memory_int=|v_#memory_int_107|, ~q2~0.base=v_~q2~0.base_39, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_25|, thread2Thread1of1ForFork2_~s~0#1=|v_thread2Thread1of1ForFork2_~s~0#1_22|, ~q2_back~0=v_~q2_back~0_59} OutVars{thread2Thread1of1ForFork2_#t~short12#1=|v_thread2Thread1of1ForFork2_#t~short12#1_13|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, ~n2~0=v_~n2~0_28, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_17|, ~q2~0.offset=v_~q2~0.offset_39, thread2Thread1of1ForFork2_#t~post13#1=|v_thread2Thread1of1ForFork2_#t~post13#1_13|, #memory_int=|v_#memory_int_107|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, ~q2~0.base=v_~q2~0.base_39, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_25|, thread2Thread1of1ForFork2_~s~0#1=|v_thread2Thread1of1ForFork2_~s~0#1_21|, ~q2_back~0=v_~q2_back~0_58} AuxVars[|v_thread2_#t~short12#1_66|, |v_thread2_#t~short12#1_65|] AssignedVars[thread2Thread1of1ForFork2_#t~short12#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, thread2Thread1of1ForFork2_#t~post13#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~s~0#1, ~q2_back~0] and [977] L62-1-->L56: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|) (= (ite (and (<= 0 v_~q1_back~0_68) (< v_~q1_back~0_68 v_~n1~0_23)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread1Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (< v_~q3_front~0_63 v_~q3_back~0_62) 1 0) 0) 0 1)) (< |v_thread1Thread1of1ForFork1_~i~0#1_23| v_~N~0_16) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0))) InVars {~q3_front~0=v_~q3_front~0_63, ~q3_back~0=v_~q3_back~0_62, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_23|, ~N~0=v_~N~0_16} OutVars{~q3_front~0=v_~q3_front~0_63, ~q3_back~0=v_~q3_back~0_62, ~q1_back~0=v_~q1_back~0_68, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~n1~0=v_~n1~0_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_23|, ~N~0=v_~N~0_16, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_23|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 04:40:17,222 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [896] L82-2-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q1_front~0_41 v_~q1_back~0_58) (< v_~q1_front~0_41 v_~n1~0_17) (<= 0 v_~q1_front~0_41)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select (select |v_#memory_int_93| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_front~0_41))) |v_thread2Thread1of1ForFork2_~j~0#1_19|) (= (+ v_~q1_front~0_41 1) v_~q1_front~0_40) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_front~0=v_~q1_front~0_41, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_5|, ~q1~0.offset=v_~q1~0.offset_24, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, ~q1_front~0=v_~q1_front~0_40, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_front~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~0#1] and [977] L62-1-->L56: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|) (= (ite (and (<= 0 v_~q1_back~0_68) (< v_~q1_back~0_68 v_~n1~0_23)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread1Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (< v_~q3_front~0_63 v_~q3_back~0_62) 1 0) 0) 0 1)) (< |v_thread1Thread1of1ForFork1_~i~0#1_23| v_~N~0_16) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0))) InVars {~q3_front~0=v_~q3_front~0_63, ~q3_back~0=v_~q3_back~0_62, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_23|, ~N~0=v_~N~0_16} OutVars{~q3_front~0=v_~q3_front~0_63, ~q3_back~0=v_~q3_back~0_62, ~q1_back~0=v_~q1_back~0_68, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~n1~0=v_~n1~0_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_23|, ~N~0=v_~N~0_16, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_23|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 04:40:17,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [896] L82-2-->L87: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (and (< v_~q1_front~0_41 v_~q1_back~0_58) (< v_~q1_front~0_41 v_~n1~0_17) (<= 0 v_~q1_front~0_41)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select (select |v_#memory_int_93| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_front~0_41))) |v_thread2Thread1of1ForFork2_~j~0#1_19|) (= (+ v_~q1_front~0_41 1) v_~q1_front~0_40) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|)) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_front~0=v_~q1_front~0_41, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_5|, ~q1~0.offset=v_~q1~0.offset_24, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, ~q1_front~0=v_~q1_front~0_40, ~q1_back~0=v_~q1_back~0_58, ~n1~0=v_~n1~0_17, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_93|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, thread2Thread1of1ForFork2_~j~0#1=|v_thread2Thread1of1ForFork2_~j~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~q1_front~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~0#1] and [977] L62-1-->L56: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|) (= (ite (and (<= 0 v_~q1_back~0_68) (< v_~q1_back~0_68 v_~n1~0_23)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|) (= |v_thread1Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (< v_~q3_front~0_63 v_~q3_back~0_62) 1 0) 0) 0 1)) (< |v_thread1Thread1of1ForFork1_~i~0#1_23| v_~N~0_16) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0))) InVars {~q3_front~0=v_~q3_front~0_63, ~q3_back~0=v_~q3_back~0_62, ~q1_back~0=v_~q1_back~0_68, ~n1~0=v_~n1~0_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_23|, ~N~0=v_~N~0_16} OutVars{~q3_front~0=v_~q3_front~0_63, ~q3_back~0=v_~q3_back~0_62, ~q1_back~0=v_~q1_back~0_68, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, ~n1~0=v_~n1~0_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_23|, ~N~0=v_~N~0_16, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_23|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 04:40:40,566 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 04:40:40,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29750 [2022-12-13 04:40:40,567 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 21493 transitions, 721831 flow [2022-12-13 04:40:40,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.875) internal successors, (105), 56 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:40:40,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:40:40,567 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:40:40,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 04:40:40,772 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,SelfDestructingSolverStorable15 [2022-12-13 04:40:40,773 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 04:40:40,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:40:40,773 INFO L85 PathProgramCache]: Analyzing trace with hash -712962251, now seen corresponding path program 1 times [2022-12-13 04:40:40,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:40:40,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854624971] [2022-12-13 04:40:40,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:40:40,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:40:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:40:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 04:40:41,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:40:41,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854624971] [2022-12-13 04:40:41,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854624971] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 04:40:41,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862355124] [2022-12-13 04:40:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:40:41,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:40:41,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:40:41,885 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:40:41,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 04:40:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:40:42,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 04:40:42,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:40:42,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-12-13 04:40:42,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:40:42,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 266 treesize of output 428 [2022-12-13 04:41:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:41:39,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:41:40,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:41:40,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 222 [2022-12-13 04:41:40,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-12-13 04:41:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:41:40,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862355124] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:41:40,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 04:41:40,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 38 [2022-12-13 04:41:40,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713107685] [2022-12-13 04:41:40,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 04:41:40,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 04:41:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:41:40,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 04:41:40,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2022-12-13 04:41:40,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 04:41:40,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 21493 transitions, 721831 flow. Second operand has 38 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 38 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:41:40,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:41:40,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 04:41:40,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 04:45:53,701 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 04:45:53,707 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 04:45:53,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 520 states. [2022-12-13 04:45:53,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 04:45:53,722 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-13 04:45:53,919 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,SelfDestructingSolverStorable16 [2022-12-13 04:45:53,920 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (38states, 0/40 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 262820 conditions, 14902 events (6872/14901 cut-off events. For 52583/52583 co-relation queries the response was YES. Maximal size of possible extension queue 2798. Compared 164536 event pairs, 344 based on Foata normal form. 8/16572 useless extension candidates. Maximal degree in co-relation 169915. Up to 14902 conditions per place.). [2022-12-13 04:45:53,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 04:45:53,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 04:45:53,921 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 04:45:53,921 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:45:53,924 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 04:45:53,924 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 04:45:53,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:45:53 BasicIcfg [2022-12-13 04:45:53,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 04:45:53,942 INFO L158 Benchmark]: Toolchain (without parser) took 817104.34ms. Allocated memory was 190.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 166.6MB in the beginning and 631.3MB in the end (delta: -464.7MB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-13 04:45:53,942 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 04:45:53,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.05ms. Allocated memory is still 190.8MB. Free memory was 166.6MB in the beginning and 152.1MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 04:45:53,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.59ms. Allocated memory is still 190.8MB. Free memory was 152.1MB in the beginning and 149.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:45:53,943 INFO L158 Benchmark]: Boogie Preprocessor took 43.50ms. Allocated memory is still 190.8MB. Free memory was 149.5MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:45:53,943 INFO L158 Benchmark]: RCFGBuilder took 794.40ms. Allocated memory is still 190.8MB. Free memory was 147.4MB in the beginning and 108.1MB in the end (delta: 39.3MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-12-13 04:45:53,943 INFO L158 Benchmark]: TraceAbstraction took 816027.87ms. Allocated memory was 190.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 106.5MB in the beginning and 631.3MB in the end (delta: -524.8MB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-13 04:45:53,944 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.12ms. Allocated memory is still 190.8MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.05ms. Allocated memory is still 190.8MB. Free memory was 166.6MB in the beginning and 152.1MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.59ms. Allocated memory is still 190.8MB. Free memory was 152.1MB in the beginning and 149.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.50ms. Allocated memory is still 190.8MB. Free memory was 149.5MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 794.40ms. Allocated memory is still 190.8MB. Free memory was 147.4MB in the beginning and 108.1MB in the end (delta: 39.3MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 816027.87ms. Allocated memory was 190.8MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 106.5MB in the beginning and 631.3MB in the end (delta: -524.8MB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 228 PlacesBefore, 35 PlacesAfterwards, 243 TransitionsBefore, 33 TransitionsAfterwards, 2820 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 151 TrivialYvCompositions, 42 ConcurrentYvCompositions, 15 ChoiceCompositions, 210 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 1968, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1666, independent: 1651, independent conditional: 0, independent unconditional: 1651, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1666, independent: 1643, independent conditional: 0, independent unconditional: 1643, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1998, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1666, unknown conditional: 0, unknown unconditional: 1666] , Statistics on independence cache: Total cache size (in pairs): 2751, Positive cache size: 2736, Positive conditional cache size: 0, Positive unconditional cache size: 2736, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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, 37 PlacesBefore, 37 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 39 PlacesBefore, 38 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 30, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 40 PlacesBefore, 39 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 36, independent conditional: 30, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 36, independent conditional: 12, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 36, independent conditional: 12, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 30, independent conditional: 8, independent unconditional: 22, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 40 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 18, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 58 PlacesBefore, 57 PlacesAfterwards, 194 TransitionsBefore, 193 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 102 PlacesBefore, 101 PlacesAfterwards, 1083 TransitionsBefore, 1082 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 1957 TransitionsBefore, 1957 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 131 PlacesBefore, 131 PlacesAfterwards, 2130 TransitionsBefore, 2130 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 124 PlacesBefore, 124 PlacesAfterwards, 1486 TransitionsBefore, 1486 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 1937 TransitionsBefore, 1937 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 127 PlacesBefore, 126 PlacesAfterwards, 2226 TransitionsBefore, 2225 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 151 PlacesBefore, 151 PlacesAfterwards, 4937 TransitionsBefore, 4937 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 153 PlacesBefore, 152 PlacesAfterwards, 4936 TransitionsBefore, 4935 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.7s, 422 PlacesBefore, 416 PlacesAfterwards, 21499 TransitionsBefore, 21493 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 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): 18, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (38states, 0/40 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 262820 conditions, 14902 events (6872/14901 cut-off events. For 52583/52583 co-relation queries the response was YES. Maximal size of possible extension queue 2798. Compared 164536 event pairs, 344 based on Foata normal form. 8/16572 useless extension candidates. Maximal degree in co-relation 169915. Up to 14902 conditions per place.). - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (38states, 0/40 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 262820 conditions, 14902 events (6872/14901 cut-off events. For 52583/52583 co-relation queries the response was YES. Maximal size of possible extension queue 2798. Compared 164536 event pairs, 344 based on Foata normal form. 8/16572 useless extension candidates. Maximal degree in co-relation 169915. Up to 14902 conditions per place.). - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (38states, 0/40 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 262820 conditions, 14902 events (6872/14901 cut-off events. For 52583/52583 co-relation queries the response was YES. Maximal size of possible extension queue 2798. Compared 164536 event pairs, 344 based on Foata normal form. 8/16572 useless extension candidates. Maximal degree in co-relation 169915. Up to 14902 conditions per place.). - TimeoutResultAtElement [Line: 149]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (38states, 0/40 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 262820 conditions, 14902 events (6872/14901 cut-off events. For 52583/52583 co-relation queries the response was YES. Maximal size of possible extension queue 2798. Compared 164536 event pairs, 344 based on Foata normal form. 8/16572 useless extension candidates. Maximal degree in co-relation 169915. Up to 14902 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 277 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 815.9s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 659.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10744 SdHoareTripleChecker+Valid, 19.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10744 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 17.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 1887 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23214 IncrementalHoareTripleChecker+Invalid, 25101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1887 mSolverCounterUnsat, 0 mSDtfsCounter, 23214 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2067 GetRequests, 524 SyntacticMatches, 15 SemanticMatches, 1528 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289647 ImplicationChecksByTransitivity, 237.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=722029occurred in iteration=16, InterpolantAutomatonStates: 857, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 94.4s InterpolantComputationTime, 878 NumberOfCodeBlocks, 878 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1128 ConstructedInterpolants, 19 QuantifiedInterpolants, 17431 SizeOfPredicates, 458 NumberOfNonLiveVariables, 4990 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 38 InterpolantComputations, 8 PerfectInterpolantSequences, 186/434 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown