/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:51:31,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:51:31,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:51:31,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:51:31,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:51:31,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:51:31,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:51:31,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:51:31,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:51:31,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:51:31,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:51:31,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:51:31,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:51:31,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:51:31,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:51:31,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:51:31,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:51:31,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:51:31,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:51:31,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:51:31,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:51:31,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:51:31,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:51:31,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:51:31,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:51:31,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:51:31,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:51:31,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:51:31,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:51:31,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:51:31,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:51:31,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:51:31,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:51:31,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:51:31,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:51:31,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:51:31,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:51:31,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:51:31,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:51:31,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:51:31,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:51:31,400 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 07:51:31,426 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:51:31,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:51:31,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:51:31,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:51:31,428 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:51:31,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:51:31,429 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:51:31,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:51:31,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:51:31,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:51:31,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:51:31,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:51:31,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:51:31,430 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:51:31,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:51:31,430 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:51:31,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:51:31,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:51:31,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:51:31,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:51:31,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:51:31,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:51:31,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:51:31,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:51:31,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:51:31,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:51:31,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:51:31,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:51:31,432 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:51:31,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:51:31,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:51:31,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:51:31,722 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:51:31,722 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:51:31,723 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-12-13 07:51:32,787 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:51:32,977 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:51:32,978 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2022-12-13 07:51:32,983 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58767ccf/5106de7ea375464ab81f0264f7869553/FLAGe5920786d [2022-12-13 07:51:32,997 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58767ccf/5106de7ea375464ab81f0264f7869553 [2022-12-13 07:51:32,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:51:33,000 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:51:33,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:51:33,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:51:33,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:51:33,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:51:32" (1/1) ... [2022-12-13 07:51:33,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242550bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33, skipping insertion in model container [2022-12-13 07:51:33,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:51:32" (1/1) ... [2022-12-13 07:51:33,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:51:33,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:51:33,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,184 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-min-max-dec.wvr.c[3019,3032] [2022-12-13 07:51:33,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:51:33,206 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:51:33,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:51:33,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:51:33,251 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-min-max-dec.wvr.c[3019,3032] [2022-12-13 07:51:33,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:51:33,265 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:51:33,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33 WrapperNode [2022-12-13 07:51:33,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:51:33,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:51:33,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:51:33,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:51:33,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33" (1/1) ... [2022-12-13 07:51:33,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33" (1/1) ... [2022-12-13 07:51:33,312 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2022-12-13 07:51:33,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:51:33,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:51:33,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:51:33,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:51:33,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33" (1/1) ... [2022-12-13 07:51:33,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33" (1/1) ... [2022-12-13 07:51:33,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33" (1/1) ... [2022-12-13 07:51:33,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33" (1/1) ... [2022-12-13 07:51:33,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33" (1/1) ... [2022-12-13 07:51:33,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33" (1/1) ... [2022-12-13 07:51:33,343 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33" (1/1) ... [2022-12-13 07:51:33,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33" (1/1) ... [2022-12-13 07:51:33,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:51:33,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:51:33,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:51:33,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:51:33,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33" (1/1) ... [2022-12-13 07:51:33,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:51:33,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:33,388 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 07:51:33,410 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 07:51:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:51:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:51:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:51:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:51:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:51:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:51:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:51:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:51:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:51:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:51:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 07:51:33,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 07:51:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:51:33,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 07:51:33,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 07:51:33,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 07:51:33,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:51:33,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:51:33,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:51:33,428 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 07:51:33,566 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:51:33,568 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:51:33,791 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:51:33,845 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:51:33,845 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 07:51:33,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:51:33 BoogieIcfgContainer [2022-12-13 07:51:33,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:51:33,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:51:33,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:51:33,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:51:33,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:51:32" (1/3) ... [2022-12-13 07:51:33,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652ff14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:51:33, skipping insertion in model container [2022-12-13 07:51:33,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:51:33" (2/3) ... [2022-12-13 07:51:33,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652ff14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:51:33, skipping insertion in model container [2022-12-13 07:51:33,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:51:33" (3/3) ... [2022-12-13 07:51:33,853 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2022-12-13 07:51:33,867 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:51:33,867 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:51:33,867 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:51:33,935 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 07:51:33,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 160 transitions, 352 flow [2022-12-13 07:51:34,025 INFO L130 PetriNetUnfolder]: 12/156 cut-off events. [2022-12-13 07:51:34,025 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:51:34,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 156 events. 12/156 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-13 07:51:34,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 160 transitions, 352 flow [2022-12-13 07:51:34,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 144 transitions, 312 flow [2022-12-13 07:51:34,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:34,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 144 transitions, 312 flow [2022-12-13 07:51:34,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 312 flow [2022-12-13 07:51:34,131 INFO L130 PetriNetUnfolder]: 12/144 cut-off events. [2022-12-13 07:51:34,131 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:51:34,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 144 events. 12/144 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-13 07:51:34,134 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 144 transitions, 312 flow [2022-12-13 07:51:34,135 INFO L226 LiptonReduction]: Number of co-enabled transitions 2280 [2022-12-13 07:51:39,169 INFO L241 LiptonReduction]: Total number of compositions: 113 [2022-12-13 07:51:39,188 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:51:39,196 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;@3f3dd39a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:51:39,197 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 07:51:39,210 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2022-12-13 07:51:39,210 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:51:39,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:39,211 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, 1] [2022-12-13 07:51:39,211 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 2 more)] === [2022-12-13 07:51:39,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:39,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1695043003, now seen corresponding path program 1 times [2022-12-13 07:51:39,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:39,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819831095] [2022-12-13 07:51:39,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:39,600 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 07:51:39,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:39,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819831095] [2022-12-13 07:51:39,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819831095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:39,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:39,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:51:39,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001849242] [2022-12-13 07:51:39,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:39,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:51:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:39,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:51:39,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:51:39,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 07:51:39,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:39,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:39,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 07:51:39,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:40,014 INFO L130 PetriNetUnfolder]: 1420/1898 cut-off events. [2022-12-13 07:51:40,014 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-12-13 07:51:40,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1898 events. 1420/1898 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7133 event pairs, 765 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3498. Up to 1552 conditions per place. [2022-12-13 07:51:40,031 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-13 07:51:40,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2022-12-13 07:51:40,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:51:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:51:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-13 07:51:40,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2022-12-13 07:51:40,045 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2022-12-13 07:51:40,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 46 transitions, 215 flow [2022-12-13 07:51:40,056 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 46 transitions, 215 flow [2022-12-13 07:51:40,064 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:40,065 INFO L89 Accepts]: Start accepts. Operand has 43 places, 46 transitions, 215 flow [2022-12-13 07:51:40,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:40,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:40,069 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 46 transitions, 215 flow [2022-12-13 07:51:40,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 46 transitions, 215 flow [2022-12-13 07:51:40,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 07:51:40,076 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:40,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 07:51:40,078 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 46 transitions, 215 flow [2022-12-13 07:51:40,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:40,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:40,078 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, 1, 1] [2022-12-13 07:51:40,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:51:40,082 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 2 more)] === [2022-12-13 07:51:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:40,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1731643137, now seen corresponding path program 1 times [2022-12-13 07:51:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:40,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173284523] [2022-12-13 07:51:40,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:40,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:51:40,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:40,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173284523] [2022-12-13 07:51:40,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173284523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:40,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:40,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:51:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988230338] [2022-12-13 07:51:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:40,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:51:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:40,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:51:40,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:51:40,226 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 07:51:40,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 46 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:40,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:40,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 07:51:40,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:40,423 INFO L130 PetriNetUnfolder]: 1718/2336 cut-off events. [2022-12-13 07:51:40,424 INFO L131 PetriNetUnfolder]: For 556/556 co-relation queries the response was YES. [2022-12-13 07:51:40,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7130 conditions, 2336 events. 1718/2336 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8318 event pairs, 787 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 6270. Up to 1808 conditions per place. [2022-12-13 07:51:40,435 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 69 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2022-12-13 07:51:40,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 481 flow [2022-12-13 07:51:40,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:51:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:51:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-13 07:51:40,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2022-12-13 07:51:40,437 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2022-12-13 07:51:40,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 73 transitions, 481 flow [2022-12-13 07:51:40,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 73 transitions, 481 flow [2022-12-13 07:51:40,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:40,453 INFO L89 Accepts]: Start accepts. Operand has 46 places, 73 transitions, 481 flow [2022-12-13 07:51:40,454 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:40,454 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:40,455 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 73 transitions, 481 flow [2022-12-13 07:51:40,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 73 transitions, 481 flow [2022-12-13 07:51:40,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:40,457 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:40,457 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 07:51:40,458 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 73 transitions, 481 flow [2022-12-13 07:51:40,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:40,458 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:40,458 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, 1, 1, 1] [2022-12-13 07:51:40,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:51:40,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:40,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:40,459 INFO L85 PathProgramCache]: Analyzing trace with hash -632645235, now seen corresponding path program 1 times [2022-12-13 07:51:40,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:40,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589139497] [2022-12-13 07:51:40,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:40,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:40,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:40,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589139497] [2022-12-13 07:51:40,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589139497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:40,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:40,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:51:40,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963721863] [2022-12-13 07:51:40,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:40,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:51:40,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:40,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:51:40,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:51:40,540 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 07:51:40,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 73 transitions, 481 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:40,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:40,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 07:51:40,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:40,769 INFO L130 PetriNetUnfolder]: 2138/2902 cut-off events. [2022-12-13 07:51:40,769 INFO L131 PetriNetUnfolder]: For 1830/1830 co-relation queries the response was YES. [2022-12-13 07:51:40,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11581 conditions, 2902 events. 2138/2902 cut-off events. For 1830/1830 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10877 event pairs, 787 based on Foata normal form. 0/2449 useless extension candidates. Maximal degree in co-relation 10240. Up to 2244 conditions per place. [2022-12-13 07:51:40,788 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 107 selfloop transitions, 9 changer transitions 0/117 dead transitions. [2022-12-13 07:51:40,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 117 transitions, 1001 flow [2022-12-13 07:51:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:51:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:51:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-13 07:51:40,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2022-12-13 07:51:40,792 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2022-12-13 07:51:40,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 117 transitions, 1001 flow [2022-12-13 07:51:40,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 117 transitions, 1001 flow [2022-12-13 07:51:40,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:40,819 INFO L89 Accepts]: Start accepts. Operand has 49 places, 117 transitions, 1001 flow [2022-12-13 07:51:40,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:40,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:40,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 117 transitions, 1001 flow [2022-12-13 07:51:40,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 117 transitions, 1001 flow [2022-12-13 07:51:40,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:40,825 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:40,826 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:51:40,826 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 117 transitions, 1001 flow [2022-12-13 07:51:40,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:40,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:40,826 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, 1, 1, 1, 1] [2022-12-13 07:51:40,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:51:40,827 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 2 more)] === [2022-12-13 07:51:40,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:40,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1239127188, now seen corresponding path program 1 times [2022-12-13 07:51:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:40,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297754373] [2022-12-13 07:51:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:40,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 07:51:40,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:40,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297754373] [2022-12-13 07:51:40,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297754373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:40,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:40,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 07:51:40,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734064973] [2022-12-13 07:51:40,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:40,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:51:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:40,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:51:40,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:51:40,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 07:51:40,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 117 transitions, 1001 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:40,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:40,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 07:51:40,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:41,155 INFO L130 PetriNetUnfolder]: 2138/2903 cut-off events. [2022-12-13 07:51:41,156 INFO L131 PetriNetUnfolder]: For 3554/3554 co-relation queries the response was YES. [2022-12-13 07:51:41,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14315 conditions, 2903 events. 2138/2903 cut-off events. For 3554/3554 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10947 event pairs, 787 based on Foata normal form. 0/2450 useless extension candidates. Maximal degree in co-relation 12660. Up to 2729 conditions per place. [2022-12-13 07:51:41,171 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 115 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2022-12-13 07:51:41,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 118 transitions, 1243 flow [2022-12-13 07:51:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:51:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:51:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-13 07:51:41,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2022-12-13 07:51:41,173 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2022-12-13 07:51:41,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 118 transitions, 1243 flow [2022-12-13 07:51:41,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 118 transitions, 1243 flow [2022-12-13 07:51:41,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:41,197 INFO L89 Accepts]: Start accepts. Operand has 51 places, 118 transitions, 1243 flow [2022-12-13 07:51:41,199 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:41,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:41,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 118 transitions, 1243 flow [2022-12-13 07:51:41,200 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 118 transitions, 1243 flow [2022-12-13 07:51:41,200 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:42,412 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:51:42,413 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1216 [2022-12-13 07:51:42,413 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 117 transitions, 1233 flow [2022-12-13 07:51:42,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:42,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:42,413 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, 1, 1, 1, 1] [2022-12-13 07:51:42,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:51:42,414 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 2 more)] === [2022-12-13 07:51:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1444617111, now seen corresponding path program 1 times [2022-12-13 07:51:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:42,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456270509] [2022-12-13 07:51:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:51:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:43,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456270509] [2022-12-13 07:51:43,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456270509] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:43,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982428185] [2022-12-13 07:51:43,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:43,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:43,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:43,054 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 07:51:43,084 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 07:51:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:43,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 07:51:43,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:43,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:51:43,367 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 14 treesize of output 16 [2022-12-13 07:51:43,435 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 15 treesize of output 7 [2022-12-13 07:51:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:43,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:49,936 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 41 treesize of output 33 [2022-12-13 07:51:49,940 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 5 treesize of output 3 [2022-12-13 07:51:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:49,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982428185] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:49,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:49,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 25 [2022-12-13 07:51:49,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680589642] [2022-12-13 07:51:49,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:49,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 07:51:49,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:49,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 07:51:49,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=580, Unknown=7, NotChecked=0, Total=702 [2022-12-13 07:51:49,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 07:51:49,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 117 transitions, 1233 flow. Second operand has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:49,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:49,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 07:51:49,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:56,454 INFO L130 PetriNetUnfolder]: 21036/28909 cut-off events. [2022-12-13 07:51:56,454 INFO L131 PetriNetUnfolder]: For 46562/46562 co-relation queries the response was YES. [2022-12-13 07:51:56,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170273 conditions, 28909 events. 21036/28909 cut-off events. For 46562/46562 co-relation queries the response was YES. Maximal size of possible extension queue 1071. Compared 164259 event pairs, 519 based on Foata normal form. 15/22949 useless extension candidates. Maximal degree in co-relation 165760. Up to 27444 conditions per place. [2022-12-13 07:51:56,557 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 728 selfloop transitions, 223 changer transitions 1104/2056 dead transitions. [2022-12-13 07:51:56,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 2056 transitions, 25720 flow [2022-12-13 07:51:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-13 07:51:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-12-13 07:51:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 907 transitions. [2022-12-13 07:51:56,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4876344086021505 [2022-12-13 07:51:56,562 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 69 predicate places. [2022-12-13 07:51:56,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 2056 transitions, 25720 flow [2022-12-13 07:51:56,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 952 transitions, 11899 flow [2022-12-13 07:51:56,771 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:56,771 INFO L89 Accepts]: Start accepts. Operand has 80 places, 952 transitions, 11899 flow [2022-12-13 07:51:56,777 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:56,777 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:56,777 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 952 transitions, 11899 flow [2022-12-13 07:51:56,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 952 transitions, 11899 flow [2022-12-13 07:51:56,821 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:56,830 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:56,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 07:51:56,832 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 952 transitions, 11899 flow [2022-12-13 07:51:56,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.222222222222222) internal successors, (114), 27 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:56,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:56,833 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, 1, 1, 1, 1] [2022-12-13 07:51:56,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 07:51:57,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:57,038 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 2 more)] === [2022-12-13 07:51:57,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1312194429, now seen corresponding path program 2 times [2022-12-13 07:51:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:57,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010145830] [2022-12-13 07:51:57,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:57,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 07:51:57,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:57,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010145830] [2022-12-13 07:51:57,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010145830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:57,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:57,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 07:51:57,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115728052] [2022-12-13 07:51:57,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:57,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:51:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:57,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:51:57,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:51:57,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 07:51:57,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 952 transitions, 11899 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:57,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:57,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 07:51:57,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:59,954 INFO L130 PetriNetUnfolder]: 15330/21675 cut-off events. [2022-12-13 07:51:59,954 INFO L131 PetriNetUnfolder]: For 47698/47698 co-relation queries the response was YES. [2022-12-13 07:51:59,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147739 conditions, 21675 events. 15330/21675 cut-off events. For 47698/47698 co-relation queries the response was YES. Maximal size of possible extension queue 831. Compared 125625 event pairs, 58 based on Foata normal form. 15/16753 useless extension candidates. Maximal degree in co-relation 143586. Up to 20582 conditions per place. [2022-12-13 07:52:00,038 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 695 selfloop transitions, 15 changer transitions 1445/2156 dead transitions. [2022-12-13 07:52:00,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 2156 transitions, 31122 flow [2022-12-13 07:52:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:52:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:52:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-13 07:52:00,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4967741935483871 [2022-12-13 07:52:00,040 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 44 predicate places. [2022-12-13 07:52:00,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 2156 transitions, 31122 flow [2022-12-13 07:52:00,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 711 transitions, 10370 flow [2022-12-13 07:52:00,216 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:00,216 INFO L89 Accepts]: Start accepts. Operand has 70 places, 711 transitions, 10370 flow [2022-12-13 07:52:00,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:00,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:00,220 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 711 transitions, 10370 flow [2022-12-13 07:52:00,247 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 711 transitions, 10370 flow [2022-12-13 07:52:00,247 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:52:00,254 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:52:00,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 07:52:00,255 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 711 transitions, 10370 flow [2022-12-13 07:52:00,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:00,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:00,256 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, 1, 1, 1, 1] [2022-12-13 07:52:00,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 07:52:00,256 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 2 more)] === [2022-12-13 07:52:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:00,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1074336045, now seen corresponding path program 3 times [2022-12-13 07:52:00,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:00,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90246821] [2022-12-13 07:52:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:52:00,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:00,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90246821] [2022-12-13 07:52:00,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90246821] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:00,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864387040] [2022-12-13 07:52:00,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:52:00,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:00,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:52:00,748 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 07:52:00,811 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 07:52:01,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:52:01,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:52:01,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 07:52:01,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:52:01,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:52:01,160 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 14 treesize of output 16 [2022-12-13 07:52:01,175 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 15 treesize of output 7 [2022-12-13 07:52:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:52:01,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:52:01,273 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_278) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ 2 .cse0))))) is different from false [2022-12-13 07:52:05,434 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 41 treesize of output 33 [2022-12-13 07:52:05,438 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 5 treesize of output 3 [2022-12-13 07:52:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-12-13 07:52:05,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864387040] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:52:05,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:52:05,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2022-12-13 07:52:05,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919235136] [2022-12-13 07:52:05,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:52:05,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 07:52:05,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:05,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 07:52:05,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=334, Unknown=6, NotChecked=38, Total=462 [2022-12-13 07:52:05,454 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-13 07:52:05,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 711 transitions, 10370 flow. Second operand has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 22 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:05,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:05,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-13 07:52:05,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:09,998 INFO L130 PetriNetUnfolder]: 21757/30349 cut-off events. [2022-12-13 07:52:09,998 INFO L131 PetriNetUnfolder]: For 101871/101871 co-relation queries the response was YES. [2022-12-13 07:52:10,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236465 conditions, 30349 events. 21757/30349 cut-off events. For 101871/101871 co-relation queries the response was YES. Maximal size of possible extension queue 1094. Compared 177632 event pairs, 125 based on Foata normal form. 17/23467 useless extension candidates. Maximal degree in co-relation 219624. Up to 28724 conditions per place. [2022-12-13 07:52:10,167 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 1398 selfloop transitions, 250 changer transitions 1548/3197 dead transitions. [2022-12-13 07:52:10,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 3197 transitions, 52940 flow [2022-12-13 07:52:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 07:52:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 07:52:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 405 transitions. [2022-12-13 07:52:10,169 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5024813895781638 [2022-12-13 07:52:10,170 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 55 predicate places. [2022-12-13 07:52:10,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 3197 transitions, 52940 flow [2022-12-13 07:52:10,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 1649 transitions, 27317 flow [2022-12-13 07:52:10,496 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:10,496 INFO L89 Accepts]: Start accepts. Operand has 78 places, 1649 transitions, 27317 flow [2022-12-13 07:52:10,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:10,505 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:10,505 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 1649 transitions, 27317 flow [2022-12-13 07:52:10,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 1649 transitions, 27317 flow [2022-12-13 07:52:10,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:52:10,586 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:52:10,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 07:52:10,587 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 1649 transitions, 27317 flow [2022-12-13 07:52:10,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 22 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:10,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:10,587 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, 1, 1, 1, 1] [2022-12-13 07:52:10,592 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 07:52:10,792 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 07:52:10,792 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 2 more)] === [2022-12-13 07:52:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1607618685, now seen corresponding path program 4 times [2022-12-13 07:52:10,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:10,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884798910] [2022-12-13 07:52:10,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:52:11,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:11,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884798910] [2022-12-13 07:52:11,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884798910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:11,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74919857] [2022-12-13 07:52:11,532 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:52:11,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:11,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:52:11,545 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 07:52:11,546 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 07:52:11,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:52:11,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:52:11,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 07:52:11,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:52:11,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:52:11,831 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 14 treesize of output 16 [2022-12-13 07:52:11,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:52:11,854 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 14 treesize of output 16 [2022-12-13 07:52:11,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-13 07:52:11,905 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 17 treesize of output 9 [2022-12-13 07:52:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:52:11,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:52:12,179 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_344) c_~A~0.base) c_~A~0.offset))) (or (< 2147483647 .cse0) (< c_~min~0 (+ .cse0 1))))) (= (mod c_~b1~0 256) 0)) is different from false [2022-12-13 07:52:12,253 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (and (or (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_344) c_~A~0.base) c_~A~0.offset))) (or (< 2147483647 .cse0) (< c_~min~0 (+ .cse0 1))))) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (not (< c_~min~0 (select .cse1 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))) (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_344) c_~A~0.base) c_~A~0.offset))) (or (< 2147483647 .cse2) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (let ((.cse3 (select .cse1 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< c_~min~0 .cse3) (< .cse3 (+ .cse2 1))))))))))) is different from false [2022-12-13 07:52:12,271 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (and (or (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_344) c_~A~0.base) c_~A~0.offset))) (or (< 2147483647 .cse0) (< c_~min~0 (+ .cse0 1))))) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (not (< c_~min~0 (select .cse1 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))) (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_344) c_~A~0.base) c_~A~0.offset))) (or (< 2147483647 .cse2) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (let ((.cse3 (select .cse1 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< c_~min~0 .cse3) (< .cse3 (+ .cse2 1)))))))))) is different from false [2022-12-13 07:52:12,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:52:12,297 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 419 treesize of output 375 [2022-12-13 07:52:12,304 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 338 treesize of output 330 [2022-12-13 07:52:12,310 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 330 treesize of output 314 [2022-12-13 07:52:12,316 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 314 treesize of output 306 [2022-12-13 07:52:12,321 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 306 treesize of output 302 [2022-12-13 07:52:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-12-13 07:52:12,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74919857] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:52:12,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:52:12,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 31 [2022-12-13 07:52:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779092686] [2022-12-13 07:52:12,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:52:12,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 07:52:12,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:12,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 07:52:12,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=729, Unknown=7, NotChecked=174, Total=1056 [2022-12-13 07:52:12,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 07:52:12,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 1649 transitions, 27317 flow. Second operand has 33 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:12,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:12,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 07:52:12,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:23,271 INFO L130 PetriNetUnfolder]: 27686/38646 cut-off events. [2022-12-13 07:52:23,272 INFO L131 PetriNetUnfolder]: For 60761/60761 co-relation queries the response was YES. [2022-12-13 07:52:23,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343385 conditions, 38646 events. 27686/38646 cut-off events. For 60761/60761 co-relation queries the response was YES. Maximal size of possible extension queue 1383. Compared 231610 event pairs, 134 based on Foata normal form. 20/29664 useless extension candidates. Maximal degree in co-relation 320976. Up to 37188 conditions per place. [2022-12-13 07:52:23,477 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 2463 selfloop transitions, 336 changer transitions 2064/4863 dead transitions. [2022-12-13 07:52:23,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 4863 transitions, 90138 flow [2022-12-13 07:52:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-13 07:52:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-13 07:52:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 665 transitions. [2022-12-13 07:52:23,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4206198608475648 [2022-12-13 07:52:23,480 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 88 predicate places. [2022-12-13 07:52:23,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 4863 transitions, 90138 flow [2022-12-13 07:52:23,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 2799 transitions, 51939 flow [2022-12-13 07:52:24,018 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:24,019 INFO L89 Accepts]: Start accepts. Operand has 92 places, 2799 transitions, 51939 flow [2022-12-13 07:52:24,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:24,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:24,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 2799 transitions, 51939 flow [2022-12-13 07:52:24,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 2799 transitions, 51939 flow [2022-12-13 07:52:24,122 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:52:27,583 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:52:27,584 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3566 [2022-12-13 07:52:27,584 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 2798 transitions, 51921 flow [2022-12-13 07:52:27,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:27,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:27,584 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, 1, 1, 1] [2022-12-13 07:52:27,593 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 07:52:27,785 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 07:52:27,786 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 2 more)] === [2022-12-13 07:52:27,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash 691830777, now seen corresponding path program 1 times [2022-12-13 07:52:27,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:27,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016781370] [2022-12-13 07:52:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:52:27,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:27,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016781370] [2022-12-13 07:52:27,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016781370] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:27,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826434081] [2022-12-13 07:52:27,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:27,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:27,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:52:27,989 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 07:52:27,990 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 07:52:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:28,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 07:52:28,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:52:28,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 07:52:28,138 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 15 treesize of output 7 [2022-12-13 07:52:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:52:28,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:52:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:52:28,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826434081] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:28,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:52:28,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7] total 17 [2022-12-13 07:52:28,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995894944] [2022-12-13 07:52:28,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:52:28,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:52:28,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:28,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:52:28,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:52:28,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-13 07:52:28,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 2798 transitions, 51921 flow. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:28,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:28,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-13 07:52:28,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:42,871 INFO L130 PetriNetUnfolder]: 37765/53027 cut-off events. [2022-12-13 07:52:42,872 INFO L131 PetriNetUnfolder]: For 86834/86834 co-relation queries the response was YES. [2022-12-13 07:52:42,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523765 conditions, 53027 events. 37765/53027 cut-off events. For 86834/86834 co-relation queries the response was YES. Maximal size of possible extension queue 1937. Compared 336207 event pairs, 93 based on Foata normal form. 30/40359 useless extension candidates. Maximal degree in co-relation 500572. Up to 51312 conditions per place. [2022-12-13 07:52:43,303 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 3719 selfloop transitions, 203 changer transitions 2208/6134 dead transitions. [2022-12-13 07:52:43,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 6134 transitions, 125987 flow [2022-12-13 07:52:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:52:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:52:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2022-12-13 07:52:43,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5142045454545454 [2022-12-13 07:52:43,306 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 61 predicate places. [2022-12-13 07:52:43,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 6134 transitions, 125987 flow [2022-12-13 07:52:43,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 3926 transitions, 80702 flow [2022-12-13 07:52:43,895 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:43,895 INFO L89 Accepts]: Start accepts. Operand has 97 places, 3926 transitions, 80702 flow [2022-12-13 07:52:43,914 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:43,914 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:43,914 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 3926 transitions, 80702 flow [2022-12-13 07:52:44,038 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 3926 transitions, 80702 flow [2022-12-13 07:52:44,038 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:52:44,057 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:52:44,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-13 07:52:44,058 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 3926 transitions, 80702 flow [2022-12-13 07:52:44,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:44,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:44,058 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, 1, 1, 1] [2022-12-13 07:52:44,080 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 07:52:44,264 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 07:52:44,265 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 2 more)] === [2022-12-13 07:52:44,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:44,265 INFO L85 PathProgramCache]: Analyzing trace with hash -498206593, now seen corresponding path program 2 times [2022-12-13 07:52:44,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:44,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209452992] [2022-12-13 07:52:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:44,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:52:44,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:44,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209452992] [2022-12-13 07:52:44,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209452992] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:44,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565689475] [2022-12-13 07:52:44,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:52:44,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:44,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:52:44,692 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 07:52:44,707 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 07:52:44,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:52:44,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:52:44,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 07:52:44,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:52:44,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:52:44,964 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 14 treesize of output 16 [2022-12-13 07:52:45,012 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 15 treesize of output 7 [2022-12-13 07:52:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:52:45,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:52:45,194 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 27 treesize of output 19 [2022-12-13 07:52:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:52:45,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565689475] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:45,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:52:45,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 20 [2022-12-13 07:52:45,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332258085] [2022-12-13 07:52:45,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:52:45,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:52:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:45,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:52:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=364, Unknown=1, NotChecked=0, Total=462 [2022-12-13 07:52:45,204 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-13 07:52:45,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 3926 transitions, 80702 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:45,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:45,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-13 07:52:45,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:32,427 INFO L130 PetriNetUnfolder]: 83190/117338 cut-off events. [2022-12-13 07:53:32,428 INFO L131 PetriNetUnfolder]: For 201194/201194 co-relation queries the response was YES. [2022-12-13 07:53:32,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274827 conditions, 117338 events. 83190/117338 cut-off events. For 201194/201194 co-relation queries the response was YES. Maximal size of possible extension queue 4311. Compared 826263 event pairs, 437 based on Foata normal form. 78/88598 useless extension candidates. Maximal degree in co-relation 599743. Up to 113839 conditions per place. [2022-12-13 07:53:33,186 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 6261 selfloop transitions, 110 changer transitions 8036/14411 dead transitions. [2022-12-13 07:53:33,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 14411 transitions, 324925 flow [2022-12-13 07:53:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 07:53:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 07:53:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 292 transitions. [2022-12-13 07:53:33,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-13 07:53:33,188 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 71 predicate places. [2022-12-13 07:53:33,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 14411 transitions, 324925 flow [2022-12-13 07:53:33,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 6375 transitions, 143828 flow [2022-12-13 07:53:34,410 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:34,410 INFO L89 Accepts]: Start accepts. Operand has 107 places, 6375 transitions, 143828 flow [2022-12-13 07:53:34,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:34,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:34,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 6375 transitions, 143828 flow [2022-12-13 07:53:34,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 6375 transitions, 143828 flow [2022-12-13 07:53:34,773 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:53:34,810 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:53:34,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 401 [2022-12-13 07:53:34,811 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 6375 transitions, 143828 flow [2022-12-13 07:53:34,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:34,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:34,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:53:34,835 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 07:53:35,017 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 07:53:35,017 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 2 more)] === [2022-12-13 07:53:35,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:35,017 INFO L85 PathProgramCache]: Analyzing trace with hash -324488671, now seen corresponding path program 3 times [2022-12-13 07:53:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:35,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004814308] [2022-12-13 07:53:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:53:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:35,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004814308] [2022-12-13 07:53:35,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004814308] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:53:35,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940562045] [2022-12-13 07:53:35,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:53:35,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:53:35,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:53:35,630 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 07:53:35,632 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 07:53:35,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:53:35,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:53:35,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 07:53:35,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:53:35,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:53:35,880 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 14 treesize of output 16 [2022-12-13 07:53:35,923 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 15 treesize of output 7 [2022-12-13 07:53:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:53:35,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:53:36,149 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 27 treesize of output 19 [2022-12-13 07:53:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:53:36,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940562045] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:53:36,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:53:36,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 19 [2022-12-13 07:53:36,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159039997] [2022-12-13 07:53:36,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:53:36,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:53:36,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:36,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:53:36,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=332, Unknown=2, NotChecked=0, Total=420 [2022-12-13 07:53:36,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-13 07:53:36,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 6375 transitions, 143828 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:36,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:36,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-13 07:53:36,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:54:27,525 INFO L130 PetriNetUnfolder]: 52098/73834 cut-off events. [2022-12-13 07:54:27,526 INFO L131 PetriNetUnfolder]: For 147414/147414 co-relation queries the response was YES. [2022-12-13 07:54:27,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874824 conditions, 73834 events. 52098/73834 cut-off events. For 147414/147414 co-relation queries the response was YES. Maximal size of possible extension queue 2731. Compared 496450 event pairs, 369 based on Foata normal form. 18/55597 useless extension candidates. Maximal degree in co-relation 474717. Up to 71779 conditions per place. [2022-12-13 07:54:27,975 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 5499 selfloop transitions, 122 changer transitions 2456/8081 dead transitions. [2022-12-13 07:54:27,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 8081 transitions, 198159 flow [2022-12-13 07:54:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:54:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:54:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 222 transitions. [2022-12-13 07:54:27,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.578125 [2022-12-13 07:54:27,976 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 78 predicate places. [2022-12-13 07:54:27,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 8081 transitions, 198159 flow [2022-12-13 07:54:28,363 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 5625 transitions, 138105 flow [2022-12-13 07:54:29,013 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:54:29,014 INFO L89 Accepts]: Start accepts. Operand has 117 places, 5625 transitions, 138105 flow [2022-12-13 07:54:29,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:54:29,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:54:29,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 5625 transitions, 138105 flow [2022-12-13 07:54:29,204 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 5625 transitions, 138105 flow [2022-12-13 07:54:29,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:54:29,230 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:54:29,231 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-13 07:54:29,231 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 5625 transitions, 138105 flow [2022-12-13 07:54:29,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:29,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:54:29,231 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, 1, 1, 1] [2022-12-13 07:54:29,237 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 07:54:29,437 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 07:54:29,437 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 2 more)] === [2022-12-13 07:54:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:54:29,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1083527423, now seen corresponding path program 4 times [2022-12-13 07:54:29,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:54:29,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224766802] [2022-12-13 07:54:29,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:54:29,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:54:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:54:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:54:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:54:29,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224766802] [2022-12-13 07:54:29,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224766802] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:54:29,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121245491] [2022-12-13 07:54:29,986 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:54:29,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:54:29,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:54:29,988 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 07:54:29,990 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 07:54:30,095 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:54:30,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:54:30,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 07:54:30,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:54:30,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:54:30,155 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 14 treesize of output 16 [2022-12-13 07:54:30,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-13 07:54:30,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:54:30,221 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 16 treesize of output 18 [2022-12-13 07:54:30,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:54:30,266 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 57 treesize of output 41 [2022-12-13 07:54:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:54:30,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:54:32,565 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_626 (Array Int Int)) (v_ArrVal_624 Int) (thread1Thread1of1ForFork1_~i~0 Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse3 (+ (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|) c_~A~0.offset))) (let ((.cse1 (select (store (store |c_#memory_int| c_~A~0.base (store .cse2 .cse3 v_ArrVal_624)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_626) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (<= .cse0 (+ c_~max~0 1)) (< (select .cse1 c_~A~0.offset) .cse0) (not (<= (+ v_ArrVal_624 1) (select .cse2 .cse3)))))))) (<= 2147483647 c_~max~0)) is different from false [2022-12-13 07:54:32,577 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_626 (Array Int Int)) (v_ArrVal_624 Int) (thread1Thread1of1ForFork1_~i~0 Int)) (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select (store (store |c_#memory_int| c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_624)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_626) c_~A~0.base))) (let ((.cse2 (select .cse1 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (<= (+ v_ArrVal_624 1) (select .cse0 c_~A~0.offset))) (< (select .cse1 c_~A~0.offset) .cse2) (<= .cse2 (+ c_~max~0 1))))))) (<= 2147483647 c_~max~0)) is different from false [2022-12-13 07:54:32,598 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_624 Int) (thread1Thread1of1ForFork1_~i~0 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623))) (let ((.cse0 (select .cse3 c_~A~0.base))) (let ((.cse2 (select (store (store .cse3 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_624)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_626) c_~A~0.base))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (not (<= (+ v_ArrVal_624 1) (select .cse0 c_~A~0.offset))) (<= .cse1 (+ c_~max~0 1)) (< (select .cse2 c_~A~0.offset) .cse1))))))) (<= 2147483647 c_~max~0)) is different from false [2022-12-13 07:54:32,605 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 210 treesize of output 194 [2022-12-13 07:54:32,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:54:32,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 124 [2022-12-13 07:54:32,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:54:32,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 170 [2022-12-13 07:54:32,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:54:32,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 151 [2022-12-13 07:54:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-12-13 07:54:32,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121245491] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:54:32,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:54:32,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2022-12-13 07:54:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692181001] [2022-12-13 07:54:32,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:54:32,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 07:54:32,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:54:32,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 07:54:32,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=629, Unknown=6, NotChecked=162, Total=930 [2022-12-13 07:54:32,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 07:54:32,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 5625 transitions, 138105 flow. Second operand has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:32,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:54:32,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 07:54:32,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:55:29,554 INFO L130 PetriNetUnfolder]: 58003/83011 cut-off events. [2022-12-13 07:55:29,555 INFO L131 PetriNetUnfolder]: For 151288/151288 co-relation queries the response was YES. [2022-12-13 07:55:29,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1070868 conditions, 83011 events. 58003/83011 cut-off events. For 151288/151288 co-relation queries the response was YES. Maximal size of possible extension queue 3242. Compared 578637 event pairs, 385 based on Foata normal form. 24/61345 useless extension candidates. Maximal degree in co-relation 525624. Up to 81290 conditions per place. [2022-12-13 07:55:30,028 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 6427 selfloop transitions, 185 changer transitions 2072/8684 dead transitions. [2022-12-13 07:55:30,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 8684 transitions, 230119 flow [2022-12-13 07:55:30,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 07:55:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 07:55:30,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 366 transitions. [2022-12-13 07:55:30,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4765625 [2022-12-13 07:55:30,031 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 100 predicate places. [2022-12-13 07:55:30,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 8684 transitions, 230119 flow [2022-12-13 07:55:30,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 6612 transitions, 175161 flow [2022-12-13 07:55:30,991 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:55:30,991 INFO L89 Accepts]: Start accepts. Operand has 133 places, 6612 transitions, 175161 flow [2022-12-13 07:55:31,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:55:31,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:55:31,029 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 6612 transitions, 175161 flow [2022-12-13 07:55:31,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 6612 transitions, 175161 flow [2022-12-13 07:55:31,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:55:31,263 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:55:31,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-13 07:55:31,264 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 6612 transitions, 175161 flow [2022-12-13 07:55:31,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:31,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:55:31,264 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, 1, 1, 1] [2022-12-13 07:55:31,269 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 07:55:31,466 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 07:55:31,467 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 2 more)] === [2022-12-13 07:55:31,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:55:31,467 INFO L85 PathProgramCache]: Analyzing trace with hash 288893339, now seen corresponding path program 5 times [2022-12-13 07:55:31,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:55:31,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418339914] [2022-12-13 07:55:31,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:55:31,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:55:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:55:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 07:55:31,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:55:31,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418339914] [2022-12-13 07:55:31,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418339914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:55:31,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:55:31,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 07:55:31,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334553623] [2022-12-13 07:55:31,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:55:31,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:55:31,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:55:31,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:55:31,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:55:31,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-13 07:55:31,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 6612 transitions, 175161 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:31,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:55:31,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-13 07:55:31,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:56:39,796 INFO L130 PetriNetUnfolder]: 52960/76318 cut-off events. [2022-12-13 07:56:39,796 INFO L131 PetriNetUnfolder]: For 168014/168014 co-relation queries the response was YES. [2022-12-13 07:56:39,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057912 conditions, 76318 events. 52960/76318 cut-off events. For 168014/168014 co-relation queries the response was YES. Maximal size of possible extension queue 2954. Compared 532833 event pairs, 77 based on Foata normal form. 80/56184 useless extension candidates. Maximal degree in co-relation 486595. Up to 74655 conditions per place. [2022-12-13 07:56:40,207 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 3692 selfloop transitions, 91 changer transitions 7118/10909 dead transitions. [2022-12-13 07:56:40,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 10909 transitions, 310121 flow [2022-12-13 07:56:40,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:56:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:56:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-13 07:56:40,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 07:56:40,209 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 97 predicate places. [2022-12-13 07:56:40,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 10909 transitions, 310121 flow [2022-12-13 07:56:40,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 3791 transitions, 108361 flow [2022-12-13 07:56:41,194 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:56:41,194 INFO L89 Accepts]: Start accepts. Operand has 124 places, 3791 transitions, 108361 flow [2022-12-13 07:56:41,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:56:41,221 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:56:41,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 3791 transitions, 108361 flow [2022-12-13 07:56:41,426 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 3791 transitions, 108361 flow [2022-12-13 07:56:41,426 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:56:41,448 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:56:41,449 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-13 07:56:41,449 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 3791 transitions, 108361 flow [2022-12-13 07:56:41,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:56:41,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:56:41,449 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:56:41,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 07:56:41,449 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 2 more)] === [2022-12-13 07:56:41,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:56:41,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1064501565, now seen corresponding path program 6 times [2022-12-13 07:56:41,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:56:41,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704360138] [2022-12-13 07:56:41,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:56:41,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:56:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:56:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:56:41,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:56:41,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704360138] [2022-12-13 07:56:41,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704360138] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:56:41,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12104700] [2022-12-13 07:56:41,511 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:56:41,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:56:41,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:56:41,534 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 07:56:41,551 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 07:56:41,676 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:56:41,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:56:41,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 07:56:41,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:56:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:56:41,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:56:41,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12104700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:56:41,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:56:41,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-13 07:56:41,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337980904] [2022-12-13 07:56:41,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:56:41,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:56:41,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:56:41,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:56:41,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:56:41,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 07:56:41,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 3791 transitions, 108361 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:56:41,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:56:41,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 07:56:41,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:56:56,205 INFO L130 PetriNetUnfolder]: 18775/26747 cut-off events. [2022-12-13 07:56:56,206 INFO L131 PetriNetUnfolder]: For 115197/115197 co-relation queries the response was YES. [2022-12-13 07:56:56,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395501 conditions, 26747 events. 18775/26747 cut-off events. For 115197/115197 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 157192 event pairs, 53 based on Foata normal form. 155/20586 useless extension candidates. Maximal degree in co-relation 360954. Up to 25846 conditions per place. [2022-12-13 07:56:56,407 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 2583 selfloop transitions, 0 changer transitions 479/3062 dead transitions. [2022-12-13 07:56:56,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 3062 transitions, 93698 flow [2022-12-13 07:56:56,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:56:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:56:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-13 07:56:56,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41875 [2022-12-13 07:56:56,409 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 81 predicate places. [2022-12-13 07:56:56,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 3062 transitions, 93698 flow [2022-12-13 07:56:56,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 2583 transitions, 78986 flow [2022-12-13 07:56:56,784 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:56:56,785 INFO L89 Accepts]: Start accepts. Operand has 115 places, 2583 transitions, 78986 flow [2022-12-13 07:56:56,806 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:56:56,806 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:56:56,806 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 2583 transitions, 78986 flow [2022-12-13 07:56:56,855 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 2583 transitions, 78986 flow [2022-12-13 07:56:56,856 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:57:00,960 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:57:00,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4177 [2022-12-13 07:57:00,961 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 2582 transitions, 78956 flow [2022-12-13 07:57:00,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:00,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:57:00,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:57:00,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 07:57:01,169 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,SelfDestructingSolverStorable13 [2022-12-13 07:57:01,169 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 2 more)] === [2022-12-13 07:57:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:57:01,169 INFO L85 PathProgramCache]: Analyzing trace with hash 887996801, now seen corresponding path program 1 times [2022-12-13 07:57:01,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:57:01,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292642554] [2022-12-13 07:57:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:57:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:57:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:57:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:57:01,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:57:01,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292642554] [2022-12-13 07:57:01,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292642554] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:57:01,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720551587] [2022-12-13 07:57:01,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:57:01,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:57:01,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:57:01,227 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 07:57:01,229 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 07:57:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:57:01,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:57:01,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:57:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:57:01,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:57:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:57:01,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720551587] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:57:01,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:57:01,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 07:57:01,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144560999] [2022-12-13 07:57:01,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:57:01,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:57:01,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:57:01,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:57:01,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:57:01,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 07:57:01,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 2582 transitions, 78956 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:01,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:57:01,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 07:57:01,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:57:11,396 INFO L130 PetriNetUnfolder]: 21447/30215 cut-off events. [2022-12-13 07:57:11,396 INFO L131 PetriNetUnfolder]: For 100564/100564 co-relation queries the response was YES. [2022-12-13 07:57:11,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479144 conditions, 30215 events. 21447/30215 cut-off events. For 100564/100564 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 177326 event pairs, 81 based on Foata normal form. 0/23376 useless extension candidates. Maximal degree in co-relation 457633. Up to 30216 conditions per place. [2022-12-13 07:57:11,807 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 3088 selfloop transitions, 210 changer transitions 6/3304 dead transitions. [2022-12-13 07:57:11,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 3304 transitions, 107647 flow [2022-12-13 07:57:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:57:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:57:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-13 07:57:11,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41875 [2022-12-13 07:57:11,808 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 78 predicate places. [2022-12-13 07:57:11,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 3304 transitions, 107647 flow [2022-12-13 07:57:12,025 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 3298 transitions, 107446 flow [2022-12-13 07:57:12,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:57:12,208 INFO L89 Accepts]: Start accepts. Operand has 118 places, 3298 transitions, 107446 flow [2022-12-13 07:57:12,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:57:12,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:57:12,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 3298 transitions, 107446 flow [2022-12-13 07:57:12,293 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 3298 transitions, 107446 flow [2022-12-13 07:57:12,293 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:57:12,303 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:57:12,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 07:57:12,304 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 3298 transitions, 107446 flow [2022-12-13 07:57:12,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:12,304 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:57:12,304 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:57:12,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 07:57:12,509 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,SelfDestructingSolverStorable14 [2022-12-13 07:57:12,509 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 2 more)] === [2022-12-13 07:57:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:57:12,509 INFO L85 PathProgramCache]: Analyzing trace with hash -478084599, now seen corresponding path program 2 times [2022-12-13 07:57:12,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:57:12,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791693053] [2022-12-13 07:57:12,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:57:12,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:57:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:57:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 07:57:12,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:57:12,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791693053] [2022-12-13 07:57:12,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791693053] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:57:12,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803559488] [2022-12-13 07:57:12,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:57:12,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:57:12,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:57:12,570 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 07:57:12,576 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 07:57:12,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:57:12,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:57:12,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:57:12,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:57:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 07:57:12,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:57:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 07:57:12,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803559488] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:57:12,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:57:12,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 07:57:12,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444755325] [2022-12-13 07:57:12,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:57:12,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:57:12,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:57:12,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:57:12,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:57:12,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-13 07:57:12,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 3298 transitions, 107446 flow. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:12,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:57:12,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-13 07:57:12,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:57:32,729 INFO L130 PetriNetUnfolder]: 27116/38046 cut-off events. [2022-12-13 07:57:32,730 INFO L131 PetriNetUnfolder]: For 149853/149853 co-relation queries the response was YES. [2022-12-13 07:57:32,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640371 conditions, 38046 events. 27116/38046 cut-off events. For 149853/149853 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 228265 event pairs, 122 based on Foata normal form. 0/29956 useless extension candidates. Maximal degree in co-relation 617558. Up to 38047 conditions per place. [2022-12-13 07:57:33,034 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 3936 selfloop transitions, 340 changer transitions 0/4281 dead transitions. [2022-12-13 07:57:33,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 4281 transitions, 147937 flow [2022-12-13 07:57:33,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:57:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:57:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-13 07:57:33,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41875 [2022-12-13 07:57:33,040 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 82 predicate places. [2022-12-13 07:57:33,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 4281 transitions, 147937 flow [2022-12-13 07:57:33,330 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 4281 transitions, 147937 flow [2022-12-13 07:57:33,734 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:57:33,735 INFO L89 Accepts]: Start accepts. Operand has 122 places, 4281 transitions, 147937 flow [2022-12-13 07:57:33,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:57:33,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:57:33,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 4281 transitions, 147937 flow [2022-12-13 07:57:33,854 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 4281 transitions, 147937 flow [2022-12-13 07:57:33,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:57:33,867 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:57:33,869 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 07:57:33,869 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 4281 transitions, 147937 flow [2022-12-13 07:57:33,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:33,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:57:33,871 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:57:33,882 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 07:57:34,076 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,SelfDestructingSolverStorable15 [2022-12-13 07:57:34,076 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 2 more)] === [2022-12-13 07:57:34,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:57:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1820343230, now seen corresponding path program 3 times [2022-12-13 07:57:34,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:57:34,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545694136] [2022-12-13 07:57:34,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:57:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:57:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:57:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 07:57:34,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:57:34,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545694136] [2022-12-13 07:57:34,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545694136] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:57:34,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156793507] [2022-12-13 07:57:34,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:57:34,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:57:34,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:57:34,149 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 07:57:34,156 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 07:57:34,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:57:34,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:57:34,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:57:34,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:57:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 07:57:34,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:57:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 07:57:34,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156793507] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:57:34,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:57:34,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 07:57:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631882283] [2022-12-13 07:57:34,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:57:34,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:57:34,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:57:34,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:57:34,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:57:34,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-13 07:57:34,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 4281 transitions, 147937 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:34,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:57:34,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-13 07:57:34,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:58:00,448 INFO L130 PetriNetUnfolder]: 26974/37678 cut-off events. [2022-12-13 07:58:00,449 INFO L131 PetriNetUnfolder]: For 139069/139069 co-relation queries the response was YES. [2022-12-13 07:58:00,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673317 conditions, 37678 events. 26974/37678 cut-off events. For 139069/139069 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 221911 event pairs, 87 based on Foata normal form. 0/30092 useless extension candidates. Maximal degree in co-relation 654619. Up to 37679 conditions per place. [2022-12-13 07:58:00,760 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 4248 selfloop transitions, 417 changer transitions 0/4670 dead transitions. [2022-12-13 07:58:00,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 4670 transitions, 170412 flow [2022-12-13 07:58:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:58:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:58:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-13 07:58:00,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41875 [2022-12-13 07:58:00,767 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 86 predicate places. [2022-12-13 07:58:00,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 4670 transitions, 170412 flow [2022-12-13 07:58:01,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 4670 transitions, 170412 flow [2022-12-13 07:58:01,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:58:01,463 INFO L89 Accepts]: Start accepts. Operand has 126 places, 4670 transitions, 170412 flow [2022-12-13 07:58:01,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:58:01,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:58:01,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 4670 transitions, 170412 flow [2022-12-13 07:58:01,621 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 4670 transitions, 170412 flow [2022-12-13 07:58:01,621 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:58:01,649 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:58:01,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-13 07:58:01,650 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 4670 transitions, 170412 flow [2022-12-13 07:58:01,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:01,650 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:58:01,650 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, 1, 1, 1] [2022-12-13 07:58:01,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 07:58:01,855 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,SelfDestructingSolverStorable16 [2022-12-13 07:58:01,855 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:58:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:58:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1303149668, now seen corresponding path program 4 times [2022-12-13 07:58:01,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:58:01,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330769926] [2022-12-13 07:58:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:58:01,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:58:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:58:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 07:58:02,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:58:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330769926] [2022-12-13 07:58:02,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330769926] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:58:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861679734] [2022-12-13 07:58:02,379 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:58:02,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:58:02,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:58:02,380 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 07:58:02,382 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 07:58:02,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:58:02,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:58:02,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 07:58:02,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:58:02,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 13 [2022-12-13 07:58:02,541 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-12-13 07:58:02,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-12-13 07:58:02,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:58:02,611 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 60 treesize of output 52 [2022-12-13 07:58:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 07:58:02,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:58:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 07:58:02,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861679734] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:58:02,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:58:02,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 10] total 22 [2022-12-13 07:58:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58535132] [2022-12-13 07:58:02,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:58:02,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:58:02,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:58:02,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:58:02,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:58:02,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-13 07:58:02,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 4670 transitions, 170412 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:02,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:58:02,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-13 07:58:02,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:58:36,818 INFO L130 PetriNetUnfolder]: 32356/45156 cut-off events. [2022-12-13 07:58:36,818 INFO L131 PetriNetUnfolder]: For 164794/164794 co-relation queries the response was YES. [2022-12-13 07:58:36,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850205 conditions, 45156 events. 32356/45156 cut-off events. For 164794/164794 co-relation queries the response was YES. Maximal size of possible extension queue 1502. Compared 272277 event pairs, 80 based on Foata normal form. 6/36095 useless extension candidates. Maximal degree in co-relation 825973. Up to 45157 conditions per place. [2022-12-13 07:58:37,210 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 4686 selfloop transitions, 521 changer transitions 562/5774 dead transitions. [2022-12-13 07:58:37,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 5774 transitions, 222264 flow [2022-12-13 07:58:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:58:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:58:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2022-12-13 07:58:37,211 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2022-12-13 07:58:37,211 INFO L295 CegarLoopForPetriNet]: 40 programPoint places, 94 predicate places. [2022-12-13 07:58:37,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 5774 transitions, 222264 flow [2022-12-13 07:58:37,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 5212 transitions, 200632 flow [2022-12-13 07:58:38,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:58:38,043 INFO L89 Accepts]: Start accepts. Operand has 132 places, 5212 transitions, 200632 flow [2022-12-13 07:58:38,089 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:58:38,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:58:38,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 5212 transitions, 200632 flow [2022-12-13 07:58:38,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 5212 transitions, 200632 flow [2022-12-13 07:58:38,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:58:38,269 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:58:38,269 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-13 07:58:38,269 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 5212 transitions, 200632 flow [2022-12-13 07:58:38,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:38,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:58:38,270 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, 1, 1, 1] [2022-12-13 07:58:38,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 07:58:38,476 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,SelfDestructingSolverStorable17 [2022-12-13 07:58:38,476 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:58:38,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:58:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash -963956642, now seen corresponding path program 5 times [2022-12-13 07:58:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:58:38,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751746583] [2022-12-13 07:58:38,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:58:38,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:58:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:58:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 07:58:38,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:58:38,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751746583] [2022-12-13 07:58:38,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751746583] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:58:38,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142166815] [2022-12-13 07:58:38,987 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:58:38,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:58:38,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:58:38,989 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:58:38,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 07:58:39,123 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-13 07:58:39,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:58:39,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 07:58:39,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:58:39,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-13 07:58:39,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:58:39,323 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-12-13 07:58:39,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 45 [2022-12-13 07:58:39,346 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 16 treesize of output 8 [2022-12-13 07:58:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 07:58:39,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:58:51,507 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 57 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:59:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 07:59:03,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142166815] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:59:03,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:59:03,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 25 [2022-12-13 07:59:03,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425551716] [2022-12-13 07:59:03,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:59:03,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 07:59:03,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:59:03,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 07:59:03,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=531, Unknown=5, NotChecked=0, Total=650 [2022-12-13 07:59:03,761 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 07:59:03,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 5212 transitions, 200632 flow. Second operand has 26 states, 25 states have (on average 3.32) internal successors, (83), 26 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 07:59:03,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:59:03,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 07:59:03,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:59:08,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:10,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:12,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:14,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:16,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:18,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:20,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:22,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:24,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:33,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:35,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:37,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:42,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:44,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:46,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:48,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:50,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:52,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:54,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:56,750 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|))) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse6 (+ .cse10 c_~A~0.offset))) (let ((.cse5 (select .cse0 .cse6)) (.cse7 (+ 1 |c_thread3Thread1of1ForFork0_~i~2#1|))) (and (<= c_~min~0 (+ (select .cse0 c_~A~0.offset) 1)) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_78| Int)) (or (forall ((v_ArrVal_1114 Int)) (let ((.cse4 (store .cse0 .cse6 v_ArrVal_1114))) (let ((.cse1 (select .cse4 c_~A~0.offset))) (or (forall ((v_ArrVal_1115 Int)) (let ((.cse3 (select (store .cse4 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_78| 4)) v_ArrVal_1115) c_~A~0.offset))) (or (forall ((v_subst_3 Int)) (let ((.cse2 (select .cse4 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< .cse1 .cse2) (< .cse2 (+ 2 .cse3))))) (< 2147483646 .cse3)))) (not (<= (+ v_ArrVal_1114 1) .cse5)) (< c_~min~0 .cse1))))) (not (<= .cse7 |v_thread3Thread1of1ForFork0_~i~2#1_78|)))) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_78| Int)) (or (forall ((v_ArrVal_1114 Int)) (let ((.cse9 (store .cse0 .cse6 v_ArrVal_1114))) (or (not (<= (+ v_ArrVal_1114 1) .cse5)) (forall ((v_ArrVal_1115 Int)) (let ((.cse8 (select (store .cse9 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_78| 4)) v_ArrVal_1115) c_~A~0.offset))) (or (< 2147483646 .cse8) (< c_~min~0 (+ 2 .cse8))))) (not (< c_~min~0 (select .cse9 c_~A~0.offset)))))) (not (<= .cse7 |v_thread3Thread1of1ForFork0_~i~2#1_78|)))) (not (= .cse10 0)))))) is different from false [2022-12-13 07:59:58,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:00,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:02,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:04,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:06,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:09,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:11,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:13,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:15,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:17,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:27,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:29,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:49,337 WARN L233 SmtUtils]: Spent 16.15s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 08:00:51,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:53,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:55,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:57,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:00:59,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:01:01,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:01:03,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:01:06,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:01:20,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:01:46,493 WARN L233 SmtUtils]: Spent 18.26s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 08:01:48,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:01:50,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:01:52,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:01:54,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:01:56,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:01:58,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:02:00,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:02:02,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:02:04,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:02:22,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:02:49,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:02:51,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:02:53,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:02:55,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:02:57,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:02:59,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:03:01,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:03:03,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:03:05,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:03:07,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:03:09,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:03:11,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:03:45,530 WARN L233 SmtUtils]: Spent 32.17s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 08:03:51,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:03:53,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:03:55,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:03:58,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:04:00,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:04:02,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:04:04,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:04:06,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:04:08,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:04:10,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:04:12,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:04:50,589 WARN L233 SmtUtils]: Spent 30.12s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 08:04:52,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:04:54,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:04:56,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:04:58,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:05:00,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 08:05:01,635 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-13 08:05:01,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-12-13 08:05:01,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 08:05:01,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:05:01,840 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:499) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 37 more [2022-12-13 08:05:01,843 INFO L158 Benchmark]: Toolchain (without parser) took 808843.20ms. Allocated memory was 184.5MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 160.9MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 08:05:01,843 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:05:01,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.64ms. Allocated memory is still 184.5MB. Free memory was 160.7MB in the beginning and 146.8MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 08:05:01,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.57ms. Allocated memory is still 184.5MB. Free memory was 146.8MB in the beginning and 144.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:05:01,843 INFO L158 Benchmark]: Boogie Preprocessor took 32.63ms. Allocated memory is still 184.5MB. Free memory was 144.7MB in the beginning and 143.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:05:01,843 INFO L158 Benchmark]: RCFGBuilder took 501.76ms. Allocated memory is still 184.5MB. Free memory was 143.1MB in the beginning and 119.5MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 08:05:01,844 INFO L158 Benchmark]: TraceAbstraction took 807993.38ms. Allocated memory was 184.5MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 118.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-13 08:05:01,844 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.64ms. Allocated memory is still 184.5MB. Free memory was 160.7MB in the beginning and 146.8MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.57ms. Allocated memory is still 184.5MB. Free memory was 146.8MB in the beginning and 144.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.63ms. Allocated memory is still 184.5MB. Free memory was 144.7MB in the beginning and 143.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 501.76ms. Allocated memory is still 184.5MB. Free memory was 143.1MB in the beginning and 119.5MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 807993.38ms. Allocated memory was 184.5MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 118.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 145 PlacesBefore, 40 PlacesAfterwards, 144 TransitionsBefore, 31 TransitionsAfterwards, 2280 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 66 TrivialYvCompositions, 39 ConcurrentYvCompositions, 8 ChoiceCompositions, 113 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1331, independent: 1309, independent conditional: 1309, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1331, independent: 1309, independent conditional: 0, independent unconditional: 1309, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1331, independent: 1309, independent conditional: 0, independent unconditional: 1309, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1331, independent: 1309, independent conditional: 0, independent unconditional: 1309, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1267, independent: 1249, independent conditional: 0, independent unconditional: 1249, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1267, independent: 1249, independent conditional: 0, independent unconditional: 1249, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1331, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 1267, unknown conditional: 0, unknown unconditional: 1267] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 2012, Positive conditional cache size: 0, Positive unconditional cache size: 2012, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 51 PlacesBefore, 50 PlacesAfterwards, 118 TransitionsBefore, 117 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 952 TransitionsBefore, 952 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 711 TransitionsBefore, 711 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 1649 TransitionsBefore, 1649 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 92 PlacesBefore, 91 PlacesAfterwards, 2799 TransitionsBefore, 2798 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 3926 TransitionsBefore, 3926 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 6375 TransitionsBefore, 6375 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 117 PlacesBefore, 117 PlacesAfterwards, 5625 TransitionsBefore, 5625 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 133 PlacesBefore, 133 PlacesAfterwards, 6612 TransitionsBefore, 6612 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 124 PlacesBefore, 124 PlacesAfterwards, 3791 TransitionsBefore, 3791 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 115 PlacesBefore, 114 PlacesAfterwards, 2583 TransitionsBefore, 2582 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 118 PlacesBefore, 118 PlacesAfterwards, 3298 TransitionsBefore, 3298 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 122 PlacesBefore, 122 PlacesAfterwards, 4281 TransitionsBefore, 4281 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 126 PlacesBefore, 126 PlacesAfterwards, 4670 TransitionsBefore, 4670 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 132 PlacesBefore, 132 PlacesAfterwards, 5212 TransitionsBefore, 5212 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...