/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:33:12,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:33:12,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:33:12,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:33:12,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:33:12,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:33:12,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:33:12,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:33:12,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:33:12,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:33:12,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:33:12,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:33:12,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:33:12,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:33:12,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:33:12,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:33:12,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:33:12,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:33:12,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:33:12,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:33:12,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:33:12,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:33:12,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:33:12,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:33:12,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:33:12,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:33:12,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:33:12,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:33:12,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:33:12,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:33:12,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:33:12,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:33:12,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:33:12,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:33:12,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:33:12,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:33:12,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:33:12,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:33:12,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:33:12,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:33:12,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:33:12,153 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:33:12,180 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:33:12,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:33:12,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:33:12,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:33:12,182 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:33:12,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:33:12,183 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:33:12,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:33:12,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:33:12,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:33:12,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:33:12,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:33:12,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:33:12,184 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:33:12,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:33:12,184 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:33:12,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:33:12,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:33:12,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:33:12,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:33:12,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:33:12,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:33:12,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:33:12,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:33:12,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:33:12,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:33:12,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:33:12,185 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:33:12,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:33:12,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:33:12,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:33:12,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:33:12,511 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:33:12,519 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:33:12,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2022-12-06 07:33:13,609 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:33:13,830 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:33:13,830 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2022-12-06 07:33:13,834 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce41f5fea/287d5045d59041289448110e8bf9a69e/FLAG534f06916 [2022-12-06 07:33:13,845 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce41f5fea/287d5045d59041289448110e8bf9a69e [2022-12-06 07:33:13,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:33:13,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:33:13,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:33:13,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:33:13,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:33:13,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:33:13" (1/1) ... [2022-12-06 07:33:13,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2d76da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:13, skipping insertion in model container [2022-12-06 07:33:13,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:33:13" (1/1) ... [2022-12-06 07:33:13,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:33:13,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:33:14,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,038 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2022-12-06 07:33:14,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:33:14,055 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:33:14,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:33:14,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:33:14,094 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2022-12-06 07:33:14,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:33:14,105 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:33:14,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14 WrapperNode [2022-12-06 07:33:14,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:33:14,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:33:14,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:33:14,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:33:14,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14" (1/1) ... [2022-12-06 07:33:14,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14" (1/1) ... [2022-12-06 07:33:14,147 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 336 [2022-12-06 07:33:14,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:33:14,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:33:14,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:33:14,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:33:14,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14" (1/1) ... [2022-12-06 07:33:14,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14" (1/1) ... [2022-12-06 07:33:14,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14" (1/1) ... [2022-12-06 07:33:14,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14" (1/1) ... [2022-12-06 07:33:14,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14" (1/1) ... [2022-12-06 07:33:14,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14" (1/1) ... [2022-12-06 07:33:14,191 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14" (1/1) ... [2022-12-06 07:33:14,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14" (1/1) ... [2022-12-06 07:33:14,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:33:14,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:33:14,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:33:14,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:33:14,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14" (1/1) ... [2022-12-06 07:33:14,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:33:14,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:33:14,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:33:14,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:33:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:33:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:33:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:33:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:33:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:33:14,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:33:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:33:14,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:33:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:33:14,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:33:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:33:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:33:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:33:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:33:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:33:14,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:33:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:33:14,276 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:33:14,403 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:33:14,404 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:33:14,716 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:33:14,798 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:33:14,799 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 07:33:14,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:33:14 BoogieIcfgContainer [2022-12-06 07:33:14,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:33:14,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:33:14,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:33:14,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:33:14,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:33:13" (1/3) ... [2022-12-06 07:33:14,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd36f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:33:14, skipping insertion in model container [2022-12-06 07:33:14,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:33:14" (2/3) ... [2022-12-06 07:33:14,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd36f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:33:14, skipping insertion in model container [2022-12-06 07:33:14,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:33:14" (3/3) ... [2022-12-06 07:33:14,806 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2022-12-06 07:33:14,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:33:14,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:33:14,817 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:33:14,870 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:33:14,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 253 transitions, 530 flow [2022-12-06 07:33:15,004 INFO L130 PetriNetUnfolder]: 27/250 cut-off events. [2022-12-06 07:33:15,004 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:33:15,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 27/250 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 176 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 211. Up to 6 conditions per place. [2022-12-06 07:33:15,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 253 transitions, 530 flow [2022-12-06 07:33:15,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 240 transitions, 498 flow [2022-12-06 07:33:15,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:15,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 240 transitions, 498 flow [2022-12-06 07:33:15,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 240 transitions, 498 flow [2022-12-06 07:33:15,086 INFO L130 PetriNetUnfolder]: 27/240 cut-off events. [2022-12-06 07:33:15,087 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:33:15,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 240 events. 27/240 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 176 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 211. Up to 6 conditions per place. [2022-12-06 07:33:15,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 240 transitions, 498 flow [2022-12-06 07:33:15,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 2442 [2022-12-06 07:33:23,936 INFO L203 LiptonReduction]: Total number of compositions: 210 [2022-12-06 07:33:23,946 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:33:23,951 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;@f8efa12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:33:23,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:33:23,958 INFO L130 PetriNetUnfolder]: 6/24 cut-off events. [2022-12-06 07:33:23,958 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:33:23,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:23,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:23,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:23,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:23,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1929606784, now seen corresponding path program 1 times [2022-12-06 07:33:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:23,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230002192] [2022-12-06 07:33:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:24,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:24,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230002192] [2022-12-06 07:33:24,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230002192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:24,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:24,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:33:24,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651643900] [2022-12-06 07:33:24,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:24,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:33:24,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:24,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:33:24,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:33:24,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:33:24,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 68 flow. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:24,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:33:24,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:24,647 INFO L130 PetriNetUnfolder]: 164/251 cut-off events. [2022-12-06 07:33:24,647 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-06 07:33:24,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 251 events. 164/251 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 607 event pairs, 37 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 376. Up to 167 conditions per place. [2022-12-06 07:33:24,650 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 36 selfloop transitions, 4 changer transitions 1/41 dead transitions. [2022-12-06 07:33:24,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 197 flow [2022-12-06 07:33:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:33:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:33:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 07:33:24,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 07:33:24,660 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 68 flow. Second operand 3 states and 42 transitions. [2022-12-06 07:33:24,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 41 transitions, 197 flow [2022-12-06 07:33:24,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 41 transitions, 175 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:33:24,666 INFO L231 Difference]: Finished difference. Result has 26 places, 28 transitions, 82 flow [2022-12-06 07:33:24,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=28} [2022-12-06 07:33:24,673 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2022-12-06 07:33:24,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:24,674 INFO L89 Accepts]: Start accepts. Operand has 26 places, 28 transitions, 82 flow [2022-12-06 07:33:24,676 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:24,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:24,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 28 transitions, 82 flow [2022-12-06 07:33:24,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 28 transitions, 82 flow [2022-12-06 07:33:24,691 INFO L130 PetriNetUnfolder]: 14/44 cut-off events. [2022-12-06 07:33:24,691 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:33:24,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 44 events. 14/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 33. Up to 14 conditions per place. [2022-12-06 07:33:24,693 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 28 transitions, 82 flow [2022-12-06 07:33:24,693 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 07:33:24,695 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:33:24,696 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 07:33:24,696 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 28 transitions, 82 flow [2022-12-06 07:33:24,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:24,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:24,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:33:24,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:24,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash 495866599, now seen corresponding path program 1 times [2022-12-06 07:33:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:24,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418545536] [2022-12-06 07:33:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:24,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:24,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418545536] [2022-12-06 07:33:24,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418545536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:24,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:24,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:33:24,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001547506] [2022-12-06 07:33:24,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:24,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:24,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:24,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:24,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:24,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:33:24,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 28 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:24,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:24,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:33:24,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:25,137 INFO L130 PetriNetUnfolder]: 299/473 cut-off events. [2022-12-06 07:33:25,138 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-06 07:33:25,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 473 events. 299/473 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1380 event pairs, 174 based on Foata normal form. 28/495 useless extension candidates. Maximal degree in co-relation 350. Up to 252 conditions per place. [2022-12-06 07:33:25,139 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2022-12-06 07:33:25,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 53 transitions, 256 flow [2022-12-06 07:33:25,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 07:33:25,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49 [2022-12-06 07:33:25,152 INFO L175 Difference]: Start difference. First operand has 26 places, 28 transitions, 82 flow. Second operand 4 states and 49 transitions. [2022-12-06 07:33:25,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 53 transitions, 256 flow [2022-12-06 07:33:25,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 53 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:33:25,154 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 100 flow [2022-12-06 07:33:25,154 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2022-12-06 07:33:25,155 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2022-12-06 07:33:25,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:25,155 INFO L89 Accepts]: Start accepts. Operand has 30 places, 30 transitions, 100 flow [2022-12-06 07:33:25,155 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:25,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:25,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 30 transitions, 100 flow [2022-12-06 07:33:25,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 30 transitions, 100 flow [2022-12-06 07:33:25,165 INFO L130 PetriNetUnfolder]: 21/79 cut-off events. [2022-12-06 07:33:25,165 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:33:25,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 79 events. 21/79 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 199 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 65. Up to 21 conditions per place. [2022-12-06 07:33:25,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 30 transitions, 100 flow [2022-12-06 07:33:25,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-06 07:33:28,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:29,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3845 [2022-12-06 07:33:29,000 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 106 flow [2022-12-06 07:33:29,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:29,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:29,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:33:29,001 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:29,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:29,001 INFO L85 PathProgramCache]: Analyzing trace with hash 241586444, now seen corresponding path program 1 times [2022-12-06 07:33:29,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:29,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230749379] [2022-12-06 07:33:29,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:29,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:29,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:29,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230749379] [2022-12-06 07:33:29,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230749379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:29,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:29,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:33:29,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567783736] [2022-12-06 07:33:29,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:29,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:33:29,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:29,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:33:29,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:33:29,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 07:33:29,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:29,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 07:33:29,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:29,356 INFO L130 PetriNetUnfolder]: 263/429 cut-off events. [2022-12-06 07:33:29,356 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-06 07:33:29,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 429 events. 263/429 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1378 event pairs, 74 based on Foata normal form. 28/451 useless extension candidates. Maximal degree in co-relation 570. Up to 261 conditions per place. [2022-12-06 07:33:29,358 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 34 selfloop transitions, 4 changer transitions 2/40 dead transitions. [2022-12-06 07:33:29,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 208 flow [2022-12-06 07:33:29,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:33:29,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:33:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 07:33:29,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2022-12-06 07:33:29,360 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 106 flow. Second operand 3 states and 41 transitions. [2022-12-06 07:33:29,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 208 flow [2022-12-06 07:33:29,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 200 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 07:33:29,363 INFO L231 Difference]: Finished difference. Result has 31 places, 28 transitions, 96 flow [2022-12-06 07:33:29,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=31, PETRI_TRANSITIONS=28} [2022-12-06 07:33:29,364 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-06 07:33:29,364 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:29,364 INFO L89 Accepts]: Start accepts. Operand has 31 places, 28 transitions, 96 flow [2022-12-06 07:33:29,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:29,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:29,366 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 28 transitions, 96 flow [2022-12-06 07:33:29,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 96 flow [2022-12-06 07:33:29,372 INFO L130 PetriNetUnfolder]: 14/63 cut-off events. [2022-12-06 07:33:29,373 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 07:33:29,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 63 events. 14/63 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 128 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 50. Up to 14 conditions per place. [2022-12-06 07:33:29,376 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 28 transitions, 96 flow [2022-12-06 07:33:29,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 07:33:29,377 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:33:29,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:33:29,378 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 96 flow [2022-12-06 07:33:29,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:29,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:29,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:33:29,379 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:29,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash 21755367, now seen corresponding path program 1 times [2022-12-06 07:33:29,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:29,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680006944] [2022-12-06 07:33:29,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:29,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:29,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:29,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680006944] [2022-12-06 07:33:29,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680006944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:29,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:29,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:33:29,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678426629] [2022-12-06 07:33:29,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:29,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:29,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:29,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:29,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:29,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:33:29,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:29,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:33:29,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:29,637 INFO L130 PetriNetUnfolder]: 261/440 cut-off events. [2022-12-06 07:33:29,637 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2022-12-06 07:33:29,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 440 events. 261/440 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1365 event pairs, 114 based on Foata normal form. 44/479 useless extension candidates. Maximal degree in co-relation 892. Up to 252 conditions per place. [2022-12-06 07:33:29,639 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 48 selfloop transitions, 3 changer transitions 1/52 dead transitions. [2022-12-06 07:33:29,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 52 transitions, 268 flow [2022-12-06 07:33:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 07:33:29,640 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:33:29,640 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 96 flow. Second operand 4 states and 52 transitions. [2022-12-06 07:33:29,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 52 transitions, 268 flow [2022-12-06 07:33:29,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 52 transitions, 252 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:29,641 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 96 flow [2022-12-06 07:33:29,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-12-06 07:33:29,642 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-06 07:33:29,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:29,642 INFO L89 Accepts]: Start accepts. Operand has 32 places, 28 transitions, 96 flow [2022-12-06 07:33:29,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:29,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:29,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 28 transitions, 96 flow [2022-12-06 07:33:29,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 96 flow [2022-12-06 07:33:29,681 INFO L130 PetriNetUnfolder]: 9/45 cut-off events. [2022-12-06 07:33:29,681 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 07:33:29,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 45 events. 9/45 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 49. Up to 13 conditions per place. [2022-12-06 07:33:29,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 28 transitions, 96 flow [2022-12-06 07:33:29,682 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 07:33:29,682 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:33:29,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 07:33:29,683 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 28 transitions, 96 flow [2022-12-06 07:33:29,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:29,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:29,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:29,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:33:29,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1267645155, now seen corresponding path program 1 times [2022-12-06 07:33:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:29,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899065492] [2022-12-06 07:33:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:29,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:29,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899065492] [2022-12-06 07:33:29,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899065492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:33:29,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862257266] [2022-12-06 07:33:29,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:29,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:33:29,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:33:29,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:33:29,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:33:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:29,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:33:29,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:33:30,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:30,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:33:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:30,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862257266] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:33:30,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:33:30,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2022-12-06 07:33:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241633736] [2022-12-06 07:33:30,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:33:30,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:33:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:30,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:33:30,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:33:30,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:33:30,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 96 flow. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:30,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:30,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:33:30,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:30,272 INFO L130 PetriNetUnfolder]: 270/434 cut-off events. [2022-12-06 07:33:30,272 INFO L131 PetriNetUnfolder]: For 228/228 co-relation queries the response was YES. [2022-12-06 07:33:30,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 434 events. 270/434 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1354 event pairs, 53 based on Foata normal form. 1/432 useless extension candidates. Maximal degree in co-relation 542. Up to 281 conditions per place. [2022-12-06 07:33:30,273 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 41 selfloop transitions, 4 changer transitions 3/48 dead transitions. [2022-12-06 07:33:30,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 48 transitions, 246 flow [2022-12-06 07:33:30,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 07:33:30,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47 [2022-12-06 07:33:30,274 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 96 flow. Second operand 4 states and 47 transitions. [2022-12-06 07:33:30,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 48 transitions, 246 flow [2022-12-06 07:33:30,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 242 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 07:33:30,276 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 121 flow [2022-12-06 07:33:30,276 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-06 07:33:30,276 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-06 07:33:30,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:30,277 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 121 flow [2022-12-06 07:33:30,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:30,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:30,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 121 flow [2022-12-06 07:33:30,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 121 flow [2022-12-06 07:33:30,292 INFO L130 PetriNetUnfolder]: 10/49 cut-off events. [2022-12-06 07:33:30,292 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 07:33:30,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 49 events. 10/49 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 47. Up to 15 conditions per place. [2022-12-06 07:33:30,292 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 121 flow [2022-12-06 07:33:30,292 INFO L188 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-06 07:33:30,294 WARN L322 ript$VariableManager]: TermVariable LBE552 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:30,294 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:30,294 WARN L322 ript$VariableManager]: TermVariable LBE250 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:30,295 WARN L322 ript$VariableManager]: TermVariable LBE617 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:30,295 WARN L322 ript$VariableManager]: TermVariable LBE604 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:30,295 WARN L322 ript$VariableManager]: TermVariable LBE218 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:31,008 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:31,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 733 [2022-12-06 07:33:31,009 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 122 flow [2022-12-06 07:33:31,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:31,009 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:31,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:33:31,210 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-06 07:33:31,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:31,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1139043018, now seen corresponding path program 1 times [2022-12-06 07:33:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:31,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976173081] [2022-12-06 07:33:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:31,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:31,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:31,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976173081] [2022-12-06 07:33:31,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976173081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:31,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:31,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:33:31,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576827526] [2022-12-06 07:33:31,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:31,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:31,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:31,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:31,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:31,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:33:31,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:31,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:31,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:33:31,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:31,688 INFO L130 PetriNetUnfolder]: 323/532 cut-off events. [2022-12-06 07:33:31,688 INFO L131 PetriNetUnfolder]: For 411/411 co-relation queries the response was YES. [2022-12-06 07:33:31,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 532 events. 323/532 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1813 event pairs, 158 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 817. Up to 449 conditions per place. [2022-12-06 07:33:31,690 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 40 selfloop transitions, 4 changer transitions 7/51 dead transitions. [2022-12-06 07:33:31,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 277 flow [2022-12-06 07:33:31,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:33:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:33:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 07:33:31,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-06 07:33:31,691 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 122 flow. Second operand 4 states and 48 transitions. [2022-12-06 07:33:31,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 277 flow [2022-12-06 07:33:31,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 266 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 07:33:31,693 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 143 flow [2022-12-06 07:33:31,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2022-12-06 07:33:31,694 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-06 07:33:31,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:31,694 INFO L89 Accepts]: Start accepts. Operand has 36 places, 33 transitions, 143 flow [2022-12-06 07:33:31,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:31,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:31,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 33 transitions, 143 flow [2022-12-06 07:33:31,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 33 transitions, 143 flow [2022-12-06 07:33:31,704 INFO L130 PetriNetUnfolder]: 13/70 cut-off events. [2022-12-06 07:33:31,704 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 07:33:31,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 70 events. 13/70 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 160 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 78. Up to 15 conditions per place. [2022-12-06 07:33:31,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 33 transitions, 143 flow [2022-12-06 07:33:31,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 07:33:35,304 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:35,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3611 [2022-12-06 07:33:35,305 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 153 flow [2022-12-06 07:33:35,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:35,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:35,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:35,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:33:35,305 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:35,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1666267141, now seen corresponding path program 1 times [2022-12-06 07:33:35,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:35,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127352377] [2022-12-06 07:33:35,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:35,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:35,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:35,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127352377] [2022-12-06 07:33:35,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127352377] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:33:35,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930424532] [2022-12-06 07:33:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:35,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:33:35,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:33:35,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:33:35,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:33:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:36,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-06 07:33:36,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:33:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:36,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:33:36,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:33:36,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 379 treesize of output 491 [2022-12-06 07:33:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:39,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930424532] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:33:39,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:33:39,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 07:33:39,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325426597] [2022-12-06 07:33:39,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:33:39,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:33:39,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:39,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:33:39,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:33:39,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:33:39,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 153 flow. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:39,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:39,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:33:39,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:39,747 INFO L130 PetriNetUnfolder]: 537/862 cut-off events. [2022-12-06 07:33:39,747 INFO L131 PetriNetUnfolder]: For 680/680 co-relation queries the response was YES. [2022-12-06 07:33:39,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 862 events. 537/862 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3317 event pairs, 96 based on Foata normal form. 3/859 useless extension candidates. Maximal degree in co-relation 1167. Up to 367 conditions per place. [2022-12-06 07:33:39,751 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 73 selfloop transitions, 17 changer transitions 25/115 dead transitions. [2022-12-06 07:33:39,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 115 transitions, 613 flow [2022-12-06 07:33:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:33:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:33:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2022-12-06 07:33:39,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2022-12-06 07:33:39,752 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 153 flow. Second operand 10 states and 116 transitions. [2022-12-06 07:33:39,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 115 transitions, 613 flow [2022-12-06 07:33:39,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 115 transitions, 604 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 07:33:39,754 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 256 flow [2022-12-06 07:33:39,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=256, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-06 07:33:39,755 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2022-12-06 07:33:39,755 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:39,755 INFO L89 Accepts]: Start accepts. Operand has 47 places, 42 transitions, 256 flow [2022-12-06 07:33:39,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:39,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:39,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 256 flow [2022-12-06 07:33:39,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 256 flow [2022-12-06 07:33:39,768 INFO L130 PetriNetUnfolder]: 19/99 cut-off events. [2022-12-06 07:33:39,768 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 07:33:39,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 99 events. 19/99 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 321 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 166. Up to 24 conditions per place. [2022-12-06 07:33:39,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 256 flow [2022-12-06 07:33:39,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 07:33:39,770 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:39,770 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:39,770 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:39,770 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:39,770 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:39,770 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:39,770 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:39,770 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:39,770 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:39,770 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:39,771 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:39,771 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:41,376 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:41,376 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:41,376 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:41,376 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:41,377 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:41,377 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:41,377 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:41,377 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:41,377 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:41,377 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:41,377 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:41,377 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:43,016 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:43,016 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:43,016 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:43,016 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:43,016 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:43,017 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:43,017 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:43,017 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:43,017 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:43,017 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:43,017 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:43,017 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:44,231 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:44,232 WARN L322 ript$VariableManager]: TermVariable LBE533 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:44,232 WARN L322 ript$VariableManager]: TermVariable LBE587 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:44,232 WARN L322 ript$VariableManager]: TermVariable LBE542 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:44,232 WARN L322 ript$VariableManager]: TermVariable LBE111 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:44,232 WARN L322 ript$VariableManager]: TermVariable LBE56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:44,232 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:44,232 WARN L322 ript$VariableManager]: TermVariable LBE44 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:44,232 WARN L322 ript$VariableManager]: TermVariable LBE99 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:44,232 WARN L322 ript$VariableManager]: TermVariable LBE76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:44,232 WARN L322 ript$VariableManager]: TermVariable LBE21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:44,232 WARN L322 ript$VariableManager]: TermVariable LBE590 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:33:46,647 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:33:46,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6894 [2022-12-06 07:33:46,649 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 273 flow [2022-12-06 07:33:46,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:46,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:46,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:46,653 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-06 07:33:46,853 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-06 07:33:46,854 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:46,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:46,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1520627378, now seen corresponding path program 1 times [2022-12-06 07:33:46,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:46,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526576216] [2022-12-06 07:33:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:47,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:47,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526576216] [2022-12-06 07:33:47,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526576216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:47,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:33:47,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:33:47,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270665415] [2022-12-06 07:33:47,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:47,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:33:47,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:47,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:33:47,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:33:47,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:33:47,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:47,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:33:47,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:47,169 INFO L130 PetriNetUnfolder]: 475/769 cut-off events. [2022-12-06 07:33:47,170 INFO L131 PetriNetUnfolder]: For 1348/1348 co-relation queries the response was YES. [2022-12-06 07:33:47,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 769 events. 475/769 cut-off events. For 1348/1348 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2903 event pairs, 160 based on Foata normal form. 14/771 useless extension candidates. Maximal degree in co-relation 2024. Up to 602 conditions per place. [2022-12-06 07:33:47,173 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 38 selfloop transitions, 4 changer transitions 7/49 dead transitions. [2022-12-06 07:33:47,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 374 flow [2022-12-06 07:33:47,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:33:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:33:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 07:33:47,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 07:33:47,174 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 273 flow. Second operand 3 states and 40 transitions. [2022-12-06 07:33:47,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 374 flow [2022-12-06 07:33:47,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 312 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-06 07:33:47,177 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 201 flow [2022-12-06 07:33:47,177 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2022-12-06 07:33:47,179 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-12-06 07:33:47,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:47,179 INFO L89 Accepts]: Start accepts. Operand has 41 places, 40 transitions, 201 flow [2022-12-06 07:33:47,179 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:47,180 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:47,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 40 transitions, 201 flow [2022-12-06 07:33:47,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 201 flow [2022-12-06 07:33:47,192 INFO L130 PetriNetUnfolder]: 17/93 cut-off events. [2022-12-06 07:33:47,192 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-12-06 07:33:47,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 93 events. 17/93 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 307 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 142. Up to 14 conditions per place. [2022-12-06 07:33:47,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 40 transitions, 201 flow [2022-12-06 07:33:47,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 07:33:47,194 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:33:47,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 07:33:47,196 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 201 flow [2022-12-06 07:33:47,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:47,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:47,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:33:47,196 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:47,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2132231823, now seen corresponding path program 1 times [2022-12-06 07:33:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:47,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458152488] [2022-12-06 07:33:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:47,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:47,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458152488] [2022-12-06 07:33:47,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458152488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:33:47,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641045027] [2022-12-06 07:33:47,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:47,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:33:47,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:33:47,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:33:47,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:33:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:47,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:33:47,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:33:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:33:47,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:33:47,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641045027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:33:47,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:33:47,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-12-06 07:33:47,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024755980] [2022-12-06 07:33:47,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:33:47,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:33:47,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:47,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:33:47,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:33:47,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:33:47,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:47,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:47,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:33:47,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:48,191 INFO L130 PetriNetUnfolder]: 647/1087 cut-off events. [2022-12-06 07:33:48,192 INFO L131 PetriNetUnfolder]: For 1012/1012 co-relation queries the response was YES. [2022-12-06 07:33:48,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 1087 events. 647/1087 cut-off events. For 1012/1012 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4649 event pairs, 324 based on Foata normal form. 24/1101 useless extension candidates. Maximal degree in co-relation 2716. Up to 480 conditions per place. [2022-12-06 07:33:48,195 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 44 selfloop transitions, 15 changer transitions 12/71 dead transitions. [2022-12-06 07:33:48,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 440 flow [2022-12-06 07:33:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:33:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:33:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-06 07:33:48,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2022-12-06 07:33:48,197 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 201 flow. Second operand 6 states and 63 transitions. [2022-12-06 07:33:48,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 440 flow [2022-12-06 07:33:48,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:33:48,200 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 266 flow [2022-12-06 07:33:48,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2022-12-06 07:33:48,201 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2022-12-06 07:33:48,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:48,201 INFO L89 Accepts]: Start accepts. Operand has 46 places, 46 transitions, 266 flow [2022-12-06 07:33:48,203 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:48,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:48,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 46 transitions, 266 flow [2022-12-06 07:33:48,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 266 flow [2022-12-06 07:33:48,219 INFO L130 PetriNetUnfolder]: 21/137 cut-off events. [2022-12-06 07:33:48,219 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-06 07:33:48,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 137 events. 21/137 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 589 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 235. Up to 14 conditions per place. [2022-12-06 07:33:48,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 46 transitions, 266 flow [2022-12-06 07:33:48,221 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-06 07:33:48,221 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:33:48,222 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 07:33:48,222 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 266 flow [2022-12-06 07:33:48,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:48,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:48,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:48,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:33:48,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:33:48,426 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:33:48,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:48,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1442573577, now seen corresponding path program 1 times [2022-12-06 07:33:48,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:48,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80290405] [2022-12-06 07:33:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:48,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:33:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:49,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80290405] [2022-12-06 07:33:49,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80290405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:33:49,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078314342] [2022-12-06 07:33:49,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:49,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:33:49,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:33:49,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:33:49,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:33:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:49,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:33:49,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:33:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:33:49,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:33:51,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:33:51,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 435 treesize of output 639 [2022-12-06 07:33:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:33:54,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078314342] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:33:54,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:33:54,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 07:33:54,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872477610] [2022-12-06 07:33:54,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:33:54,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:33:54,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:54,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:33:54,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:33:54,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:33:54,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 266 flow. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:33:54,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:54,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:33:54,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:55,261 INFO L130 PetriNetUnfolder]: 1168/1986 cut-off events. [2022-12-06 07:33:55,261 INFO L131 PetriNetUnfolder]: For 1741/1741 co-relation queries the response was YES. [2022-12-06 07:33:55,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5504 conditions, 1986 events. 1168/1986 cut-off events. For 1741/1741 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10349 event pairs, 330 based on Foata normal form. 16/1998 useless extension candidates. Maximal degree in co-relation 5125. Up to 337 conditions per place. [2022-12-06 07:33:55,272 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 97 selfloop transitions, 34 changer transitions 46/177 dead transitions. [2022-12-06 07:33:55,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 177 transitions, 1087 flow [2022-12-06 07:33:55,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:33:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:33:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2022-12-06 07:33:55,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41644562334217505 [2022-12-06 07:33:55,274 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 266 flow. Second operand 13 states and 157 transitions. [2022-12-06 07:33:55,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 177 transitions, 1087 flow [2022-12-06 07:33:55,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 177 transitions, 1065 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 07:33:55,280 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 489 flow [2022-12-06 07:33:55,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=489, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2022-12-06 07:33:55,281 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 30 predicate places. [2022-12-06 07:33:55,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:55,281 INFO L89 Accepts]: Start accepts. Operand has 59 places, 63 transitions, 489 flow [2022-12-06 07:33:55,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:55,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:55,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 63 transitions, 489 flow [2022-12-06 07:33:55,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 489 flow [2022-12-06 07:33:55,305 INFO L130 PetriNetUnfolder]: 32/240 cut-off events. [2022-12-06 07:33:55,305 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-06 07:33:55,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 240 events. 32/240 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1398 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 455. Up to 25 conditions per place. [2022-12-06 07:33:55,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 489 flow [2022-12-06 07:33:55,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 348 [2022-12-06 07:34:01,940 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:34:01,942 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6661 [2022-12-06 07:34:01,942 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 501 flow [2022-12-06 07:34:01,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:01,942 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:01,942 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:01,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:34:02,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:34:02,147 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:02,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1295621344, now seen corresponding path program 1 times [2022-12-06 07:34:02,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:02,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639622654] [2022-12-06 07:34:02,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:02,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:02,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:02,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639622654] [2022-12-06 07:34:02,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639622654] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:34:02,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624991025] [2022-12-06 07:34:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:02,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:34:02,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:34:02,374 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:34:02,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:34:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:02,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:34:02,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:34:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:02,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:34:03,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:34:03,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 557 treesize of output 648 [2022-12-06 07:34:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:34:04,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624991025] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:34:04,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:34:04,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 07:34:04,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195098303] [2022-12-06 07:34:04,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:34:04,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:34:04,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:04,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:34:04,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:34:04,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:34:04,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 501 flow. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:04,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:04,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:34:04,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:05,770 INFO L130 PetriNetUnfolder]: 1235/2142 cut-off events. [2022-12-06 07:34:05,770 INFO L131 PetriNetUnfolder]: For 3467/3467 co-relation queries the response was YES. [2022-12-06 07:34:05,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6234 conditions, 2142 events. 1235/2142 cut-off events. For 3467/3467 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11550 event pairs, 316 based on Foata normal form. 98/2235 useless extension candidates. Maximal degree in co-relation 5600. Up to 392 conditions per place. [2022-12-06 07:34:05,777 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 80 selfloop transitions, 30 changer transitions 32/142 dead transitions. [2022-12-06 07:34:05,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 142 transitions, 1018 flow [2022-12-06 07:34:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:34:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:34:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2022-12-06 07:34:05,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2022-12-06 07:34:05,778 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 501 flow. Second operand 11 states and 122 transitions. [2022-12-06 07:34:05,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 142 transitions, 1018 flow [2022-12-06 07:34:05,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 142 transitions, 991 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 07:34:05,786 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 559 flow [2022-12-06 07:34:05,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=559, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2022-12-06 07:34:05,787 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 42 predicate places. [2022-12-06 07:34:05,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:05,787 INFO L89 Accepts]: Start accepts. Operand has 71 places, 63 transitions, 559 flow [2022-12-06 07:34:05,787 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:05,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:05,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 63 transitions, 559 flow [2022-12-06 07:34:05,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 63 transitions, 559 flow [2022-12-06 07:34:05,812 INFO L130 PetriNetUnfolder]: 30/261 cut-off events. [2022-12-06 07:34:05,812 INFO L131 PetriNetUnfolder]: For 277/277 co-relation queries the response was YES. [2022-12-06 07:34:05,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 261 events. 30/261 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1612 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 517. Up to 27 conditions per place. [2022-12-06 07:34:05,814 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 63 transitions, 559 flow [2022-12-06 07:34:05,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-06 07:34:17,599 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:34:17,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11813 [2022-12-06 07:34:17,600 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 585 flow [2022-12-06 07:34:17,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:17,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:17,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:17,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 07:34:17,806 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,SelfDestructingSolverStorable10 [2022-12-06 07:34:17,806 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:17,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1434548131, now seen corresponding path program 1 times [2022-12-06 07:34:17,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:17,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792377292] [2022-12-06 07:34:17,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:17,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:34:18,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:18,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792377292] [2022-12-06 07:34:18,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792377292] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:34:18,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582475966] [2022-12-06 07:34:18,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:18,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:34:18,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:34:18,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:34:18,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:34:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:18,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:34:18,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:34:18,231 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-06 07:34:18,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:34:18,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582475966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:34:18,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:34:18,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-12-06 07:34:18,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75181381] [2022-12-06 07:34:18,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:34:18,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:34:18,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:18,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:34:18,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:34:18,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 07:34:18,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:18,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:18,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 07:34:18,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:18,511 INFO L130 PetriNetUnfolder]: 1261/2195 cut-off events. [2022-12-06 07:34:18,511 INFO L131 PetriNetUnfolder]: For 4415/4415 co-relation queries the response was YES. [2022-12-06 07:34:18,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6684 conditions, 2195 events. 1261/2195 cut-off events. For 4415/4415 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11904 event pairs, 1044 based on Foata normal form. 12/2202 useless extension candidates. Maximal degree in co-relation 5929. Up to 1977 conditions per place. [2022-12-06 07:34:18,520 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 54 selfloop transitions, 5 changer transitions 19/78 dead transitions. [2022-12-06 07:34:18,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 78 transitions, 783 flow [2022-12-06 07:34:18,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:34:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:34:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 07:34:18,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:34:18,521 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 585 flow. Second operand 3 states and 51 transitions. [2022-12-06 07:34:18,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 78 transitions, 783 flow [2022-12-06 07:34:18,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 721 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-06 07:34:18,531 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 498 flow [2022-12-06 07:34:18,531 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2022-12-06 07:34:18,532 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2022-12-06 07:34:18,532 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:18,532 INFO L89 Accepts]: Start accepts. Operand has 67 places, 59 transitions, 498 flow [2022-12-06 07:34:18,533 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:18,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:18,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 59 transitions, 498 flow [2022-12-06 07:34:18,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 59 transitions, 498 flow [2022-12-06 07:34:18,557 INFO L130 PetriNetUnfolder]: 29/236 cut-off events. [2022-12-06 07:34:18,557 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2022-12-06 07:34:18,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 236 events. 29/236 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1387 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 502. Up to 26 conditions per place. [2022-12-06 07:34:18,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 59 transitions, 498 flow [2022-12-06 07:34:18,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 07:34:18,559 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:34:18,559 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 07:34:18,559 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 498 flow [2022-12-06 07:34:18,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:18,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:18,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:18,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:34:18,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:34:18,765 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:18,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash 888802008, now seen corresponding path program 1 times [2022-12-06 07:34:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:18,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096204167] [2022-12-06 07:34:18,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:18,985 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-06 07:34:18,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:18,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096204167] [2022-12-06 07:34:18,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096204167] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:34:18,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315046409] [2022-12-06 07:34:18,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:18,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:34:18,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:34:19,000 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:34:19,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:34:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:19,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:34:19,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:34:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:34:19,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:34:19,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:34:19,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 589 treesize of output 624 [2022-12-06 07:34:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:34:20,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315046409] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:34:20,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:34:20,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-06 07:34:20,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970220646] [2022-12-06 07:34:20,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:34:20,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:34:20,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:20,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:34:20,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:34:20,116 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 07:34:20,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 498 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:20,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:20,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 07:34:20,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:20,421 INFO L130 PetriNetUnfolder]: 1102/1934 cut-off events. [2022-12-06 07:34:20,421 INFO L131 PetriNetUnfolder]: For 3831/3831 co-relation queries the response was YES. [2022-12-06 07:34:20,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5614 conditions, 1934 events. 1102/1934 cut-off events. For 3831/3831 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10244 event pairs, 491 based on Foata normal form. 48/1977 useless extension candidates. Maximal degree in co-relation 5573. Up to 605 conditions per place. [2022-12-06 07:34:20,428 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 52 selfloop transitions, 11 changer transitions 37/100 dead transitions. [2022-12-06 07:34:20,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 764 flow [2022-12-06 07:34:20,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:34:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:34:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 07:34:20,429 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2022-12-06 07:34:20,429 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 498 flow. Second operand 6 states and 81 transitions. [2022-12-06 07:34:20,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 764 flow [2022-12-06 07:34:20,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 727 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-06 07:34:20,436 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 335 flow [2022-12-06 07:34:20,436 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2022-12-06 07:34:20,436 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2022-12-06 07:34:20,436 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:20,436 INFO L89 Accepts]: Start accepts. Operand has 63 places, 47 transitions, 335 flow [2022-12-06 07:34:20,437 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:20,437 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:20,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 47 transitions, 335 flow [2022-12-06 07:34:20,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 335 flow [2022-12-06 07:34:20,453 INFO L130 PetriNetUnfolder]: 22/147 cut-off events. [2022-12-06 07:34:20,454 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-12-06 07:34:20,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 147 events. 22/147 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 643 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 298. Up to 23 conditions per place. [2022-12-06 07:34:20,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 335 flow [2022-12-06 07:34:20,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 07:34:24,574 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:34:24,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4139 [2022-12-06 07:34:24,575 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 336 flow [2022-12-06 07:34:24,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:34:24,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:34:24,582 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:34:24,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 07:34:24,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:34:24,787 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:34:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:34:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash -366559004, now seen corresponding path program 1 times [2022-12-06 07:34:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:34:24,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327028929] [2022-12-06 07:34:24,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:34:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:25,760 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-06 07:34:25,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:34:25,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327028929] [2022-12-06 07:34:25,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327028929] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:34:25,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638599913] [2022-12-06 07:34:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:34:25,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:34:25,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:34:25,762 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:34:25,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 07:34:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:34:25,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-06 07:34:25,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:34:25,920 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 26 treesize of output 24 [2022-12-06 07:34:25,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:34:25,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-12-06 07:34:25,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-12-06 07:34:25,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:34:26,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:34:26,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:34:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:34:26,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:34:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:34:33,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638599913] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:34:33,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:34:33,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2022-12-06 07:34:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279178278] [2022-12-06 07:34:33,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:34:33,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:34:33,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:34:33,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:34:33,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=230, Unknown=6, NotChecked=0, Total=306 [2022-12-06 07:34:33,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:34:33,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 336 flow. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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-06 07:34:33,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:34:33,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:34:33,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:34:51,738 WARN L233 SmtUtils]: Spent 18.20s on a formula simplification. DAG size of input: 285 DAG size of output: 260 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:34:52,614 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse48 (* c_~node_back~0 4))) (let ((.cse47 (* c_~node_front~0 4)) (.cse7 (= c_~node_state~0 0)) (.cse57 (select |c_#memory_int| c_~node~0.base)) (.cse15 (+ .cse48 c_~node~0.offset))) (let ((.cse6 (= c_~node_state~0 1)) (.cse50 (= c_~manager_state~0 1)) (.cse49 (= c_~manager_state~0 0)) (.cse51 (<= c_~node_size~0 c_~node_front~0)) (.cse52 (<= c_~node_back~0 c_~node_front~0)) (.cse54 (= 2 c_~manager_state~0)) (.cse53 (= 3 c_~manager_state~0)) (.cse26 (select .cse57 .cse15)) (.cse43 (not .cse7)) (.cse44 (< c_~node_front~0 0)) (.cse45 (<= (+ c_~node_back~0 1) c_~node_front~0)) (.cse56 (+ .cse47 c_~node~0.offset))) (let ((.cse4 (select |c_#memory_int| c_~client~0.base)) (.cse16 (or .cse43 .cse44 .cse45 (forall ((v_ArrVal_705 (Array Int Int))) (let ((.cse58 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~node~0.base))) (= (select .cse58 .cse56) (select .cse58 .cse15)))))) (.cse24 (or .cse43 .cse44 .cse45 (= .cse26 (select .cse57 .cse56)))) (.cse2 (select |c_#memory_int| c_~manager~0.base)) (.cse28 (or .cse43 .cse44 .cse45 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~node~0.base))) (= (select .cse55 .cse56) (select .cse55 .cse15)))))) (.cse0 (or .cse50 .cse49 (and (or .cse44 .cse51 .cse52) .cse7) .cse54 .cse53)) (.cse8 (not .cse54)) (.cse19 (not .cse53)) (.cse1 (or .cse43 .cse44 .cse51 .cse52)) (.cse5 (not .cse6)) (.cse20 (or .cse6 .cse7)) (.cse22 (not .cse50)) (.cse13 (not (< c_~node_back~0 c_~node_size~0))) (.cse17 (not .cse49)) (.cse18 (not (<= 0 c_~node_back~0)))) (and .cse0 (or (and .cse1 (or (forall ((~manager_back~0 Int) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse3 (select .cse4 (+ (* v_~client_back~0_170 4) ~client~0.offset)))) (or (= (select .cse2 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))) .cse3) (not (<= 1 v_~manager_front~0_185)) (not (= (select .cse2 (+ ~manager~0.offset (* ~manager_back~0 4))) .cse3)) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170))))) .cse5) (or .cse6 (forall ((v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (= (select .cse2 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))) (select .cse4 (+ (* v_~client_back~0_170 4) ~client~0.offset))) (not (<= 1 v_~manager_front~0_185)) (not (<= 0 v_~client_back~0_170)))) .cse7)) .cse8) (or (and .cse1 (or (forall ((~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (let ((.cse9 (select (select .cse11 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset))) (.cse10 (select .cse11 c_~manager~0.base))) (or (not (<= 1 v_~manager_front~0_185)) (= .cse9 (select .cse10 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))) (not (= .cse9 (select .cse10 (+ ~manager~0.offset (* ~manager_back~0 4))))) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170)))))) .cse5) (or .cse6 (forall ((v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse12 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset)) (select (select .cse12 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 0 v_~client_back~0_170)))) .cse7)) .cse8) (or .cse13 (and (or (forall ((v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse14 c_~node~0.base) .cse15) (select (select .cse14 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 1 v_~manager_front~0_185)))) .cse7) .cse16) .cse17 .cse18) (or .cse19 (and .cse1 .cse20 (or (forall ((~manager_back~0 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (< ~manager_back~0 1) (not (= (select .cse2 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse4 (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset)))) (not (<= 1 v_~client_back~0_170)))) .cse5))) (or .cse13 (and .cse16 (or (forall ((~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~manager~0.base))) (= (select .cse21 (+ ~manager~0.offset (* v_~manager_front~0_185 4))) (select .cse21 (+ ~manager~0.offset (* ~manager_back~0 4))))))) .cse5) .cse20) .cse22 .cse18) (or .cse19 (and .cse1 .cse20 (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse23 c_~client~0.base) (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset)) (select (select .cse23 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))) (< ~manager_back~0 1) (not (<= 1 v_~client_back~0_170)))) .cse5))) (or .cse13 .cse22 (and .cse24 .cse20 (or (forall ((~manager_back~0 Int) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (= (select .cse2 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse2 (+ ~manager~0.offset (* v_~manager_front~0_185 4)))) (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0))) .cse5)) .cse18) (or .cse19 (and .cse1 (or (forall ((~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (< ~manager_back~0 1) (not (<= 1 v_~client_back~0_170)) (not (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse25 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4))) (select (select .cse25 c_~client~0.base) (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset))))))) .cse5) .cse20)) (or .cse13 .cse17 (and .cse24 (or .cse7 (forall ((v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (= .cse26 (select .cse2 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))))))) .cse18) (= c_~safe~0 1) (or .cse13 .cse22 (and (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~manager~0.base))) (= (select .cse27 (+ ~manager~0.offset (* ~manager_back~0 4))) (select .cse27 (+ ~manager~0.offset (* v_~manager_front~0_185 4))))))) .cse5) .cse20 .cse28) .cse18) (or (and .cse1 (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (let ((.cse29 (select (select .cse31 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset))) (.cse30 (select .cse31 c_~manager~0.base))) (or (not (= .cse29 (select .cse30 (+ ~manager~0.offset (* ~manager_back~0 4))))) (not (<= 1 v_~manager_front~0_185)) (= .cse29 (select .cse30 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170)))))) .cse5) (or .cse6 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse32 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset)) (select (select .cse32 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 0 v_~client_back~0_170)))) .cse7)) .cse8) (or (and (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse33 c_~node~0.base) .cse15) (select (select .cse33 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))))) .cse7) .cse28) .cse13 .cse17 .cse18) (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse42 (+ .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse40 (or .cse43 .cse44 .cse45 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int))) (let ((.cse46 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (select .cse46 (+ .cse47 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse46 .cse42))))))) (and .cse0 (or (and .cse1 (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (let ((.cse34 (select (select .cse36 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset))) (.cse35 (select .cse36 c_~manager~0.base))) (or (not (<= 1 v_~manager_front~0_185)) (not (= .cse34 (select .cse35 (+ ~manager~0.offset (* ~manager_back~0 4))))) (= .cse34 (select .cse35 (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4)))) (not (< v_~manager_front~0_185 (+ ~manager_back~0 1))) (not (<= 0 v_~client_back~0_170)))))) .cse5) (or .cse6 (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse37 c_~client~0.base) (+ (* v_~client_back~0_170 4) ~client~0.offset)) (select (select .cse37 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))))) (not (<= 0 v_~client_back~0_170)))) .cse7)) .cse8) (or .cse19 (and .cse1 (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_705 (Array Int Int)) (~client~0.offset Int) (v_~client_back~0_170 Int) (~manager~0.offset Int)) (or (not (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse38 c_~client~0.base) (+ (* v_~client_back~0_170 4) (- 4) ~client~0.offset)) (select (select .cse38 c_~manager~0.base) (+ ~manager~0.offset (* ~manager_back~0 4)))))) (< ~manager_back~0 1) (not (<= 1 v_~client_back~0_170)))) .cse5) .cse20)) (or .cse13 (and (or (forall ((v_ArrVal_704 (Array Int Int)) (~manager_back~0 Int) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (<= ~manager_back~0 v_~manager_front~0_185) (< v_~manager_front~0_185 0) (let ((.cse39 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705) c_~manager~0.base))) (= (select .cse39 (+ ~manager~0.offset (* v_~manager_front~0_185 4))) (select .cse39 (+ ~manager~0.offset (* ~manager_back~0 4))))))) .cse5) .cse20 .cse40) .cse22 .cse18) (or .cse13 .cse17 (and (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_~manager_front~0_185 Int) (~manager~0.offset Int)) (or (not (<= 1 v_~manager_front~0_185)) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_705))) (= (select (select .cse41 c_~manager~0.base) (+ ~manager~0.offset (- 4) (* v_~manager_front~0_185 4))) (select (select .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse42))))) .cse7) .cse40) .cse18)))))))))) is different from false [2022-12-06 07:34:59,507 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 120 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:35:05,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:35:08,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:35:08,467 INFO L130 PetriNetUnfolder]: 1804/3045 cut-off events. [2022-12-06 07:35:08,467 INFO L131 PetriNetUnfolder]: For 5365/5365 co-relation queries the response was YES. [2022-12-06 07:35:08,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9348 conditions, 3045 events. 1804/3045 cut-off events. For 5365/5365 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 17241 event pairs, 413 based on Foata normal form. 6/3039 useless extension candidates. Maximal degree in co-relation 9276. Up to 1115 conditions per place. [2022-12-06 07:35:08,479 INFO L137 encePairwiseOnDemand]: 11/32 looper letters, 133 selfloop transitions, 57 changer transitions 61/251 dead transitions. [2022-12-06 07:35:08,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 251 transitions, 1640 flow [2022-12-06 07:35:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 07:35:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 07:35:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 234 transitions. [2022-12-06 07:35:08,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2925 [2022-12-06 07:35:08,482 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 336 flow. Second operand 25 states and 234 transitions. [2022-12-06 07:35:08,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 251 transitions, 1640 flow [2022-12-06 07:35:08,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 251 transitions, 1533 flow, removed 25 selfloop flow, removed 8 redundant places. [2022-12-06 07:35:08,495 INFO L231 Difference]: Finished difference. Result has 82 places, 96 transitions, 868 flow [2022-12-06 07:35:08,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=868, PETRI_PLACES=82, PETRI_TRANSITIONS=96} [2022-12-06 07:35:08,496 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2022-12-06 07:35:08,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:08,496 INFO L89 Accepts]: Start accepts. Operand has 82 places, 96 transitions, 868 flow [2022-12-06 07:35:08,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:08,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:08,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 96 transitions, 868 flow [2022-12-06 07:35:08,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 96 transitions, 868 flow [2022-12-06 07:35:08,535 INFO L130 PetriNetUnfolder]: 54/359 cut-off events. [2022-12-06 07:35:08,535 INFO L131 PetriNetUnfolder]: For 352/352 co-relation queries the response was YES. [2022-12-06 07:35:08,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 359 events. 54/359 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2406 event pairs, 7 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 821. Up to 54 conditions per place. [2022-12-06 07:35:08,537 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 96 transitions, 868 flow [2022-12-06 07:35:08,537 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 07:35:30,489 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:35:30,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21993 [2022-12-06 07:35:30,489 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 96 transitions, 904 flow [2022-12-06 07:35:30,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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-06 07:35:30,490 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:30,490 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:30,495 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-06 07:35:30,690 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-06 07:35:30,690 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash -731742440, now seen corresponding path program 1 times [2022-12-06 07:35:30,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:30,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140281846] [2022-12-06 07:35:30,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:31,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:31,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140281846] [2022-12-06 07:35:31,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140281846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:31,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109700932] [2022-12-06 07:35:31,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:31,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:31,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:31,177 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:31,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 07:35:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:31,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 07:35:31,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:35:31,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:35:31,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:35:31,750 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 291 treesize of output 301 [2022-12-06 07:35:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:35:31,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109700932] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:35:31,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:35:31,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-12-06 07:35:31,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417032529] [2022-12-06 07:35:31,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:35:31,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:35:31,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:31,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:35:31,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:35:31,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:35:31,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 96 transitions, 904 flow. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:31,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:31,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:35:31,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:32,737 INFO L130 PetriNetUnfolder]: 2287/3927 cut-off events. [2022-12-06 07:35:32,738 INFO L131 PetriNetUnfolder]: For 9696/9696 co-relation queries the response was YES. [2022-12-06 07:35:32,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13004 conditions, 3927 events. 2287/3927 cut-off events. For 9696/9696 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 23629 event pairs, 424 based on Foata normal form. 168/4081 useless extension candidates. Maximal degree in co-relation 11634. Up to 714 conditions per place. [2022-12-06 07:35:32,786 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 134 selfloop transitions, 50 changer transitions 29/213 dead transitions. [2022-12-06 07:35:32,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 213 transitions, 1810 flow [2022-12-06 07:35:32,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 07:35:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 07:35:32,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2022-12-06 07:35:32,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3504273504273504 [2022-12-06 07:35:32,788 INFO L175 Difference]: Start difference. First operand has 82 places, 96 transitions, 904 flow. Second operand 12 states and 164 transitions. [2022-12-06 07:35:32,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 213 transitions, 1810 flow [2022-12-06 07:35:32,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 213 transitions, 1734 flow, removed 26 selfloop flow, removed 1 redundant places. [2022-12-06 07:35:32,823 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 1045 flow [2022-12-06 07:35:32,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1045, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2022-12-06 07:35:32,823 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2022-12-06 07:35:32,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:32,823 INFO L89 Accepts]: Start accepts. Operand has 98 places, 99 transitions, 1045 flow [2022-12-06 07:35:32,826 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:32,827 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:32,827 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 99 transitions, 1045 flow [2022-12-06 07:35:32,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 99 transitions, 1045 flow [2022-12-06 07:35:32,927 INFO L130 PetriNetUnfolder]: 59/524 cut-off events. [2022-12-06 07:35:32,927 INFO L131 PetriNetUnfolder]: For 821/821 co-relation queries the response was YES. [2022-12-06 07:35:32,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 524 events. 59/524 cut-off events. For 821/821 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4166 event pairs, 8 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 1354. Up to 83 conditions per place. [2022-12-06 07:35:32,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 99 transitions, 1045 flow [2022-12-06 07:35:32,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-06 07:35:32,931 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:32,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-06 07:35:32,931 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 99 transitions, 1045 flow [2022-12-06 07:35:32,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:32,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:32,931 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:32,937 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-06 07:35:33,137 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-06 07:35:33,137 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:33,137 INFO L85 PathProgramCache]: Analyzing trace with hash 862727906, now seen corresponding path program 1 times [2022-12-06 07:35:33,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:33,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206142819] [2022-12-06 07:35:33,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:33,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:33,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:33,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206142819] [2022-12-06 07:35:33,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206142819] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:33,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835930031] [2022-12-06 07:35:33,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:33,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:33,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:33,837 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:33,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 07:35:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:34,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:35:34,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:34,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:35:35,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:35:35,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 446 treesize of output 625 [2022-12-06 07:35:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:40,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835930031] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:35:40,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:35:40,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-06 07:35:40,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88150155] [2022-12-06 07:35:40,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:35:40,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:35:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:40,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:35:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:35:40,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 07:35:40,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 99 transitions, 1045 flow. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:40,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:40,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 07:35:40,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:41,304 INFO L130 PetriNetUnfolder]: 2682/4621 cut-off events. [2022-12-06 07:35:41,304 INFO L131 PetriNetUnfolder]: For 14046/14046 co-relation queries the response was YES. [2022-12-06 07:35:41,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16312 conditions, 4621 events. 2682/4621 cut-off events. For 14046/14046 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 28874 event pairs, 631 based on Foata normal form. 6/4614 useless extension candidates. Maximal degree in co-relation 16280. Up to 1849 conditions per place. [2022-12-06 07:35:41,322 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 95 selfloop transitions, 55 changer transitions 32/182 dead transitions. [2022-12-06 07:35:41,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 182 transitions, 1804 flow [2022-12-06 07:35:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:35:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:35:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-12-06 07:35:41,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33641975308641975 [2022-12-06 07:35:41,323 INFO L175 Difference]: Start difference. First operand has 95 places, 99 transitions, 1045 flow. Second operand 9 states and 109 transitions. [2022-12-06 07:35:41,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 182 transitions, 1804 flow [2022-12-06 07:35:41,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 182 transitions, 1744 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 07:35:41,367 INFO L231 Difference]: Finished difference. Result has 101 places, 113 transitions, 1330 flow [2022-12-06 07:35:41,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1330, PETRI_PLACES=101, PETRI_TRANSITIONS=113} [2022-12-06 07:35:41,367 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 72 predicate places. [2022-12-06 07:35:41,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:41,367 INFO L89 Accepts]: Start accepts. Operand has 101 places, 113 transitions, 1330 flow [2022-12-06 07:35:41,368 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:41,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:41,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 113 transitions, 1330 flow [2022-12-06 07:35:41,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 113 transitions, 1330 flow [2022-12-06 07:35:41,432 INFO L130 PetriNetUnfolder]: 70/639 cut-off events. [2022-12-06 07:35:41,432 INFO L131 PetriNetUnfolder]: For 1212/1212 co-relation queries the response was YES. [2022-12-06 07:35:41,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 639 events. 70/639 cut-off events. For 1212/1212 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5469 event pairs, 11 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 1523. Up to 84 conditions per place. [2022-12-06 07:35:41,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 113 transitions, 1330 flow [2022-12-06 07:35:41,437 INFO L188 LiptonReduction]: Number of co-enabled transitions 670 [2022-12-06 07:35:41,438 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:41,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 07:35:41,439 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 113 transitions, 1330 flow [2022-12-06 07:35:41,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:41,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:41,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:41,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 07:35:41,645 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-06 07:35:41,645 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:35:41,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:41,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1980893660, now seen corresponding path program 1 times [2022-12-06 07:35:41,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:41,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229898714] [2022-12-06 07:35:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:41,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:42,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:42,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229898714] [2022-12-06 07:35:42,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229898714] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:42,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094434969] [2022-12-06 07:35:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:42,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:42,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:42,176 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:42,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 07:35:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:42,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 07:35:42,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:42,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:35:44,332 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:35:44,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 430 treesize of output 634 [2022-12-06 07:35:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:46,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094434969] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:35:46,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:35:46,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 07:35:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455215090] [2022-12-06 07:35:46,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:35:46,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:35:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:35:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:35:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:35:46,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 07:35:46,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 113 transitions, 1330 flow. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:46,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:35:46,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 07:35:46,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:35:47,421 INFO L130 PetriNetUnfolder]: 2620/4561 cut-off events. [2022-12-06 07:35:47,421 INFO L131 PetriNetUnfolder]: For 15118/15118 co-relation queries the response was YES. [2022-12-06 07:35:47,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16249 conditions, 4561 events. 2620/4561 cut-off events. For 15118/15118 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 28824 event pairs, 555 based on Foata normal form. 48/4596 useless extension candidates. Maximal degree in co-relation 15317. Up to 997 conditions per place. [2022-12-06 07:35:47,441 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 88 selfloop transitions, 53 changer transitions 38/179 dead transitions. [2022-12-06 07:35:47,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 179 transitions, 1807 flow [2022-12-06 07:35:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:35:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:35:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2022-12-06 07:35:47,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36419753086419754 [2022-12-06 07:35:47,442 INFO L175 Difference]: Start difference. First operand has 101 places, 113 transitions, 1330 flow. Second operand 9 states and 118 transitions. [2022-12-06 07:35:47,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 179 transitions, 1807 flow [2022-12-06 07:35:47,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 179 transitions, 1746 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 07:35:47,496 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 1251 flow [2022-12-06 07:35:47,496 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1251, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2022-12-06 07:35:47,496 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 78 predicate places. [2022-12-06 07:35:47,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:35:47,496 INFO L89 Accepts]: Start accepts. Operand has 107 places, 101 transitions, 1251 flow [2022-12-06 07:35:47,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:35:47,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:35:47,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 101 transitions, 1251 flow [2022-12-06 07:35:47,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 101 transitions, 1251 flow [2022-12-06 07:35:47,565 INFO L130 PetriNetUnfolder]: 63/636 cut-off events. [2022-12-06 07:35:47,565 INFO L131 PetriNetUnfolder]: For 1306/1306 co-relation queries the response was YES. [2022-12-06 07:35:47,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 636 events. 63/636 cut-off events. For 1306/1306 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5493 event pairs, 12 based on Foata normal form. 0/596 useless extension candidates. Maximal degree in co-relation 1574. Up to 81 conditions per place. [2022-12-06 07:35:47,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 101 transitions, 1251 flow [2022-12-06 07:35:47,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 586 [2022-12-06 07:35:47,569 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:35:47,570 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 07:35:47,570 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 1251 flow [2022-12-06 07:35:47,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:35:47,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:35:47,570 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:35:47,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 07:35:47,781 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-06 07:35:47,782 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 1 more)] === [2022-12-06 07:35:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:35:47,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1922663671, now seen corresponding path program 1 times [2022-12-06 07:35:47,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:35:47,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642886546] [2022-12-06 07:35:47,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:47,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:35:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:48,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:35:48,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642886546] [2022-12-06 07:35:48,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642886546] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:35:48,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025477614] [2022-12-06 07:35:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:35:48,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:35:48,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:35:48,413 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:35:48,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 07:35:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:35:48,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 07:35:48,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:35:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:35:48,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:35:55,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:35:55,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 821 treesize of output 1669 [2022-12-06 07:37:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:51,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025477614] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:37:51,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:37:51,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:37:51,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892494210] [2022-12-06 07:37:51,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:37:51,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:37:51,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:51,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:37:51,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:37:51,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 07:37:51,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 1251 flow. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:51,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:51,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 07:37:51,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:53,594 INFO L130 PetriNetUnfolder]: 2498/4410 cut-off events. [2022-12-06 07:37:53,594 INFO L131 PetriNetUnfolder]: For 17480/17480 co-relation queries the response was YES. [2022-12-06 07:37:53,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15753 conditions, 4410 events. 2498/4410 cut-off events. For 17480/17480 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 28190 event pairs, 563 based on Foata normal form. 64/4458 useless extension candidates. Maximal degree in co-relation 14619. Up to 826 conditions per place. [2022-12-06 07:37:53,613 INFO L137 encePairwiseOnDemand]: 17/36 looper letters, 116 selfloop transitions, 69 changer transitions 69/254 dead transitions. [2022-12-06 07:37:53,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 254 transitions, 2221 flow [2022-12-06 07:37:53,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:37:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:37:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 203 transitions. [2022-12-06 07:37:53,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33169934640522875 [2022-12-06 07:37:53,624 INFO L175 Difference]: Start difference. First operand has 107 places, 101 transitions, 1251 flow. Second operand 17 states and 203 transitions. [2022-12-06 07:37:53,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 254 transitions, 2221 flow [2022-12-06 07:37:53,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 254 transitions, 2102 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-06 07:37:53,683 INFO L231 Difference]: Finished difference. Result has 120 places, 106 transitions, 1355 flow [2022-12-06 07:37:53,683 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1355, PETRI_PLACES=120, PETRI_TRANSITIONS=106} [2022-12-06 07:37:53,683 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 91 predicate places. [2022-12-06 07:37:53,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:53,683 INFO L89 Accepts]: Start accepts. Operand has 120 places, 106 transitions, 1355 flow [2022-12-06 07:37:53,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:53,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:53,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 106 transitions, 1355 flow [2022-12-06 07:37:53,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 106 transitions, 1355 flow [2022-12-06 07:37:53,747 INFO L130 PetriNetUnfolder]: 55/617 cut-off events. [2022-12-06 07:37:53,747 INFO L131 PetriNetUnfolder]: For 1275/1275 co-relation queries the response was YES. [2022-12-06 07:37:53,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 617 events. 55/617 cut-off events. For 1275/1275 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5323 event pairs, 11 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 1528. Up to 70 conditions per place. [2022-12-06 07:37:53,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 106 transitions, 1355 flow [2022-12-06 07:37:53,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 596 [2022-12-06 07:37:53,765 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:53,765 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:53,765 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:53,765 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:53,765 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:53,766 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:54,481 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:54,481 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:54,481 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:54,482 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:54,482 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:54,482 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:55,116 WARN L322 ript$VariableManager]: TermVariable LBE578 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:55,117 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:55,117 WARN L322 ript$VariableManager]: TermVariable LBE606 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:55,117 WARN L322 ript$VariableManager]: TermVariable LBE182 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:55,117 WARN L322 ript$VariableManager]: TermVariable LBE170 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:55,117 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:55,821 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:37:55,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2138 [2022-12-06 07:37:55,821 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 105 transitions, 1354 flow [2022-12-06 07:37:55,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:55,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:55,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:55,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 07:37:56,022 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-06 07:37:56,022 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 1 more)] === [2022-12-06 07:37:56,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:56,023 INFO L85 PathProgramCache]: Analyzing trace with hash 404703786, now seen corresponding path program 1 times [2022-12-06 07:37:56,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:56,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624727806] [2022-12-06 07:37:56,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:56,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:56,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-06 07:37:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:56,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624727806] [2022-12-06 07:37:56,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624727806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:37:56,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737602606] [2022-12-06 07:37:56,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:56,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:56,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:56,683 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:37:56,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 07:37:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:56,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 07:37:56,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:37:56,912 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-06 07:37:56,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:37:56,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:37:57,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:37:57,279 INFO L321 Elim1Store]: treesize reduction 49, result has 53.3 percent of original size [2022-12-06 07:37:57,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 108 [2022-12-06 07:37:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:37:57,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:38:10,047 WARN L233 SmtUtils]: Spent 10.63s on a formula simplification. DAG size of input: 125 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:38:12,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:12,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 429 treesize of output 342 [2022-12-06 07:38:12,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:12,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 279002 treesize of output 257545 [2022-12-06 07:38:13,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:13,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 257146 treesize of output 243785 [2022-12-06 07:38:13,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:13,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243738 treesize of output 237081 [2022-12-06 07:38:14,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:14,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 237034 treesize of output 233729 [2022-12-06 07:38:15,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:15,345 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 233682 treesize of output 232036 [2022-12-06 07:38:16,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:16,100 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 232018 treesize of output 231204 [2022-12-06 07:38:16,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:16,843 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 231186 treesize of output 230788 [2022-12-06 07:38:17,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:17,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 230770 treesize of output 218018 [2022-12-06 07:38:18,306 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-06 07:38:18,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:18,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 217970 treesize of output 192418 [2022-12-06 07:38:19,189 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:19,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 192370 treesize of output 141218 [2022-12-06 07:38:19,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:19,956 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 141170 treesize of output 141135 [2022-12-06 07:38:20,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:20,732 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 141122 treesize of output 141039 [2022-12-06 07:38:21,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:38:21,549 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 141026 treesize of output 141015 [2022-12-06 07:45:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:45:53,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737602606] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:53,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:53,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 20 [2022-12-06 07:45:53,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217381265] [2022-12-06 07:45:53,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:53,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 07:45:53,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:53,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 07:45:53,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=346, Unknown=14, NotChecked=0, Total=462 [2022-12-06 07:45:53,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 07:45:53,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 105 transitions, 1354 flow. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:45:53,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:53,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 07:45:53,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:59,309 INFO L130 PetriNetUnfolder]: 3801/6721 cut-off events. [2022-12-06 07:45:59,309 INFO L131 PetriNetUnfolder]: For 27668/27668 co-relation queries the response was YES. [2022-12-06 07:45:59,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24309 conditions, 6721 events. 3801/6721 cut-off events. For 27668/27668 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 46741 event pairs, 674 based on Foata normal form. 8/6710 useless extension candidates. Maximal degree in co-relation 22852. Up to 1260 conditions per place. [2022-12-06 07:45:59,335 INFO L137 encePairwiseOnDemand]: 14/39 looper letters, 84 selfloop transitions, 114 changer transitions 69/267 dead transitions. [2022-12-06 07:45:59,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 267 transitions, 2830 flow [2022-12-06 07:45:59,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 07:45:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 07:45:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 185 transitions. [2022-12-06 07:45:59,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23717948717948717 [2022-12-06 07:45:59,340 INFO L175 Difference]: Start difference. First operand has 119 places, 105 transitions, 1354 flow. Second operand 20 states and 185 transitions. [2022-12-06 07:45:59,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 267 transitions, 2830 flow [2022-12-06 07:45:59,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 267 transitions, 2726 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-12-06 07:45:59,477 INFO L231 Difference]: Finished difference. Result has 136 places, 148 transitions, 2194 flow [2022-12-06 07:45:59,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2194, PETRI_PLACES=136, PETRI_TRANSITIONS=148} [2022-12-06 07:45:59,477 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 107 predicate places. [2022-12-06 07:45:59,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:59,478 INFO L89 Accepts]: Start accepts. Operand has 136 places, 148 transitions, 2194 flow [2022-12-06 07:45:59,478 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:59,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:59,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 148 transitions, 2194 flow [2022-12-06 07:45:59,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 148 transitions, 2194 flow [2022-12-06 07:45:59,600 INFO L130 PetriNetUnfolder]: 75/949 cut-off events. [2022-12-06 07:45:59,601 INFO L131 PetriNetUnfolder]: For 2491/2491 co-relation queries the response was YES. [2022-12-06 07:45:59,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2746 conditions, 949 events. 75/949 cut-off events. For 2491/2491 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9458 event pairs, 19 based on Foata normal form. 0/898 useless extension candidates. Maximal degree in co-relation 2585. Up to 105 conditions per place. [2022-12-06 07:45:59,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 148 transitions, 2194 flow [2022-12-06 07:45:59,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 920 [2022-12-06 07:46:00,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:46:00,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1457 [2022-12-06 07:46:00,935 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 148 transitions, 2206 flow [2022-12-06 07:46:00,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:46:00,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:00,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:00,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 07:46:01,136 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-06 07:46:01,136 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:01,136 INFO L85 PathProgramCache]: Analyzing trace with hash 686923013, now seen corresponding path program 1 times [2022-12-06 07:46:01,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:01,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488318528] [2022-12-06 07:46:01,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:01,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:46:01,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:01,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488318528] [2022-12-06 07:46:01,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488318528] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:46:01,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706442226] [2022-12-06 07:46:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:01,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:01,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:46:01,386 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:46:01,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 07:46:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:01,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:46:01,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:46:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:46:01,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:46:02,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:46:02,166 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 274 treesize of output 284 [2022-12-06 07:46:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:46:02,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706442226] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:46:02,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:46:02,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 07:46:02,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641972439] [2022-12-06 07:46:02,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:46:02,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:46:02,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:46:02,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:46:02,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:46:02,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:46:02,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 148 transitions, 2206 flow. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 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-06 07:46:02,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:46:02,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:46:02,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:46:03,527 INFO L130 PetriNetUnfolder]: 4103/7235 cut-off events. [2022-12-06 07:46:03,527 INFO L131 PetriNetUnfolder]: For 36342/36342 co-relation queries the response was YES. [2022-12-06 07:46:03,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27168 conditions, 7235 events. 4103/7235 cut-off events. For 36342/36342 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 50222 event pairs, 2431 based on Foata normal form. 24/7248 useless extension candidates. Maximal degree in co-relation 24616. Up to 3929 conditions per place. [2022-12-06 07:46:03,558 INFO L137 encePairwiseOnDemand]: 32/41 looper letters, 160 selfloop transitions, 19 changer transitions 19/198 dead transitions. [2022-12-06 07:46:03,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 198 transitions, 2903 flow [2022-12-06 07:46:03,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:46:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:46:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-06 07:46:03,559 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2022-12-06 07:46:03,559 INFO L175 Difference]: Start difference. First operand has 136 places, 148 transitions, 2206 flow. Second operand 5 states and 83 transitions. [2022-12-06 07:46:03,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 198 transitions, 2903 flow [2022-12-06 07:46:03,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 198 transitions, 2675 flow, removed 68 selfloop flow, removed 6 redundant places. [2022-12-06 07:46:03,705 INFO L231 Difference]: Finished difference. Result has 134 places, 137 transitions, 1890 flow [2022-12-06 07:46:03,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1890, PETRI_PLACES=134, PETRI_TRANSITIONS=137} [2022-12-06 07:46:03,705 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 105 predicate places. [2022-12-06 07:46:03,705 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:46:03,705 INFO L89 Accepts]: Start accepts. Operand has 134 places, 137 transitions, 1890 flow [2022-12-06 07:46:03,706 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:46:03,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:46:03,706 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 137 transitions, 1890 flow [2022-12-06 07:46:03,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 137 transitions, 1890 flow [2022-12-06 07:46:03,793 INFO L130 PetriNetUnfolder]: 77/930 cut-off events. [2022-12-06 07:46:03,794 INFO L131 PetriNetUnfolder]: For 2761/2761 co-relation queries the response was YES. [2022-12-06 07:46:03,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2650 conditions, 930 events. 77/930 cut-off events. For 2761/2761 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9041 event pairs, 17 based on Foata normal form. 0/879 useless extension candidates. Maximal degree in co-relation 2421. Up to 102 conditions per place. [2022-12-06 07:46:03,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 137 transitions, 1890 flow [2022-12-06 07:46:03,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 856 [2022-12-06 07:46:10,386 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:46:10,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6681 [2022-12-06 07:46:10,386 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 137 transitions, 1910 flow [2022-12-06 07:46:10,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 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-06 07:46:10,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:46:10,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:46:10,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 07:46:10,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:10,587 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:46:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:46:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash 854374175, now seen corresponding path program 1 times [2022-12-06 07:46:10,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:46:10,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379806415] [2022-12-06 07:46:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:10,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:46:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:46:12,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:46:12,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379806415] [2022-12-06 07:46:12,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379806415] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:46:12,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747632023] [2022-12-06 07:46:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:46:12,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:46:12,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:46:12,122 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:46:12,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 07:46:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:46:12,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:46:12,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:46:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:46:12,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:46:13,485 INFO L321 Elim1Store]: treesize reduction 126, result has 74.0 percent of original size [2022-12-06 07:46:13,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1157 treesize of output 1370 Received shutdown request... [2022-12-06 07:47:11,477 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 07:47:11,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 07:47:11,518 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:47:11,519 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:47:11,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:47:11,678 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-4-1 context. [2022-12-06 07:47:11,679 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 07:47:11,679 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 07:47:11,679 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 07:47:11,680 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:47:11,682 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:47:11,682 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:47:11,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:47:11 BasicIcfg [2022-12-06 07:47:11,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:47:11,684 INFO L158 Benchmark]: Toolchain (without parser) took 837835.94ms. Allocated memory was 213.9MB in the beginning and 1.2GB in the end (delta: 954.2MB). Free memory was 190.1MB in the beginning and 1.0GB in the end (delta: -836.7MB). Peak memory consumption was 733.8MB. Max. memory is 8.0GB. [2022-12-06 07:47:11,684 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 213.9MB. Free memory is still 191.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:47:11,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.28ms. Allocated memory is still 213.9MB. Free memory was 190.1MB in the beginning and 175.1MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 07:47:11,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.90ms. Allocated memory is still 213.9MB. Free memory was 175.1MB in the beginning and 172.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 07:47:11,684 INFO L158 Benchmark]: Boogie Preprocessor took 58.63ms. Allocated memory is still 213.9MB. Free memory was 172.5MB in the beginning and 170.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:47:11,685 INFO L158 Benchmark]: RCFGBuilder took 593.66ms. Allocated memory is still 213.9MB. Free memory was 170.4MB in the beginning and 123.7MB in the end (delta: 46.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-12-06 07:47:11,685 INFO L158 Benchmark]: TraceAbstraction took 836881.45ms. Allocated memory was 213.9MB in the beginning and 1.2GB in the end (delta: 954.2MB). Free memory was 123.2MB in the beginning and 1.0GB in the end (delta: -903.6MB). Peak memory consumption was 666.6MB. Max. memory is 8.0GB. [2022-12-06 07:47:11,686 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 213.9MB. Free memory is still 191.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.28ms. Allocated memory is still 213.9MB. Free memory was 190.1MB in the beginning and 175.1MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.90ms. Allocated memory is still 213.9MB. Free memory was 175.1MB in the beginning and 172.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.63ms. Allocated memory is still 213.9MB. Free memory was 172.5MB in the beginning and 170.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 593.66ms. Allocated memory is still 213.9MB. Free memory was 170.4MB in the beginning and 123.7MB in the end (delta: 46.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 836881.45ms. Allocated memory was 213.9MB in the beginning and 1.2GB in the end (delta: 954.2MB). Free memory was 123.2MB in the beginning and 1.0GB in the end (delta: -903.6MB). Peak memory consumption was 666.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8s, 223 PlacesBefore, 29 PlacesAfterwards, 240 TransitionsBefore, 25 TransitionsAfterwards, 2442 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 154 TrivialYvCompositions, 40 ConcurrentYvCompositions, 16 ChoiceCompositions, 210 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1539, independent: 1539, independent conditional: 1539, 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: 1539, independent: 1539, independent conditional: 0, independent unconditional: 1539, 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: 1539, independent: 1539, independent conditional: 0, independent unconditional: 1539, 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: 1539, independent: 1539, independent conditional: 0, independent unconditional: 1539, 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: 1164, independent: 1164, independent conditional: 0, independent unconditional: 1164, 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: 1164, independent: 1164, independent conditional: 0, independent unconditional: 1164, 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: 1539, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1164, unknown conditional: 0, unknown unconditional: 1164] , Statistics on independence cache: Total cache size (in pairs): 2182, Positive cache size: 2182, Positive conditional cache size: 0, Positive unconditional cache size: 2182, 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, 26 PlacesBefore, 26 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 120 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.8s, 30 PlacesBefore, 30 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 120 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, 30 PlacesBefore, 30 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 102 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, 31 PlacesBefore, 31 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 96 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.7s, 33 PlacesBefore, 33 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 14, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 36 PlacesBefore, 36 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 130 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): 14, Positive cache size: 14, Positive conditional cache size: 14, 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: 6.9s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 206 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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, 46 TransitionsBefore, 46 TransitionsAfterwards, 218 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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: 6.6s, 59 PlacesBefore, 59 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 47, Positive conditional cache size: 47, 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: 11.8s, 69 PlacesBefore, 69 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 47, Positive conditional cache size: 47, 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, 65 PlacesBefore, 65 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 306 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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, 58 PlacesBefore, 57 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 224 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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: 22.0s, 82 PlacesBefore, 82 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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, 95 PlacesBefore, 95 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 546 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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, 101 PlacesBefore, 101 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 670 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): 47, Positive cache size: 47, Positive conditional cache size: 47, 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, 101 TransitionsBefore, 101 TransitionsAfterwards, 586 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): 47, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 120 PlacesBefore, 119 PlacesAfterwards, 106 TransitionsBefore, 105 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 97, Positive conditional cache size: 97, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 136 PlacesBefore, 136 PlacesAfterwards, 148 TransitionsBefore, 148 TransitionsAfterwards, 920 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): 97, Positive cache size: 97, Positive conditional cache size: 97, 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: 6.6s, 128 PlacesBefore, 128 PlacesAfterwards, 137 TransitionsBefore, 137 TransitionsAfterwards, 856 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): 97, Positive cache size: 97, Positive conditional cache size: 97, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 162]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-4-1 context. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-4-1 context. - TimeoutResultAtElement [Line: 155]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-4-1 context. - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 22 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-4-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∨-4-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 264 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 836.8s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 52.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 71 mSolverCounterUnknown, 2465 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2465 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 464 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3962 IncrementalHoareTripleChecker+Invalid, 4499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 464 mSolverCounterUnsat, 0 mSDtfsCounter, 3962 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 423 SyntacticMatches, 7 SemanticMatches, 197 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 55.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2206occurred in iteration=19, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 637.7s InterpolantComputationTime, 675 NumberOfCodeBlocks, 675 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 869 ConstructedInterpolants, 37 QuantifiedInterpolants, 29892 SizeOfPredicates, 614 NumberOfNonLiveVariables, 4015 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 46 InterpolantComputations, 8 PerfectInterpolantSequences, 67/132 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown